Journal of Chemical Information and Modeling · 2022 · 25 citations · 31 references
PharmacyChemistryMedicinal ChemistryComputational ChemistryDrug DesignDrug DiscoveryChemical Library DesignChemical Space ExplorationComputational Drug DiscoveryDimensionality ReductionPrincipal Component AnalysisVirtual ScreeningBaggingChemical Diversity AnalysisCluster Analysis For GroupingClustering AlgorithmsGaussian Mixture ModelsHierarchical ClusteringUniform Manifold Approximation And ProjectionVirtual Screening Validation
The clustering of small molecules implies the organization of a group of chemical structures into smaller subgroups with similar features. Clustering has important applications to sample chemical datasets or libraries in a representative manner (e.g., to choose, from a virtual screening hit list, a chemically diverse subset of compounds to be submitted to experimental confirmation, or to split datasets into representative training and validation sets when implementing machine learning models). Most strategies for clustering molecules are based on molecular fingerprints and hierarchical clustering algorithms. Here, two open-source in-house methodologies for clustering of small molecules are presented: iterative Random subspace Principal Component Analysis clustering (iRaPCA), an iterative approach based on feature bagging, dimensionality reduction, and K-means optimization; and Silhouette Optimized Molecular Clustering (SOMoC), which combines molecular fingerprints with the Uniform Manifold Approximation and Projection (UMAP) and Gaussian Mixture Model algorithm (GMM). In a benchmarking exercise, the performance of both clustering methods has been examined across 29 datasets containing between 100 and 5000 small molecules, comparing these results with those given by two other well-known clustering methods, Ward and Butina. iRaPCA and SOMoC consistently showed the best performance across these 29 datasets, both in terms of within-cluster and between-cluster distances. Both iRaPCA and SOMoC have been implemented as free Web Apps and standalone applications, to allow their use to a wide audience within the scientific community.
31
SciPy 1.0: fundamental algorithms for scientific computing in Python
Nature Methods · 2020 · 37.9K citations · Full text
Least squares quantization in PCM
Sheelagh Lloyd · IEEE Transactions on Information Theory · 1982 · 15.6K citations · Full text
UMAP: Uniform Manifold Approximation and Projection
Leland McInnes, John Healy, Nathaniel Saul et al. · The Journal of Open Source Software · 2018 · 9.6K citations · Full text