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
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
Ezugwu, A. E., Ikotun, A. M., Oyelade, O. O., Abualigah, L., Agushaka, J. O., Eke, C. I., & Akinyelu, A. A. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.104743 · Cited by 924
A survey on unsupervised outlier detection in high‐dimensional numerical data
Zimek, A., Schubert, E., & Kriegel, H. (2012) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11161 · Cited by 864
Data Clustering: Algorithms and Applications
(2018) · Chapman & Hall/CRC eBooks · doi:10.1201/9781315373515 · Cited by 756
Generalized Latent Multi-View Subspace Clustering
Zhang, C., Fu, H., Hu, Q., Cao, X., Xie, Y., Tao, D., & Xu, D. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2877660 · Cited by 739
Feature Selection: A literature Review
Kumar, V. (2014) · The Smart Computing Review · doi:10.6029/smartcr.2014.03.007 · Cited by 659
An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data
Jing, L., Ng, M. K., & Huang, J. Z. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1048 · Cited by 625
Study on density peaks clustering based on k-nearest neighbors and principal component analysis
Du, M., Ding, S., & Jia, H. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.02.001 · Cited by 520
Model-based clustering of high-dimensional data: A review
Bouveyron, C., & Brunet-Saumard, C. (2014) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2012.12.008 · Cited by 467
Efficient agglomerative hierarchical clustering
Bouguettaya, A., Yu, Q., Liu, X., Zhou, X., & Song, A. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.09.054 · Cited by 442
A comprehensive survey of anomaly detection techniques for high dimensional big data
Thudumu, S., Branch, P., Jin, J., & Singh, J. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00320-x · Cited by 425
High-dimensional data clustering
Bouveyron, C., Girard, S., & Schmid, C. (2007) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2007.02.009 · Cited by 382
“They are usually based on grid search methods and find dense clusterab le subspaces [8].”
BackgroundAnomaly detection in dynamic networks: a survey
Ranshous, S., Shen, S., Koutra, D., Harenberg, S., Faloutsos, C., & Samatova, N. F. (2015) · WIREs Computational Statistics · doi:10.1002/wics.1347 · Cited by 379
Accelerating Large-Scale Multiobjective Optimization via Problem Reformulation
He, C., Li, L., Tian, Y., Zhang, X., Cheng, R., Jin, Y., & Yao, X. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2896002 · Cited by 357
Esmin, A. A. A., Coelho, R. A., & Matwin, S. (2015) · Artificial Intelligence Review · doi:10.1007/s10462-013-9400-4 · Cited by 340
Multi-omics integration in biomedical research – A metabolomics-centric review
Wörheide, M. A., Krumsiek, J., Kastenmüller, G., & Arnold, M. (2021) · Analytica Chimica Acta · doi:10.1016/j.aca.2020.10.038 · Cited by 334
The 2017 IEEE International Conference on Fuzzy Systems
(2016) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2016.2545826 · Cited by 308
Milk and Dairy Products and Their Nutritional Contribution to the Average Polish Diet
Górska-Warsewicz, H., Rejman, K., Laskowski, W., & Czeczotko, M. (2019) · Nutrients · doi:10.3390/nu11081771 · Cited by 297
Adaptive Offspring Generation for Evolutionary Large-Scale Multiobjective Optimization
He, C., Cheng, R., & Yazdani, D. (2022) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2020.3003926 · Cited by 287
Diversity Assessment in Many-Objective Optimization
Wang, H., Jin, Y., & Yao, X. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2550502 · Cited by 274
Can Shared-Neighbor Distances Defeat the Curse of Dimensionality?
Houle, M. E., Kriegel, H.-P., Kröger, P., Schubert, E., & Zimek, A. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13818-8_34 · Cited by 268
Survey of State-of-the-Art Mixed Data Clustering Algorithms
Ahmad, A., & Khan, S. S. (2019) · IEEE Access · doi:10.1109/access.2019.2903568 · Cited by 253
Statistical selection of relevant subspace projections for outlier ranking
Muller, E., Schiffer, M., & Seidl, T. (2011) · 2011 IEEE 27th International Conference on Data Engineering · doi:10.1109/icde.2011.5767916 · Cited by 126
Screening nonrandomized studies for medical systematic reviews: a comparative study of classifiers
Bekhuis, T., & Demner-Fushman, D. (2012) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2012.05.002 · Cited by 70
“While using a wrapper strategy is a well-known approach [49], a better one could involve selecting features within the positive (include) and negative (exclude) classes before grid optimization (e.g., see [49, 50]).”
MethodLocal Outlier Detection with Interpretation
Dang, X. H., Micenková, B., Assent, I., & Ng, R. T. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40994-3_20 · Cited by 56
A Framework for Outlier Description Using Constraint Programming
Kuo, C.-T., & Davidson, I. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10174 · Cited by 18
“Not only is a lower dimensional subspace easier to understand by humans, but the curse of dimensionality renders any distance measures meaningless in very high dimensions (Parsons, Haque, and Liu 2004).”
BackgroundHybrid entity clustering using crowds and data
Lee, J., Cho, H., Park, J.-W., Cha, Y.-R., Hwang, S.-W., Nie, Z., & Wen, J.-R. (2013) · The VLDB Journal · doi:10.1007/s00778-013-0328-8 · Cited by 15
FAIRVIS: Visual Analytics for Discovering Intersectional Bias in Machine Learning
Cabrera, Á. A., Epperson, W., Hohman, F., Kahng, M., Morgenstern, J., & Chau, D. H. (2019) · 2019 IEEE Conference on Visual Analytics Science and Technology (VAST) · doi:10.1109/vast47406.2019.8986948 · Cited by 14
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.