title: Counting clusters using R-NN curves.
abstract: Clustering is a common task in the field of cheminformatics. A key parameter that needs to be set for nonhierarchical clustering methods, such as k-means, is the number of clusters, k. Traditionally, the value of k is obtained by performing the clustering with different values of k and selecting that value that leads to the optimal clustering. In this study, we describe an approach to selecting k, a priori, based on the R-NN curve algorithm described by Guha et al. (J. Chem. Inf. Model., 2006, 46, 1713-722), which uses a nearest-neighbor technique to characterize the spatial location of compounds in arbitrary descriptor spaces. The algorithm generates a set of curves for the data set which are then analyzed to estimate the natural number of clusters. We then performed k-means clustering with the predicted value of k as well as with similar values to check that the correct number of clusters was obtained. In addition, we compared the predicted value to the number indicated by the average silhouette width as a cluster quality measure. We tested the algorithm on simulated data as well as on two chemical data sets. Our results indicate that the R-NN curve algorithm is able to determine the natural number of clusters and is in general agreement the average silhouette width in identifying the optimal number of clusters.
authors.affiliation: School of Informatics, Indiana University, Bloomington, Indiana 47406, USA. rguha@indiana.edu
authors.forename: Rajarshi
authors.initials: R
authors.lastname: Guha
authors.forename: Debojyoti
authors.initials: D
authors.lastname: Dutta
authors.forename: David J
authors.initials: DJ
authors.lastname: Wild
authors.forename: Ting
authors.initials: T
authors.lastname: Chen
mesh_terms: D055598:Chemical Phenomena; D002621:Chemistry; D016000:Cluster Analysis; D048088:Informatics