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
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
Computing LTS Regression for Large Data Sets
ROUSSEEUW, P. J., & VAN DRIESSEN, K. (2006) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-0024-4 · Cited by 606
Data Mining for the Internet of Things: Literature Review and Challenges
Chen, F., Deng, P., Wan, J., Zhang, D., Vasilakos, A. V., & Rong, X. (2015) · International Journal of Distributed Sensor Networks · doi:10.1155/2015/431047 · Cited by 528
K-means properties on six clustering benchmark datasets
Fränti, P., & Sieranoja, S. (2018) · Applied Intelligence · doi:10.1007/s10489-018-1238-7 · Cited by 518
Data stream clustering: A survey
Silva, J. A., Faria, E. R., Barros, R. C., Hruschka, E. R., Carvalho, A. C. P. L. F. D., & Gama, J. (2013) · ACM Computing Surveys · doi:10.1145/2522968.2522981 · Cited by 508
Alternatives to the k-means algorithm that find better clusterings
Hamerly, G., & Elkan, C. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584890 · Cited by 426
A Review of Data-Driven Market Segmentation in Tourism
Dolnicar, S. (2002) · Journal of Travel & Tourism Marketing · doi:10.1300/j073v12n01_01 · Cited by 402
Outlier detection using k-nearest neighbour graph
Hautamaki, V., Karkkainen, I., & Franti, P. (2004) · Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004. · doi:10.1109/icpr.2004.1334558 · Cited by 353
Iterative shrinking method for clustering problems
Fränti, P., & Virmajoki, O. (2006) · Pattern Recognition · doi:10.1016/j.patcog.2005.09.012 · Cited by 341
QuickBundles, a Method for Tractography Simplification
Garyfallidis, E., Brett, M., Correia, M. M., Williams, G. B., & Nimmo-Smith, I. (2012) · Frontiers in Neuroscience · doi:10.3389/fnins.2012.00175 · Cited by 312
A local density-based approach for outlier detection
Tang, B., & He, H. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.02.039 · Cited by 301
StreamKM++: A clustering algorithm for data streams
Ackermann, M. R., Märtens, M., Raupach, C., Swierkot, K., Lammersen, C., & Sohler, C. (2012) · ACM Journal of Experimental Algorithmics · doi:10.1145/2133803.2184450 · Cited by 294
Agglomerative Fuzzy K-Means Clustering Algorithm with Selection of Number of Clusters
Li, M. J., Ng, M. K., Cheung, Y.-M., & Huang, J. Z. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.88 · Cited by 281
A survey of density based clustering algorithms
Bhattacharjee, P., & Mitra, P. (2021) · Frontiers of Computer Science · doi:10.1007/s11704-019-9059-3 · Cited by 271
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
Distributed Anomaly Detection in Wireless Sensor Networks
Rajasegarar, S., Leckie, C., Palaniswami, M., & Bezdek, J. (2006) · 2006 10th IEEE Singapore International Conference on Communication Systems · doi:10.1109/iccs.2006.301508 · Cited by 256
Survey of State-of-the-Art Mixed Data Clustering Algorithms
Ahmad, A., & Khan, S. S. (2019) · IEEE Access · doi:10.1109/access.2019.2903568 · Cited by 253
A survey of Clustering Algorithms
Rokach, L. (2009) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/978-0-387-09823-4_14 · Cited by 245
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.