Abstract
Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. This is a particularly important challenge with high dimensional data where the curse of dimensionality occurs. It has also the benefit of providing smaller descriptions of the clusters found.
Existing methods only consider numerical databases and do not propose any method for clusters visualization. Besides, they require some input parameters difficult to set for the user. The aim of this paper is to propose a new subspace clustering algorithm, able to tackle databases that may contain continuous as well as discrete attributes, requiring as few user parameters as possible, and producing an interpretable output.
We present a method based on the use of the well-known EM algorithm on a probabilistic model designed under some specific hypotheses, allowing us to present the result as a set of rules, each one defined with as few relevant dimensions as possible. Experiments, conducted on artificial as well as real databases, show that our algorithm gives robust results, in terms of classification and interpretability of the output.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, C.C., Wolf, J.L., Yu, P.S., Procopiuc, C., Park, J.S.: Fast algorithms for projected clustering. In: ACM SIGMOD Int. Conf. on Management of Data, pp. 61–72 (1999)
Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: ACM SIGMOD Int. Conf. on Management of Data, Seattle, Washington, pp. 94–105 (1998)
Berkhin, P.: Survey of clustering data mining techniques. Technical report, Accrue Software, San Jose, California (2002)
Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
Bradley, P., Fayyad, U., Reina, C.: Scaling EM (Expectation-Maximization) clustering to large databases. Technical report, Microsoft Research (August 1998)
Cheng, C.H., Fu, A.W.-C., Zhang, Y.: Entropy-based subspace clustering for mining numerical data. In: Knowledge Discovery and Data Mining, pp. 84–93 (1999)
Domeniconi, C., Papadopoulos, D., Gunopolos, D., Ma, S.: Subspace clustering of high dimensional data. In: SIAM Int. Conf. on Data Mining (2004)
Kailing, K., Kriegel, H.-P., Kröger, P.: Density-connected subspace clustering for high-dimensional data. In: SIAM Int. Conf. on Data Mining, pp. 246–257 (2004)
Nagesh, H., Goil, S., Choudhary, A.: Mafia: Efficient and scalable subspace clustering for very large data sets. Technical report, Northwestern University (1999)
Parsons, L., Haque, E., Liu, H.: Evaluating subspace clustering algorithms. In: Workshop on Clustering High Dimensional Data and its Applications, SIAM Int. Conf. on Data Mining, pp. 48–56 (2004)
Pelleg, D., Moore, A.: Mixtures of rectangles: Interpretable soft clustering. In: Brodley, C., Danyluk, A. (eds.) 18th Int. Conf. on Machine Learning, pp. 401–408. Morgan Kaufmann, San Francisco (2001)
Sarafis, I.A., Trinder, P.W., Zalzala, A.M.S.: Towards effective subspace clustering with an evolutionary algorithm. In: IEEE Congress on Evolutionary Computation, Canberra, Australia (December 2003)
Woo, K.-G., Lee, J.-H.: FINDIT: a fast and intelligent subspace clustering algorithm using dimension voting. PhD thesis, Korea Advanced Institute of Science and Technology, Department of Electrical Engineering and Computer Science (2002)
Ye, L., Spetsakis, M.E.: Clustering on unobserved data using mixture of gaussians. Technical report, York University, Toronto, Canada (October 2003)
Yip, K.Y., Cheung, D.W., Ng, M.K.: A highly-usable projected clustering algorithm for gene expression profiles. In: 3rd ACM SIGKDD Workshop on Data Mining in Bioinformatics, pp. 41–48 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Candillier, L., Tellier, I., Torre, F., Bousquet, O. (2005). SSC: Statistical Subspace Clustering. In: Perner, P., Imiya, A. (eds) Machine Learning and Data Mining in Pattern Recognition. MLDM 2005. Lecture Notes in Computer Science(), vol 3587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11510888_11
Download citation
DOI: https://doi.org/10.1007/11510888_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26923-6
Online ISBN: 978-3-540-31891-0
eBook Packages: Computer ScienceComputer Science (R0)