bioRxivBiophysics
k-Means NANI: an improved clustering algorithm for Molecular Dynamics simulations
L. Chen, D. R. Roe, M. Kochert, C. Simmerling, R. A. Miranda Quintana
Abstract
One of the key challenges of k-means clustering is the seed selection or the initial centroid estimation since the clustering result depends heavily on this choice. Alternatives such as k-means++ have mitigated this limitation by estimating the centroids using an empirical probability distribution. However, with high-dimensional and complex datasets such as those obtained from molecular simulation, k-means++ fails to partition the data in an optimal manner. Furthermore, stochastic elements in all flavors of k-means++ will lead to a lack of reproducibility. K-means N-Ary Natural Initiation (NANI) is presented as an alternative to tackle this challenge by using efficient n-ary comparisons to both identify high-density regions in the data and select a diverse set of initial conformations. Centroids generated from NANI are not only representative of the data and different from one another, helping k-means to partition the data accurately, but also deterministic, providing consistent cluster populations across replicates. From peptide and protein folding molecular simulations, NANI was able to create compact and well-separated clusters as well as accurately find the metastable states that agree with the literature. NANI can cluster diverse datasets and be used as a standalone tool or as part of our MDANCE clustering package.
- research focus: clustering
- research focus: trajectory inference
- approach: deep learning
- approach: statistical model
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Scaling k-Means for Multi-Million Frames: A Stratified NANI Approach for Large-Scale MD Simulations
Jherome Brylle Woody Santos, L Y Chen, Ramón Alain Miranda‐Quintana·Journal of Chemical Information and ModelingPeer-reviewed·Apr 21, 2026
- Divide and Cluster: The DIVINE Framework for Deterministic Top-Down Analysis of Molecular Dynamics Trajectories
Jhonathan Pedroso Rigal dos Santos, Lexin Chen, Ramón Alain Miranda‐Quintana·Journal of Chemical Information and ModelingPeer-reviewed·Apr 10, 2026
- CADENCE: Clustering Algorithm - Density-based Exploration and Novelty Clustering with Efficiency
Lexin Chen, Daniel R. Roe, Ramón Alain Miranda‐Quintana·Journal of Chemical Information and ModelingPeer-reviewed·Jun 17, 2025
- Hierarchical Extended Linkage Method (HELM)'s Deep Dive into Hybrid Clustering Strategies
Lexin Chen, Jhonathan Pedroso Rigal dos Santos, … Ramón Alain Miranda‐Quintana·Journal of Chemical Information and ModelingPeer-reviewed·Jun 2, 2025
- CommonNNClustering--A Python package for generic common-nearest-neighbour clustering
Jan-Oliver Kapp-Joswig, Bettina G. Keller·bioRxiv·Nov 28, 2022
- SHINE: Deterministic Many-to-Many clustering of Molecular Pathways
Lexin Chen, Jeremy M. G. Leung, … Ramón Alain Miranda‐Quintana·Journal of Chemical Information and ModelingPeer-reviewed·May 6, 2025