OATAO - Open Archive Toulouse Archive Ouverte Open Access Week

Clustering analysis of railway driving missions with niching

Jaafar, Amine and Sareni, Bruno and Roboam, Xavier Clustering analysis of railway driving missions with niching. (2012) COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering, vol. 31 (n° 3). pp. 920-931. ISSN 0332-1649

[img]
Preview
(Document in English)

PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
286Kb

Official URL: http://dx.doi.org/10.1108/03321641211209807

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.

Item Type:Article
Additional Information:Thanks to Emerald editor. The current issue and full text archive of this journal is available at www.emeraldinsight.com/0332-1649.htm
Audience (journal):International peer-reviewed journal
Uncontrolled Keywords:
Institution:French research institutions > Centre National de la Recherche Scientifique - CNRS
Université de Toulouse > Institut National Polytechnique de Toulouse - INPT
Université de Toulouse > Université Paul Sabatier-Toulouse III - UPS
Laboratory name:
Statistics:download
Deposited By:Bruno SARENI

Repository Staff Only: item control page