Rajarshi Guha1, Debojyoti Dutta, David J Wild
1School of Informatics, Indiana University, Bloomington, Indiana 47406, USA. rguha@indiana.edu
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
This study introduces the R-NN curve algorithm to determine the optimal number of clusters (k) for k-means clustering in cheminformatics. The R-NN curve method accurately estimates k, aligning with cluster quality measures.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: