MNAR- k-means: A k-means Clustering for Data Missing Not at Random with Magnitude-Decaying Probability

arXiv:2606.31253 · stat.ML, cs.LG · Submitted 2026-06-30 · Read on arXiv

Xin Guan

stat.ML, cs.LG

Submitted: 2026-06-30

Code: https://github.com/GXguanxin/MNAR-k-means

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Clustering — 82× in this paper · explained in 2 episodes
• K-means Clustering — 18× in this paper · explained in 3 episodes
• Consistency — 13× in this paper · explained in 3 episodes
• Loss Function — 12× in this paper · explained in 2 episodes
• Accuracy — 7× in this paper · explained in 1 episode
• Matrix Completion — 4× in this paper · explained in 4 episodes
• Benchmark — 3× in this paper · explained in 2 episodes
• Quantization — 2× in this paper · explained in 15 episodes
• VC Dimension — 2× in this paper · explained in 2 episodes
• Dimensionality Reduction — 1× in this paper · explained in 2 episodes
• Objective Function — 1× in this paper · explained in 2 episodes
• Regularization — 1× in this paper · explained in 3 episodes
• Signal-to-Noise Ratio (SNR) — 1× in this paper · explained in 6 episodes

Related papers

• Behavior of prediction performance metrics with rare events
• Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs
• A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors
• Scalable Posterior Uncertainty for Flexible Density-Based Clustering
• A Transport Geometry of Benign Overfitting
• Efficient quadratic entropy with distance sketches