The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Automatic Subspace Clustering of High Dimensional 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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
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
Introduction to statistical pattern recognition (2nd ed.)
Fukunaga, K. (1990) · Academic Press Professional, Inc. eBooks · Cited by 3,797
A threshold of ln n for approximating set cover
Feige, U. (1998) · Journal of the ACM · doi:10.1145/285055.285059 · Cited by 3,086
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
Self-citationFast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
Self-citationDynamic itemset counting and implication rules for market basket data
Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253325 · Cited by 1,951
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
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
Stochastic Complexity in Statistical Inquiry
Rissanen, J. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/0822 · Cited by 1,539
Mining quantitative association rules in large relational tables
Srikant, R., & Agrawal, R. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233311 · Cited by 1,480
Self-citationEfficiently mining long patterns from databases
Bayardo, R. J. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276313 · Cited by 1,302
On the ratio of optimal integral and fractional covers
Lovász, L. (1975) · Discrete Mathematics · doi:10.1016/0012-365x(75)90058-8 · Cited by 1,114
Sampling Large Databases for Association Rules
Toivonen, H. T. T. (1996) · Cited by 1,089
Bayesian classification (AutoClass): theory and results
Cheeseman, P. C., & Stutz, J. (1996) · Cited by 975
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
Fukunaga, K. (1990) · Introduction to Statistical Pattern Recognition · doi:10.1016/b978-0-08-047865-4.50007-7 · Cited by 801
SPRINT: A Scalable Parallel Classifier for Data Mining
Shafer, J. C., Agrawal, R., & Mehta, M. (1996) · Cited by 787
Self-citationSLIQ: A fast scalable classifier for data mining
Mehta, M., Agrawal, R., & Rissanen, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014141 · Cited by 749
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
Learning from Observation: Conceptual Clustering
Michalski, R. S., & Stepp, R. E. (1983) · Machine Learning · doi:10.1007/978-3-662-12405-5_11 · Cited by 529
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
Almost optimal set covers in finite VC-dimension
Brönnimann, H., & Goodrich, M. T. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02570718 · Cited by 441
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
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
An algorithm for point clustering and grid generation
Berger, M., & Rigoutsos, I. (1991) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.120081 · Cited by 323
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
Range queries in OLAP data cubes
Ho, C.-T., Agrawal, R., Megiddo, N., & Srikant, R. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253274 · Cited by 281
Self-citationPincer-search: A new algorithm for discovering the maximum frequent set
Lin, D.-I., & Kedem, Z. M. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0100980 · Cited by 277
Association rules over interval data
Miller, R. J., & Yang, Y. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253361 · Cited by 266
On the hardness of approximating minimization problems
Lund, C., & Yannakakis, M. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167172 · Cited by 216
A threshold of ln n for approximating set cover (preliminary version)
Feige, U. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237977 · Cited by 214
Subspace Clustering of High Dimensional Data
Domeniconi, C., Papadopoulos, D., Gunopulos, D., & Ma, S. (2004) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.58 · Cited by 166
Self-citationData mining, hypergraph transversals, and machine learning (extended abstract)
Gunopulos, D., Mannila, H., Khardon, R., & Toivonen, H. (1997) · Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/263661.263684 · Cited by 160
Self-citationData mining, hypergraph transversals, and machine learning
Gunopulos, D., Khardon, R., Mannila, H., & Toivonen, H. T. T. (1997) · Cited by 159
Self-citationA database interface for clustering in large spatial databases
Ester, M., Kriegel, H., & Xu, X. (1995) · Cited by 127
AN OVERVIEW OF COMBINATORIAL DATA ANALYSIS
Arabie, P., & Hubert, L. J. (1996) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812832153_0002 · Cited by 122
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
Schroeter, P., & Bigün, J. (1995) · Pattern Recognition · doi:10.1016/0031-3203(94)00133-7 · Cited by 66
A generalized histogram clustering scheme for multidimensional image data
Wharton, S. W. (1983) · Pattern Recognition · doi:10.1016/0031-3203(83)90022-5 · Cited by 37
Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
Franzblau, D. S. (1989) · SIAM Journal on Discrete Mathematics · doi:10.1137/0402027 · Cited by 34
CSG set-theoretic solid modelling and NC machining of blend surfaces
Zhang, D., & Bowyer, A. (1986) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/10515.10541 · Cited by 32
Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons
Reckhow, R. A., & Culberson, J. C. (1987) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/41958.41987 · Cited by 26
A Numerical Classification Method for Partitioning of a Large Multidimensional Mixed Data Set
Chhikara, R. S., & Register, D. T. (1979) · Technometrics · doi:10.1080/00401706.1979.10489824 · Cited by 6
Cited by
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
Private memoirs of a smart meter
Molina-Markham, A., Shenoy, P., Fu, K., Cecchet, E., & Irwin, D. (2010) · Proceedings of the 2nd ACM Workshop on Embedded Sensing Systems for Energy-Efficiency in Building · doi:10.1145/1878431.1878446 · Cited by 511
The 2017 IEEE International Conference on Fuzzy Systems
(2016) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2016.2545826 · Cited by 308
Metadata
- Authors
- Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2005-07
- Volume
- 11
- Issue
- 1
- Pages
- 5-33
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2047866469
- Cited by
- 335
- References
- 50
- FWCI
- 9.62
- 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.