Subspace clustering

Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery

Volumn 2, Issue 4, 2012, Pages 351-364

  Kriegel, Hans Peter ^a   Kröger, Peer ^a   Zimek, Arthur ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; VECTOR SPACES;

ALGORITHMIC SOLUTIONS; CLUSTERING SOLUTIONS; DATA SPACE; SUB-SPACE CLUSTERING;

VECTORS;

EID: 84866446665     PISSN: 19424787     EISSN: 19424795     Source Type: Journal    
DOI: 10.1002/widm.1057     Document Type: Article

References (107)

1. Parsons L, Haque E, Liu H. Subspace clustering for high dimensional data: a review. SIGKDD Explor 2004, 6:90-105.
2. Kröger P, Zimek A. Subspace clustering techniques. In: Liu L, Özsu MT, eds. Encyclopedia of Database Systems. New York, NY: Springer; 2009 2873-2875.
3. Kriegel H-P, Kröger P, Zimek A. Clustering high dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans Knowl Discov Data 2009, 3:1-58.
4. Vidal R. Subspace clustering. IEEE Signal Process Mag 2011, 28:52-68.
5. Han J, Kamber M. Data Mining: Concepts and Techniques. 2nd ed. San Francisco, CA: Morgan Kaufmann; 2006.
6. Gan G, Ma C, Wu J. Data Clustering. Theory, Algorithms, and Applications. Philadelphia, PA: Society for Industrial and Applied Mathematics; 2007.
7. Moise G, Zimek A, Kröger P, Kriegel H-P, Sander J. Subspace and projected clustering: experimental evaluation and analysis. Knowl Inf Syst 2009, 21:299-326.
8. Müller E, Günnemann S, Assent I, Seidl T. Evaluating clustering in subspace projections of high dimensional data. In: Proceedings of the 35th International Conference on Very Large Data Bases (VLDB), Lyon, France; 2009.
9. Böhm C, Berchtold S, Keim DA. Searching in highdimensional spaces: index structures for improving the performance of multimedia databases. ACM Comput Surv 2001, 33:322-373.
10. Bellman R. Adaptive Control Processes. A Guided Tour. Princeton, NJ: Princeton University Press; 1961.
11. Beyer K, Goldstein J, Ramakrishnan R, Shaft U. When is 'nearest neighbor' meaningful? In: Proceedings of the 7th International Conference on Database Theory (ICDT), Jerusalem, Israel; 1999.
12. Hinneburg A, Aggarwal CC, Keim DA. What is the nearest neighbor in high dimensional spaces? In: Proceedings of the 26th International Conference on Very Large Data Bases (VLDB), Cairo, Egypt; 2000.
13. Aggarwal CC, Hinneburg A, Keim D. On the surprising behavior of distance metrics in high dimensional space. In: Proceedings of the 8th International Conference on Database Theory (ICDT), London; 2001.
14. Francois D, Wertz V, Verleysen M. The concentration of fractional distances. IEEE Trans Knowl Data Eng 2007, 19:873-886.
15. Bennett KP, Fayyad U, Geiger D. Density-based indexing for approximate nearest-neighbor queries. In: Proceedings of the 5th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Diego, CA; 1999.
16. Houle ME, Kriegel H-P, Kröger P, Schubert E, Zimek A. Can shared-neighbor distances defeat the curse of dimensionality? In: Proceedings of the 22nd International Conference on Scientific and Statistical Database Management (SSDBM), Heidelberg, Germany; 2010.
17. Bernecker T, Houle ME, Kriegel H-P, Kröger P, Renz M, Schubert E, Zimek A. Quality of similarity rankings in time series. In: Proceedings of the 12th International Symposium on Spatial and Temporal Databases (SSTD), Minneapolis, MN; 2011.
18. Achtert E, Böhm C, Kriegel H-P, Kröger P, Zimek A. Deriving quantitative models for correlation clusters. In: Proceedings of the 12th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Philadelphia, PA; 2006.
19. Korn F, Pagel B-U, Faloutsos C. On the 'dimensionality curse' and the 'self-similarity blessing'. IEEE Trans Knowl Data Eng 2001, 13:96-111.
20. Fowlkes EB, Mallows CL. A method for comparing two hierarchical clusterings. J Am Stat Assoc 1983, 78:553-569.
21. Milligan GW. An examination of the effect of six types of error perturbation on fifteen clustering algorithms. Psychometrika 1980, 45:325-342.
22. Fowlkes EB, Gnanadesikan R, Kettenring JR. Variable selection in clustering. J Classif 1988, 5:205-228.
23. Gnanadesikan R, Kettenring JR, Tsao SL. Weighting and selection of variables for cluster analysis. J Classif 1995, 12:113-136.
24. Steinley D, Brusco MJ. Selection of variables in cluster analysis: an empirical comparison of eight procedures. Psychometrika 2008, 73:125-144.
25. Guyon I, Elisseeff A. An introduction to variable and feature selection. J Mach Learn Res 2003, 3:1157-1182, 2003.
26. Yang L. Distance-preserving dimensionality reduction. WIREs Data Min Knowl Discov 2011, 1:369-380.
27. Achtert E, Hettab A, Kriegel H-P, Schubert E, Zimek A. Spatial outlier detection: data, algorithms, visualizations. In: Proceedings of the 12th International Symposium on Spatial and Temporal Databases (SSTD), Minneapolis, MN; 2011.
28. Madeira SC, Oliveira AL. Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Trans Comput Biol Bioinf 2004, 1:24-45.
29. Moise G, Sander J. Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering. In: Proceedings of the 14th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Las Vegas, NV; 2008.
30. Aggarwal CC, Procopiuc CM, Wolf JL, Yu PS, Park JS. Fast algorithms for projected clustering. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Philadelphia, PA; 1999.
31. Agrawal R, Gehrke J, Gunopulos D, Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Seattle, WA; 1998.
32. Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Minneapolis, MN; 1994.
33. Jing L, Ng MK, Huang JZ. An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data. IEEE Trans Knowl Data Eng 2007, 19:1026-1041.
34. Woo K-G, Lee J-H, Kim M-H, Lee Y-J. FINDIT: a fast and intelligent subspace clustering algorithm using dimension voting. Inf Softw Technol 2004, 46:255-271.
35. Yip KY, Cheung DW, Ng MK. On discovery of extremely low-dimensional clusters using semisupervised projected clustering. In: Proceedings of the 21st International Conference on Data Engineering (ICDE), Tokyo, Japan; 2005.
36. Böhm C, Kailing K, Kriegel H-P, Kröger P. Density connected clustering with local subspace preferences. In: Proceedings of the 4th IEEE International Conference on Data Mining (ICDM), Brighton, UK; 2004.
37. Domeniconi C, Papadopoulos D, Gunopulos D, Ma S. Subspace clustering of high dimensional data. In: Proceedings of the 4th SIAM International Conference on Data Mining (SDM), Lake Buena Vista, FL; 2004.
38. Friedman JH, Meulman JJ. Clustering objects on subsets of attributes. J R Stat Soc B 2004, 66:825-849.
39. Huang JZ, Ng MK, Rong H, Li Z. Automated variable weighting in k-means type clustering. IEEE Trans Pattern Anal Mach Intell; 2005, 27:657-668.
40. Bouveyron C, Girard S, Schmid C. High-dimensional data clustering. Comput Stat Data Anal 2007, 52:502-519.
41. Domeniconi C, Gunopulos D, Ma S, Yan B, M. Al Razgan, Papadopoulos D. Locally adaptive metrics for clustering high dimensional data. Data Min Knowl Discov 2007, 14:63-97.
42. Lu Y, Wang S, Li S, Zhou C. Particle swarm optimizer for variable weighting in clustering high-dimensional data. Mach Learn 2010, 82:43-70.
43. Dempster AP, Laird NM, Rubin DB. Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc B, 1977, 39:1-31.
44. Cheng CH, Fu AW-C, Zhang Y. Entropy-based subspace clustering for mining numerical data. In: Proceedings of the 5th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Diego, CA; 1999, 84-93.
45. Nagesh HS, Goil S, Choudhary A. Adaptive grids for clustering massive data sets. In: Proceedings of the 1st SIAM International Conference on Data Mining (SDM), Chicago, IL; 2001.
46. Assent I, Krieger R, Müller E, Seidl T. DUSC: dimensionality unbiased subspace clustering. In: Proceedings of the 7th IEEE International Conference on Data Mining (ICDM), Omaha, NE; 2007.
47. Liu G, Sim K, Li J, Wong L. Efficient mining of distance-based subspace clusters. Stat Anal Data Min 2009, 2:427-444.
48. Kailing K, Kriegel H-P, Kröger P. Density-connected subspace clustering for high-dimensional data. In: Proceedings of the 4th SIAM International Conference on Data Mining (SDM), Lake Buena Vista, FL; 2004.
49. Procopiuc CM, Jones M, Agarwal PK, Murali TM. A Monte Carlo algorithm for fast projective clustering. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Madison, WI; 2002.
50. Yip KY, Cheung DW, Ng MK. HARP: a practical projected clustering algorithm. IEEE Trans Knowl Data Eng 2004, 16:1387-1397.
51. Yiu ML, Mamoulis N. Iterative projected clustering by subspace mining. IEEE Trans Knowl Data Eng 2005, 17:176-189.
52. Kriegel H-P, Kröger P, Renz M, Wurst S. A generic framework for efficient subspace clustering of highdimensional data. In: Proceedings of the 5th IEEE International Conference on Data Mining (ICDM), Houston, TX; 2005.
53. Achtert E, Böhm C, Kriegel H-P, Kröger P, Müller-Gorman I, Zimek A. Detection and visualization of subspace cluster hierarchies. In: Proceedings of the 12th International Conference on Database Systems for Advanced Applications (DASFAA), Bangkok, Thailand; 2007.
54. Moise G, Sander J, Ester M. Robust projected clustering. Knowl Inf Syst 2008, 14:273-298.
55. Günnemann S, Müller E, Färber I, Seidl T. Detection of orthogonal concepts in subspaces of high dimensional data. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management (CIKM), Hong Kong, China; 2009.
56. Jolliffe IT. Principal Component Analysis. 2nd ed. New York, NY: Springer; 2002.
57. Aggarwal CC, Yu PS. Finding generalized projected clusters in high dimensional space. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Dallas, TX; 2000.
58. Chakrabarti K, Mehrotra S. Local dimensionality reduction: a new approach to indexing high dimensional spaces. In: Proceedings of the 26th International Conference on Very Large Data Bases (VLDB), Cairo, Egypt; 2000.
59. Böhm C, Kailing K, Kröger P, Zimek A. Computing clusters of correlation connected objects. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Paris, France; 2004.
60. Li J, Huang X, Selke C, Yong J. A fast algorithm for finding correlation clusters in noise data. In: Proceedings of the 11th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Nanjing, China; 2007.
61. Achtert E, Böhm C, Kriegel H-P, Kröger P, Zimek A. Robust, complete, and efficient correlation clustering.In: Proceedings of the 7th SIAM International Conference on Data Mining (SDM), Minneapolis, MN; 2007.
62. Achtert E, Böhm C, Kriegel H-P, Kröger P, Zimek A. On exploring complex relationships of correlation clusters. In: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (SSDBM), Banff, Canada; 2007.
63. Zhang X, Pan F, Wang W. CARE: finding local linear correlations in high dimensional data. In: Proceedings of the 24th International Conference on Data Engineering (ICDE), Cancun, Mexico; 2008.
64. Aziz MS, Reddy CK. A robust seedless algorithm for correlation clustering. In: Proceedings of the 14th Pacific-Asia Conference on KnowledgeDiscovery and Data Mining (PAKDD), Hyderabad, India; 2010.
65. Achtert E, Böhm C, David J, Kröger P, Zimek A. Robust clustering in arbitrarily oriented subspaces. In: Proceedings of the 8th SIAM International Conference on Data Mining (SDM), Atlanta, GA; 2008.
66. Achtert E, Böhm C, David J, Kröger P, Zimek A. Global correlation clustering based on the Hough transform. Stat Anal Data Min 2008, 1:111-127.
67. Cordeiro RLF, Traina AJM, Faloutsos C, Traina Jr C. Finding clusters in subspaces of very large, multidimensional datasets. In: Proceedings of the 26th International Conference on Data Engineering (ICDE), Long Beach, CA; 2010.
68. Fischler MA, Bolles RC. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun ACM 1981, 24:381-395.
69. Haralick R, Harpaz R. Linear manifold clustering. In: Proceedings of the 4th International Conference on Machine Learning and Data Mining in Pattern Recognition (MLDM), Leipzig, Germany; 2005.
70. Harpaz R, Haralick R. Mining subspace correlations. In: Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining (CIDM), Honolulu, HI; 2007.
71. Zimek A. Correlation clustering. ACM SIGKDD Explor 2009, 11:53-54.
72. Bansal N, Blum A, Chawla S. Correlation clustering. Mach Learn, 2004, 56:89-113.
73. Fern XZ, Davidson I, Dy J.G. MultiClust 2010: discovering, summarizing and using multiple clusterings. ACM SIGKDD Explor; 2010, 12:47-49.
74. Müller E, Günnemann S, Assent I, Seidl T, editors. Second MultiClustWorkshop: Discovering, Summarizing and Using Multiple Clusterings, Held in Conjunction with ECML PKDD 2011, Athens, Greece; 2011.
75. Kriegel H-P, Zimek A. Subspace clustering, ensemble clustering, alternative clustering, multiview clustering: what can we learn from each other? In: Multi-Clust: First International Workshop on Discovering, Summarizing and Using Multiple Clusterings Held in Conjunction with KDD 2010, Washington, DC; 2010.
76. Vreeken J, Zimek A. When pattern met subspace cluster-a relationship story. In: Second Multi-Clust Workshop: Discovering, Summarizing and Using Multiple Clusterings Held in Conjunction with ECML PKDD 2011, Athens, Greece; 2011.
77. Assent I, Müller E, Günnemann S, Krieger R, Seidl T. Less is more: Non-redundant subspace clustering. In: MultiClust: First InternationalWorkshop on Discovering, Summarizing and Using Multiple Clusterings Held in Conjunction with KDD 2010, Washington, DC; 2010.
78. Günnemann S, Färber I, Müller E, Seidl T. ASCLU: alternative subspace clustering. In: MultiClust: First International Workshop on Discovering, Summarizing and Using Multiple Clusterings Held in Conjunction with KDD 2010, Washington, DC; 2010.
79. Müller E, Assent I, Günnemann S, Krieger R, Seidl T. Relevant subspace clustering: mining the most interesting non-redundant concepts in high dimensional data. In: Proceedings of the 9th IEEE International Conference on Data Mining (ICDM), Miami, FL; 2009.
80. Bickel S, Scheffer T. Multi-view clustering. In: Proceedings of the 4th IEEE International Conference on Data Mining (ICDM), Brighton, UK; 2004.
81. Cui Y, Fern XZ, Dy JG. Non-redundant multi-view clustering via orthogonalization. In: Proceedings of the 7th IEEE International Conference on Data Mining (ICDM), Omaha, NE; 2007.
82. Jain P, Meka R, Dhillon IS. Simultaneous unsupervised learning of disparate clusterings. Stat Anal Data Min 2008, 1:195-210.
83. Gondek D, Hofmann T. Non-redundant data clustering. In: Proceedings of the 4th IEEE International Conference on Data Mining (ICDM), Brighton, UK; 2004.
84. Gondek D, Hofmann T. Non-redundant clustering with conditional ensembles. In: Proceedings of the 11th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Chicago, IL; 2005.
85. Bae E, Bailey J. COALA: a novel approach for the extraction of an alternate clustering of high quality and high dissimilarity. In: Proceedings of the 6th IEEE International Conference on Data Mining (ICDM), Hong Kong, China; 2006.
86. Davidson I, Qi Z. Finding alternative clusterings using constraints. In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM), Pisa, Italy; 2008.
87. Qi ZJ, Davidson I. A principled and flexible framework for finding alternative clusterings. In: Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Paris, France; 2009.
88. Davidson I, Ravi SS, Shamis L. A SAT-based framework for efficient constrained clustering. In: Proceedings of the 10th SIAM International Conference on Data Mining (SDM), Columbus, OH; 2010.
89. Dang XH, Bailey J. Generation of alternative clusterings using the CAMI approach. In: Proceedings of the 10th SIAM International Conference on Data Mining (SDM), Columbus, OH; 2010.
90. Phillips JM, Raman P, Venkatasubramanian S. Generating a diverse set of high-quality clusterings. In: Second MultiClust Workshop: Discovering, Summarizing and Using Multiple Clusterings Held in Conjunction with ECML PKDD 2011, Athens, Greece; 2011.
91. Kriegel H-P, Kröger P, Sander J, Zimek A. Densitybased clustering. WIREs Data Min Knowl Discov 2011, 1:231-240.
92. Müller E, Assent I, Krieger R, Günnemann S, Seidl T. DensEst: density estimation for data mining in high dimensional spaces. In: Proceedings of the 9th SIAM International Conference on Data Mining (SDM), Sparks, NV; 2009.
93. Färber I, Günnemann S, Kriegel H-P, Kröger P, Müller E, Schubert E, Seidl T, Zimek A. On using class-labels in evaluation of clusterings. In: Multi-Clust: First International Workshop on Discovering, Summarizing and Using Multiple Clusterings Held in Conjunction with KDD 2010, Washington, DC; 2010.
94. Patrikainen A, Meila M. Comparing subspace clusterings. IEEE Trans Knowl Data Eng 2006, 18:902-916.
95. Kriegel H-P, Schubert E, Zimek A. Evaluation of multiple clustering solutions. In: Second Multi-Clust Workshop: Discovering, Summarizing and Using Multiple Clusterings Held in Conjunction with ECML PKDD 2011, Athens, Greece; 2011.
96. Günnemann S, Färber I, Müller E, Assent I, Seidl T. External evaluation measures for subspace clustering. In: Proceedings of the 20th ACM Conference on Information and Knowledge Management (CIKM), Glasgow, UK; 2011.
97. Zhao L, Zaki MJ. TRICLUSTER: an effective algorithm for mining coherent clusters in 3D microarray data. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), Baltimore, ML; 2005.
98. Sim K, Li J, Gopalkrishnan V, Liu G. Mining maximal quasi-bicliques to co-cluster stocks and financial ratios for value investment. In: Proceedings of the 6th IEEE International Conference on Data Mining (ICDM), Hong Kong, China; 2006.
99. Ji L, Tan K-L, Tung AKH. Mining frequent closed cubes in 3D datasets. In: Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB), Seoul, Korea; 2006.
100. Sim K, Poernomo AK, Gopalkrishnan V. Mining actionable subspace clusters in sequential data. In: Proceedings of the 10th SIAM International Conference on Data Mining (SDM), Columbus, OH; 2010.
101. Aggarwal CC, Han J, Wang J, Yu PS. A framework for projected clustering of high dimensional data streams. In: Proceedings of the 30th International Conference on Very Large Data Bases (VLDB), Toronto, Canada; 2004.
102. Zhang Q, Liu J, Wang W. Incremental subspace clustering over multiple data streams. In: Proceedings of the 7th IEEE International Conference on Data Mining (ICDM), Omaha, NE; 2007.
103. Kriegel H-P, Kröger P, Ntoutsi I, Zimek A. Density based subspace clustering over dynamic data. In: Proceedings of the 23rd International Conference on Scientific and Statistical Database Management (SSDBM), Portland, OR; 2011.
104. Zaki MJ, Peters M, Assent I, Seidl T. CLICKS: an effective algorithm for mining subspace clusters in categorical datasets. Data Knowl Eng 2007, 60:51-70.
105. Müller E, Assent I, Seidl T. HSM: heterogeneous subspace mining in high dimensional data. In: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (SSDBM), New Orleans, LA; 2009.
106. Günnemann S, Kremer H, Seidl T. Subspace clustering for uncertain data. In: Proceedings of the 10th SIAM International Conference on Data Mining (SDM), Columbus, OH; 2010.
107. Sim K, Gopalkrishnan V, Zimek A, Cong G. A survey on enhanced subspace clustering. Data Min Knowl Discov 2012. doi: 10.1007/s10618-012-0258-x.