Finding generalized projected clusters in high dimensional spaces
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimensional data, even the concept of proximity or clustering may not be meaningful. We discuss very general techniques for projected clustering which are able to construct clusters in arbitrarily aligned subspaces of lower dimensionality. The subspaces are specific to the clusters themselves. This definition is substantially more general and realistic than currently available techniques which limit the method to only projections from the original set of attributes. The generalized projected clustering technique may also be viewed as a way of trying to redefine clustering for high dimensional applications by searching for hidden subspaces with clusters which are created by inter-attribute correlations. We provide a new concept of using extended cluster feature vectors in order to make the algorithm scalable for very large databases. The running time and space requirements of the algorithm are adjustable, and are likely ta tradeoff with better accuracy.
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
(1996) · Cited by 20,179
Jolliffe, I. T. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4757-1904-8 · Cited by 8,273
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
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
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
Faloutsos, C., & Lin, K.-I. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223812 · Cited by 897
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
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
Self-citation
Cited by
Subspace clustering for high dimensional data: a review
Parsons, L., Haque, E., & Liu, H. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007731 · Cited by 1,346
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
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
Self-citationFeature bagging for outlier detection
Lazarevic, A., & Kumar, V. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081891 · Cited by 656
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
A Survey of Text Clustering Algorithms
Aggarwal, C. C., & Zhai, C. (2012) · Mining Text Data · doi:10.1007/978-1-4614-3223-4_4 · Cited by 581
Self-citationClustering by pattern similarity in large data sets
Wang, H., Wang, W., Yang, J., & Yu, P. S. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564737 · Cited by 484
Self-citationOutlier detection for high dimensional data
Aggarwal, C. C., & Yu, P. S. (2001) · ACM SIGMOD Record · doi:10.1145/376284.375668 · Cited by 442
Self-citationA 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
Automatic Subspace Clustering of High Dimensional Data
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (2005) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-1396-1 · Cited by 335
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
Evaluating clustering in subspace projections of high dimensional data
Müller, E., Günnemann, S., Assent, I., & Seidl, T. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687770 · Cited by 247
“Also, it is beyond the scope to this work to include more specialized algorithms like correlation clustering [2] which transform the data space based on detected cor-”
MethodAn effective and efficient algorithm for high-dimensional outlier detection
Aggarwal, C. C., & Yu, P. S. (2005) · The VLDB Journal · doi:10.1007/s00778-004-0125-5 · Cited by 212
“This is because if all pairs of points are almost equidistant [9], then meaningful clusters cannot be found in the data [2,3,6,11]; similarly, it is difficult to detect abnormal deviations.”
BackgroundMethodInfluentialSelf-citationTRICLUSTER: an effective algorithm for mining coherent clusters in 3D microarray data
Zhao, L., & Zaki, M. J. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066236 · Cited by 209
“3.2 Feature-and Graph-based Clustering PROCLUS[1] and ORCLUS [2] use projective clustering to partition the dataset into clusters occurring in possibly di.erent subsets of dimensions in a high dimensional dataset.”
BackgroundMethodInfluentialOP-cluster: clustering by tendency in high dimensional space
Liu, J., & Wang, W. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250919 · Cited by 199
“Recent research work [18, 19, 3, 4, 6, 9, 12] has focused on discovering clusters embedded in the subspaces of a high dimensional data set.”
BackgroundMethodText Clustering with Feature Selection by Using Statistical Data
Li, Y., Luo, C., & Chung, S. M. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190740 · Cited by 183
“feature spaces due to the inherent sparseness of the data [1].”
BackgroundThe Role of Hubness in Clustering High-Dimensional Data
Tomasev, N., Radovanovic, M., Mladenic, D., & Ivanovic, M. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.25 · Cited by 142
“Instead of attempting to avoid the curse of dimensionality by observing a lower dimensional feature subspace, we embrace dimensionality by taking advantage of inherently high-dimensional phenomena.”
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
“ORCLUS [3] subsequently extended PROCLUS to consider non-axis subspaces.”
Background
Metadata
- Authors
- Aggarwal, C. C., & Yu, P. S.
- Venue
- Proceedings of the 2000 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2000-05-16
- Pages
- 70-81
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W4244268470
- Cited by
- 295
- References
- 14
- FWCI
- 9.58
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.