The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Fast algorithms for projected clustering
Open accessAbstract
The clustering problem is well known in the database literature for its numerous applications in problems such as customer segmentation, classification and trend analysis. Unfortunately, all known algorithms tend to break down in high dimensional spaces because of the inherent sparsity of the points. In such high dimensional spaces not all dimensions may be relevant to a given cluster. One way of handling this is to pick the closely correlated dimensions and find clusters in the corresponding subspace. Traditional feature selection algorithms attempt to achieve this. The weakness of this approach is that in typical high dimensional data mining applications different sets of points may cluster better for different subsets of dimensions. The number of dimensions in each such cluster-specific subspace may also vary. Hence, it may be impossible to find a single small subset of dimensions for all the clusters. We therefore discuss a generalization of the clustering problem, referred to as the projected clustering problem, in which the subsets of dimensions selected are specific to the clusters themselves. We develop an algorithmic framework for solving the projected clustering problem, and test its performance on synthetic data.
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
Finding Groups in Data: An Introduction to Cluster Analysis
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344
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
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
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
Knowledge acquisition via incremental conceptual clustering
Fisher, D. H. (1987) · Machine Learning · doi:10.1007/bf00114265 · Cited by 1,991
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
Clustering to minimize the maximum intercluster distance
Gonzalez, T. F. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90224-5 · Cited by 1,717
AutoClass: A Bayesian Classification System
CHEESEMAN, P., KELLY, J., SELF, M., STUTZ, J., TAYLOR, W., & FREEMAN, D. (1988) · Machine Learning Proceedings 1988 · doi:10.1016/b978-0-934613-64-4.50011-6 · Cited by 498
A cost model for nearest neighbor search in high-dimensional data space
Berchtold, S., Böhm, C., Keim, D. A., & Kriegel, H.-P. (1997) · Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/263661.263671 · Cited by 373
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-citationAn 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
iDistance: An adaptive B + -tree based indexing method for nearest neighbor search
Jagadish, H. V., Ooi, B. C., Tan, K.-L., Yu, C., & Zhang, R. (2005) · ACM Transactions on Database Systems · doi:10.1145/1071610.1071612 · Cited by 595
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-citationFinding 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
Self-citationThe Challenges of Clustering High Dimensional Data
Steinbach, M., Ertöz, L., & Kumar, V. (2004) · New Directions in Statistical Physics · doi:10.1007/978-3-662-08968-2_16 · Cited by 508
Clustering 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-citationA data clustering algorithm for mining patterns from event logs
Vaarandi, R. (2004) · Proceedings of the 3rd IEEE Workshop on IP Operations & Management (IPOM 2003) (IEEE Cat. No.03EX764) · doi:10.1109/ipom.2003.1251233 · Cited by 453
Outlier detection for high dimensional data
Aggarwal, C. C., & Yu, P. S. (2001) · ACM SIGMOD Record · doi:10.1145/376284.375668 · Cited by 442
Self-citationHorting hatches an egg: a new graph-theoretic approach to collaborative filtering
Aggarwal, C. C., Wolf, J. L., Wu, K.-L., & Yu, P. S. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312230 · Cited by 392
Self-citationFeature 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
Clustering Algorithms in Biomedical Research: A Review
Xu, R., & Wunsch, D. C. (2010) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2010.2083647 · Cited by 349
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
Self-citationAutomatic 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
The Relationships Among Various Nonnegative Matrix Factorization Methods for Clustering
Li, T., & Ding, C. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.160 · Cited by 315
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
Self-citationHybrid 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
Self-citation
Metadata
- Authors
- Aggarwal, C. C., Wolf, J. L., Yu, P. S., Procopiuc, C., & Park, J. S.
- Venue
- Proceedings of the 1999 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 1999-06
- Pages
- 61-72
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W4254311734
- Cited by
- 484
- References
- 14
- FWCI
- 7.64
- 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.