Clustering is the task of categorizing objects into different classes in an unsupervised way. Hierarchical clustering algorithms are usually very effective in detecting the dataset underlying structure. However, they do not create clusters, but compute only a hierarchical representation of the dataset. It is then desirable to define an automatic technique for cluster creation in hiearchical clustering algorithms. To this purpose, in this paper we present an algorithm that finds the best clustering partition according to clustering validity indexes. In particular, our automatic approach performs a validity index-driven search through a clustering tree. The best partition is then selected cutting the tree in a non-horizontal way. The algorithm was implemented in a software tool and then tested on different datasets. The overall system makes then hierarchical clustering an automatic step, where no user interaction is needed in order to select clusters from a hierarchical cluster representation. © Springer-Verlag 2009.
CITATION STYLE
Ferraretti, D., Gamberoni, G., & Lamma, E. (2009). Automatic cluster selection using index driven search strategy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5883 LNAI, pp. 172–181). https://doi.org/10.1007/978-3-642-10291-2_18
Mendeley helps you to discover research relevant for your work.