The DOI matches its Crossref record; 68 of the 68 references it cites were found in a registry or an index.
Subspace clustering for high dimensional data: a review
Abstract
Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. Often in high dimensional data, many dimensions are irrelevant and can mask existing clusters in noisy data. Feature selection removes irrelevant and redundant dimensions by analyzing the entire dataset. Subspace clustering algorithms localize the search for relevant dimensions allowing them to find clusters that exist in multiple, possibly overlapping subspaces. There are two major branches of subspace clustering based on their search strategy. Top-down algorithms find an initial clustering in the full set of dimensions and evaluate the subspaces of each cluster, iteratively improving the results. Bottom-up approaches find dense regions in low dimensional spaces and combine them to form clusters. This paper presents a survey of the various subspace clustering algorithms along with a hierarchy organizing the algorithms by their defining characteristics. We then compare the two main approaches to subspace clustering using empirical scalability and accuracy tests and discuss some potential applications where subspace clustering could be particularly useful.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Data mining: practical machine learning tools and techniques with Java implementations
Witten, I. H., & Frank, E. (2002) · ACM SIGMOD Record · doi:10.1145/507338.507355 · Cited by 5,137
Data Mining - Concepts and Techniques.
Perner, P. (2002) · Künstliche Intell. · Cited by 4,886
Selection of relevant features and examples in machine learning
Blum, A. L., & Langley, P. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00063-5 · Cited by 3,298
Social information filtering: algorithms for automating “word of mouth”
Shardanand, U., & Maes, P. (1995) · Proceedings of the SIGCHI conference on Human factors in computing systems - CHI '95 · doi:10.1145/223904.223931 · Cited by 2,823
A Survey of Clustering Data Mining Techniques
Berkhin, P. (2006) · Grouping Multidimensional Data · doi:10.1007/3-540-28349-8_2 · Cited by 2,804
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
Feature selection for high-dimensional data: a fast correlation-based filter solution
Yu, L., & Liu, H. (2003) · Cited by 2,305
Self-citationX-means: Extending K-means with Efficient Estimation of the Number of Clusters
Pelleg, D., & Moore, A. (2000) · Cited by 2,245
Feature Selection for Knowledge Discovery and Data Mining
Liu, H., & Motoda, H. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5689-3 · Cited by 2,198
Self-citationOn the Surprising Behavior of Distance Metrics in High Dimensional Space
Aggarwal, C. C., Hinneburg, A., & Keim, D. A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44503-x_27 · Cited by 2,083
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
Unsupervised feature selection using feature similarity
Mitra, P., Murthy, C. A., & Pal, S. K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990133 · Cited by 1,460
Girardot, J.-J. (2013) · HAL · Cited by 1,404
Random projection in dimensionality reduction: applications to image and text data
Bingham, E., & Mannila, H. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502546 · Cited by 1,274
Ontology-Based Integration of Information — A Survey of Existing Approaches
Wache, H., Vögele, T., Visser, U., Stuckenschmidt, H., Schuster, G., Neumann, H., & Hübner, S. (2001) · Cited by 1,188
Efficient clustering of high-dimensional data sets with application to reference matching
McCallum, A., Nigam, K., & Ungar, L. H. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347123 · Cited by 1,096
Outlier detection for high dimensional data
Aggarwal, C. C., & Yu, P. S. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375668 · Cited by 1,029
Fast algorithms for projected clustering
Aggarwal, C. C., Wolf, J. L., Yu, P. S., Procopiuc, C., & Park, J. S. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304188 · Cited by 900
Hamerly, G., & Elkan, C. (2003) · Cited by 841
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
Ertöz, L., Steinbach, M., & Kumar, V. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.5 · Cited by 703
Database-friendly random projections
Achlioptas, D. (2001) · Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/375551.375608 · Cited by 699
Random projection for high dimensional data clustering: a cluster ensemble approach
Fern, X. Z., & Brodley, C. E. (2003) · Cited by 595
Database techniques for the World-Wide Web: a survey
Florescu, D., Levy, A., & Mendelzon, A. (1998) · ACM SIGMOD Record · doi:10.1145/290593.290605 · Cited by 561
Proceedings of the Seventeenth International Conference on Machine Learning
Langley, P. (2000) · International Conference on Machine Learning · Cited by 550
Training a 3-node neural network is NP-complete
Blum, A. L., & Rivest, R. L. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80010-3 · Cited by 543
Entropy-based subspace clustering for mining numerical data
Cheng, C.-H., Fu, A. W., & Zhang, Y. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312199 · Cited by 543
Cluster validity methods: part I
Halkidi, M., Batistakis, Y., & Vazirgiannis, M. (2002) · ACM SIGMOD Record · doi:10.1145/565117.565124 · Cited by 534
Finding generalized projected clusters in high dimensional spaces
Aggarwal, C. C., & Yu, P. S. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335383 · Cited by 530
Fast algorithms for projected clustering
Aggarwal, C. C., Wolf, J. L., Yu, P. S., Procopiuc, C., & Park, J. S. (1999) · Proceedings of the 1999 ACM SIGMOD international conference on Management of data · doi:10.1145/304182.304188 · Cited by 484
Clustering validity checking methods: part II
Halkidi, M., Batistakis, Y., & Vazirgiannis, M. (2002) · ACM SIGMOD Record · doi:10.1145/601858.601862 · Cited by 466
Clustering Objects on Subsets of Attributes (with Discussion)
Friedman, J. H., & Meulman, J. J. (2004) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2004.02059.x · Cited by 418
Spatial clustering methods in data mining : A survey
Han, J. (2001) · Cited by 385
Feature selection for clustering - a filter solution
Dash, M., Choi, K., Scheuermann, P., & Liu, H. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1183893 · Cited by 383
Self-citationProceedings, Twentieth International Conference on Machine Learning
Fawcett, T. E., & Mishra, N. (2003) · AAAI Press eBooks · Cited by 374
COOLCAT: an entropy-based algorithm for categorical clustering
Barbará, D., Li, Y., & Couto, J. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584888 · Cited by 345
A Monte Carlo algorithm for fast projective clustering
Procopiuc, C. M., Jones, M., Agarwal, P. K., & Murali, T. M. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564739 · Cited by 340
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Hinneburg, A., & Keim, D. A. (1999) · KOPS (University of Konstanz) · Cited by 339
δ-clusters: capturing subspace correlation in a large data set
Yang, J., Wang, W., Wang, H., & Yu, P. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994771 · Cited by 300
Finding generalized projected clusters in high dimensional spaces
Aggarwal, C. C., & Yu, P. S. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335383 · Cited by 295
Feature selection in unsupervised learning via evolutionary search
Kim, Y., Street, W. N., & Menczer, F. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347169 · Cited by 288
Feature Subset Selection and Order Identification for Unsupervised Learning
Dy, J., & Brodley, C. E. (2000) · Cited by 234
Clustering through decision tree construction
Liu, B., Xia, Y., & Yu, P. S. (2000) · Proceedings of the ninth international conference on Information and knowledge management · doi:10.1145/354756.354775 · Cited by 225
Experiments with random projections for machine learning
Fradkin, D., & Madigan, D. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956812 · Cited by 201
Exploratory Data Analysis by the Self-Organizing Map: Structures of Welfare and Poverty in the World
Samuel Kaski, A., & Kohonen, T. (1996) · Cited by 178
Dimensionality reduction of unsupervised data
Dash, M., Liu, H., & Yao, J. (2002) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/tai.1997.632300 · Cited by 178
Self-citationMicroarrays for an Integrative Genomics
Kohane, I. S., Kho, A., & Butte, A. J. (2002) · The MIT Press eBooks · doi:10.7551/mitpress/4594.001.0001 · Cited by 169
Adaptive dimension reduction for clustering high dimensional data
Ding, C., He, X., Hongyuan Zha, B., & Simon, H. D. (2003) · Proceedings · doi:10.1109/icdm.2002.1183897 · Cited by 164
FINDIT: a fast and intelligent subspace clustering algorithm using dimension voting
Woo, K.-G., Lee, J.-H., Kim, M., & Yoon-Joon, L. E. E. (2003) · Information and Software Technology · doi:10.1016/j.infsof.2003.07.003 · Cited by 147
Basic microarray analysis: grouping and feature reduction
Raychaudhuri, S., Sutphin, P. D., Chang, J. T., & Altman, R. B. (2001) · Trends in biotechnology · doi:10.1016/s0167-7799(01)01599-2 · Cited by 133
Proceedings of the 5th International Conference on
Focardi, E. (2002) · Nuclear Instruments and Methods in Physics Research Section A Accelerators Spectrometers Detectors and Associated Equipment · doi:10.1016/s0168-9002(02)00519-3 · Cited by 132
A comparative study of clustering methods
Zaït, M., & Messatfa, H. (1997) · Future Generation Computer Systems · doi:10.1016/s0167-739x(97)00018-6 · Cited by 121
Re-designing distance functions and distance-based applications for high dimensional data
Aggarwal, C. C. (2001) · ACM SIGMOD Record · doi:10.1145/373626.373638 · Cited by 115
Projective ART for clustering data sets in high dimensional spaces
Cao, Y., & Wu, J. (2002) · Neural Networks · doi:10.1016/s0893-6080(01)00108-3 · Cited by 82
Subspace clustering for high dimensional categorical data
Gan, G., & Wu, J. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1046456.1046468 · Cited by 74
Dimensionality reduction in unsupervised learning of conditional Gaussian networks
Peña, J. M., Lozano, J. A., Larrañaga, P., & Inza, I. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.927460 · Cited by 65
O-Cluster: scalable clustering of large high dimensional data sets
Milenova, B. L., & Campos, M. M. (2003) · Proceedings · doi:10.1109/icdm.2002.1183915 · Cited by 63
A new cell-based clustering method for large, high-dimensional data in data mining applications
Chang, J., & Jin, D.-S. (2002) · ACM Symposium on Applied Computing · doi:10.1145/508791.508886 · Cited by 62
'1+1>2': merging distance and density based clustering
Dash, M., Liu, H., & Xu, X. (2001) · Database Systems for Advanced Applications · doi:10.1109/dasfaa.2001.916361 · Cited by 59
Self-citationAlon, N., Dar, S., Parnas, M., & Ron, D. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892111 · Cited by 42
Towards meaningful high-dimensional nearest neighbor search by human-computer interaction
Aggarwal, C. C. (2003) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2002.994777 · Cited by 42
Estimating an Eigenvector by the Power Method with a Random Start
Corso, G. M. D. (1997) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895296689 · Cited by 31
Algorithms for clustering high dimensional and distributed data
Li, T., Shenghuo Zhu, B., & Ogihara, M. (2003) · Intelligent Data Analysis · doi:10.3233/ida-2003-7404 · Cited by 23
Using projections to visually cluster high-dimensional data
Hinneburg, A., Keim, D. A., & Wawryniuk, M. (2003) · Computing in Science & Engineering · doi:10.1109/mcise.2003.1182958 · Cited by 14
Cited by
Toward integrating feature selection algorithms for classification and clustering
Liu, H., & Yu, L. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.66 · Cited by 2,706
Self-citationA Comprehensive Survey of Clustering Algorithms
Xu, D., & Tian, Y. (2015) · Annals of Data Science · doi:10.1007/s40745-015-0040-1 · Cited by 1,939
“The main basic ideas of clustering for big data can be summarized in the following 4 categories: (1) sample clustering [10,18]; (2) data merged clustering [17,134]; (3) dimension-reducing clustering [135,136]; (4) parallel clustering [114,137–139]; Typical algorithms of this kind of clustering areK-means [7], BIRCH [1…”
BackgroundOptical remotely sensed time series data for land cover classification: A review
Gómez, C., White, J. C., & Wulder, M. A. (2016) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2016.03.008 · Cited by 1,217
Vidal, R. (2011) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.939739 · Cited by 1,126
Kriegel, H.-P., Kröger, P., & Zimek, A. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1497577.1497578 · Cited by 1,093
Metadata
- Authors
- Parsons, L., Haque, E., & Liu, H.
- Venue
- ACM SIGKDD Explorations Newsletter
- Published
- 2004-06
- Volume
- 6
- Issue
- 1
- Pages
- 90-105
- ISSN
- 1931-0145 (ISSN-L)
- 1931-0153
- OpenAlex
- W2006533296
- Cited by
- 1,346
- References
- 68
- FWCI
- 34.91
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.