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

Abstract

<p>The <em>k</em>‐means algorithm is arguably the most popular nonparametric clustering method but cannot generally be applied to datasets with incomplete records. The usual practice then is to either impute missing values under an assumed missing‐completely‐at‐random mechanism or to ignore the incomplete records, and apply the algorithm on the resulting dataset. We develop an efficient version of the <em>k</em>‐means algorithm that allows for clustering in the presence of incomplete records. Our extension is called <em>k</em><em>m</em>‐means and reduces to the <em>k</em>‐means algorithm when all records are complete. We also provide initialization strategies for our algorithm and methods to estimate the number of groups in the dataset. Illustrations and simulations demonstrate the efficacy of our approach in a variety of settings and patterns of missing data. Our methods are also applied to the analysis of activation images obtained from a functional magnetic resonance imaging experiment.</p>