The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Clustering categorical data: an approach based on dynamical systems
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
(1979) · Cited by 43,841
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Self-organized formation of topologically correct feature maps
Kohonen, T. (1982) · Biological Cybernetics · doi:10.1007/bf00337288 · Cited by 9,529
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Hapeman, D. E. (1991) · Technometrics · doi:10.1080/00401706.1991.10484817 · Cited by 9,373
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Self-citationGoodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
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
Nonlinear principal component analysis using autoassociative neural networks
Kramer, M. A. (1991) · AIChE Journal · doi:10.1002/aic.690370209 · Cited by 3,037
Fast 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
An Introduction to Chaotic Dynamical Systems
Devaney, R. L., & Eckmann, J.-P. (1987) · Physics Today · doi:10.1063/1.2820117 · Cited by 2,344
Dynamic 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
Mining generalized association rules
Srikant, R., & Agrawal, R. (1997) · Future Generation Computer Systems · doi:10.1016/s0167-739x(97)00019-8 · Cited by 1,618
Query by Image and Video Content: The QBIC System
Flickner, M., Sawhney, H., Niblack, W., Ashley, J., Huang, Q., Dom, B., Gorkani, M., Hafner, J., Lee, D., Petkovic, D., et al. (2002) · Readings in Multimedia Computing and Networking · doi:10.1016/b978-155860651-7/50108-x · Cited by 1,559
Beyond market baskets: generalizing association rules to correlations
Brin, S., Motwani, R., & Silverstein, C. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253327 · Cited by 1,281
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
Sampling Large Databases for Association Rules
Toivonen, H. T. T. (1996) · Cited by 1,089
Eugene Charniak, D. (1994) · Medical Entomology and Zoology · Cited by 811
Lower Bounds for the Partitioning of Graphs
Donath, W. E., & Hoffman, A. J. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.175.0420 · Cited by 660
Discovering Frequent Episodes in Sequences.
Mannila, H., Toivonen, H. T. T., & Verkamo, A. I. (1995) · Knowledge Discovery and Data Mining · Cited by 590
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining.
Huang, J. Z. (1997) · Cited by 551
The Markov chain Monte Carlo method: an approach to approximate counting and integration
Jerrum, M., & Sinclair, A. (1996) · Cited by 489
Neural computation and self-organizing maps : an introduction
Ritter, H. J., Martinetz, T., Schulten, K. J., Barsky, D., Tesch, M., & Kates, R. E. (1992) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 440
Spectral partitioning works: planar graphs and finite element meshes
Spielman, D. A., & Teng, S.-H. (1996) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548468 · Cited by 393
Clustering Based on Association Rule Hypergraphs
Han, E.-H. S., Karypis, G., Kumar, V., & Mobasher, B. (1997) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 178
Coloring Random and Semi-Random k-Colorable Graphs
Blum, A. L., & Spencer, J. (1995) · Journal of Algorithms · doi:10.1006/jagm.1995.1034 · Cited by 152
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Self-citationAuthoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
Self-citationLearning with Hypergraphs: Clustering, Classification, and Embedding
Zhou, D., Huang, J., & Schölkopf, B. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0205 · Cited by 1,283
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
Metadata
- Authors
- Gibson, D., Kleinberg, J., & Raghavan, P.
- Venue
- The VLDB Journal The International Journal on Very Large Data Bases
- Published
- 2000-02-01
- Volume
- 8
- Issue
- 3-4
- Pages
- 222-236
- ISSN
- 0949-877X (ISSN-L)
- 1066-8888
- OpenAlex
- W2041674806
- Cited by
- 382
- References
- 34
- FWCI
- 17.49
- 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.