Issue No. 07 - July (2006 vol. 18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.106
We present the first framework for comparing subspace clusterings. We propose several distance measures for subspace clusterings, including generalizations of well-known distance measures for ordinary clusterings. We describe a set of important properties for any measure for comparing subspace clusterings and give a systematic comparison of our proposed measures in terms of these properties. We validate the usefulness of our subspace clustering distance measures by comparing clusterings produced by the algorithms FastDOC, HARP, PROCLUS, ORCLUS, and SSPC. We show that our distance measures can be also used to compare partial clusterings, overlapping clusterings, and patterns in binary data matrices.
Subspace clustering, projected clustering, distance, feature selection, cluster validation.
M. Meila and A. Patrikainen, "Comparing Subspace Clusterings," in IEEE Transactions on Knowledge & Data Engineering, vol. 18, no. , pp. 902-916, 2006.