An efficient k‐means‐type algorithm for clustering datasets with incomplete records

DOI10.1002/sam.11392OpenAlexW2788804377MaRDI QIDQ4970437

Andrew Lithio, Ranjan Maitra

Publication date: 14 October 2020

Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.08363

zbMATH Keywords

miceAmeliaimputationfMRICARPsoft constraintsSDSSjump statistick-means++k-POD

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Related Items

Unnamed Item

Uses Software

• R
• Amelia
• MixSim
• CARP
• MICE
• AS 136
• kpodclustr

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithm AS 136: A K-Means Clustering Algorithm
• Rough subspace neuro-fuzzy system
• The statistical analysis of functional MRI data
• Finite mixture models and model-based clustering
• MM Optimization Algorithms
• A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering
• Clustering in the Presence of Scatter
• Finding the Number of Clusters in a Dataset
• Least squares quantization in PCM
• Bootstrapping for Significance of Compact Clusters in Multidimensional Datasets
• Clustering with Missing Values
• The effectiveness of lloyd-type methods for the k-means problem
• k-POD: A Method for k-Means Clustering of Missing Data