Key points are not available for this paper at this time.
Clustering of chemical inventories on the basis of structural similarity has been shown to be useful in a number of applications related to the utilization and enhancement of those inventories. However, the widely-used Jarvis−Patrick clustering algorithm displays a number of weaknesses which make it difficult to cluster large databases in a consistent, satisfactory, and timely manner. Jarvis−Patrick clusters tend to be either too large and heterogeneous (i.e., “chained”) or too small and exclusive (i.e., under-clustered), and the algorithm requires time-consuming manual tuning. This paper describes a computer algorithm which is nondirective, in that it performs the clustering without manual tuning yet generates useful clustering results.
Building similarity graph...
Analyzing shared references across papers
Loading...
Doman et al. (Mon,) studied this question.
www.synapsesocial.com/papers/6a0ff2fdd8c5cf602efd686e — DOI: https://doi.org/10.1021/ci960361r
Thompson N. Doman
John M. Cibulskis
Michael J. Cibulskis
Journal of Chemical Information and Computer Sciences
Building similarity graph...
Analyzing shared references across papers
Loading...