Skip to Main content Skip to Navigation
Journal articles

Clustering analysis of railway driving missions with niching

Abstract : A wide number of applications requires classifying or grouping data into a set of categories or clusters. Most popular clustering techniques to achieve this objective are K-means clustering and hierarchical clustering. However, both of these methods necessitate the a priori setting of the cluster number. In this paper, a clustering method based on the use of a niching genetic algorithm is presented, with the aim of finding the best compromise between the inter-cluster distance maximization and the intra-cluster distance minimization. This method is applied to three clustering benchmarks and to the classification of driving missions for railway applications.
Document type :
Journal articles
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Thursday, December 6, 2012 - 5:20:33 PM
Last modification on : Wednesday, July 1, 2020 - 2:16:02 PM
Long-term archiving on: : Thursday, March 7, 2013 - 7:00:07 AM


Files produced by the author(s)




Amine Jaafar, Bruno Sareni, Xavier Roboam. Clustering analysis of railway driving missions with niching. COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering, Emerald, 2012, vol. 31, pp.920-931. ⟨10.1108/03321641211209807⟩. ⟨hal-00762266⟩



Record views


Files downloads