Issue No. 07 - July (2012 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.256
Lifei Chen , Fujian Normal University, Fuzhou
Qingshan Jiang , Chinese Academy of Sciences, Xili Nanshan
Shengrui Wang , University of Sherbooke, Quebec
Clustering high-dimensional data is a major challenge due to the curse of dimensionality. To solve this problem, projective clustering has been defined as an extension to traditional clustering that attempts to find projected clusters in subsets of the dimensions of a data space. In this paper, a probability model is first proposed to describe projected clusters in high-dimensional data space. Then, we present a model-based algorithm for fuzzy projective clustering that discovers clusters with overlapping boundaries in various projected subspaces. The suitability of the proposal is demonstrated in an empirical study done with synthetic data set and some widely used real-world data set.
Clustering, high dimensions, projective clustering, probability model.
Q. Jiang, L. Chen and S. Wang, "Model-Based Method for Projective Clustering," in IEEE Transactions on Knowledge & Data Engineering, vol. 24, no. , pp. 1291-1305, 2010.