The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
BIRCH: A New Data Clustering Algorithm and Its Applications
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
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
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
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98741 · Cited by 4,161
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
Self-citationKnowledge acquisition via incremental conceptual clustering
Fisher, D. H. (1987) · Machine Learning · doi:10.1007/bf00114265 · Cited by 1,991
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · ACM SIGMOD Record · doi:10.1145/971697.602266 · Cited by 1,612
A Survey of Recent Advances in Hierarchical Clustering Algorithms
Murtagh, F. (1983) · The Computer Journal · doi:10.1093/comjnl/26.4.354 · Cited by 1,058
Models of Incremental Concept Formation
Gennari, J. H., Langley, P., & Fisher, D. (1988) · doi:10.21236/ada191597 · Cited by 525
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
An Efficient Data Clustering Method for Very Large Databases
Zhang, T. (1996) · Medical Entomology and Zoology · Cited by 494
Self-citationModels of incremental concept formation
Gennari, J. H., Langley, P., & Fisher, D. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90046-5 · Cited by 453
Parallel algorithms for hierarchical clustering
Olson, C. F. (1995) · Parallel Computing · doi:10.1016/0167-8191(95)00017-i · Cited by 404
Experiments with incremental concept formation: UNIMEM
Lebowitz, M. (1987) · Machine Learning · doi:10.1007/bf00114264 · Cited by 303
Clustering Methodologies in Exploratory Data Analysis
Dubes, R., & Jain, A. K. (1980) · Advances in Computers · doi:10.1016/s0065-2458(08)60034-0 · Cited by 286
EPAM-like models of recognition and learning
FEIGENBAUM, E., & SIMON, H. (1984) · Cognitive Science · doi:10.1016/s0364-0213(84)80005-1 · Cited by 216
Iterative Optimization and Simplification of Hierarchical Clusterings
Fisher, D. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.276 · Cited by 195
Ester, M., Kriegel, H.-P., & Xu, X. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60159-7_5 · Cited by 160
Fast full search equivalent encoding algorithms for image compression using vector quantization
Huang, C.-C., Bi, Q., Stiles, G. S., & Harris, R. W. (1992) · IEEE Transactions on Image Processing · doi:10.1109/83.148613 · Cited by 137
A database interface for clustering in large spatial databases
Ester, M., Kriegel, H., & Xu, X. (1995) · Cited by 127
Clustering Analysis and Its Applications
Lee, R. C. T. (1981) · Springer eBooks · doi:10.1007/978-1-4613-9883-7_4 · Cited by 94
Data clustering for very large datasets plus applications
Zhang, T. Y. (1997) · Minds at UW (University of Wisconsin) · Cited by 17
Self-citation
Cited by
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
“These studies, as well as a comparison we ran against the popular clustering scheme, BIRCH 1 [50], are reported in Section4.”
MethodResultInfluentialA Survey of Clustering Data Mining Techniques
Berkhin, P. (2006) · Grouping Multidimensional Data · doi:10.1007/3-540-28349-8_2 · Cited by 2,804
Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications
Sander, J., Ester, M., Kriegel, H.-P., & Xu, X. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009745219419 · Cited by 1,495
State of the Art in Defect Detection Based on Machine Vision
Ren, Z., Fang, F., Yan, N., & Wu, Y. (2022) · International Journal of Precision Engineering and Manufacturing-Green Technology · doi:10.1007/s40684-021-00343-6 · Cited by 799
A robust and scalable clustering algorithm for mixed type attributes in large database environment
Chiu, T., Fang, D., Chen, J., Wang, Y., & Jeris, C. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502549 · Cited by 724
Metadata
- Authors
- Zhang, T., Ramakrishnan, R., & Livny, M.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 1997-06
- Volume
- 1
- Issue
- 2
- Pages
- 141-182
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2141245797
- Cited by
- 888
- References
- 29
- FWCI
- 11.41
- 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.