The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Streaming-data algorithms for high-quality clustering
Abstract
Streaming data analysis has recently attracted attention in numerous applications including telephone records, Web documents and click streams. For such analysis, single-pass algorithms that consume a small amount of memory are critical. We describe such a streaming algorithm that effectively clusters large data streams. We also provide empirical evidence of the algorithm's performance on synthetic and real data streams.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
(1996) · Cited by 20,179
(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
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
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
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
Finding Groups in Data: An Introduction to Cluster Analysis.
Sarle, W. S., Kaufman, L., & Rousseeuw, P. J. (1991) · Journal of the American Statistical Association · doi:10.2307/2290430 · Cited by 3,539
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
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · ACM SIGMOD Record · doi:10.1145/235968.233324 · Cited by 2,097
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
Random sampling with a reservoir
Vitter, J. S. (1985) · ACM Transactions on Mathematical Software · doi:10.1145/3147.3165 · Cited by 1,758
OPTICS: ordering points to identify the clustering structure
Ankerst, M., Breunig, M. M., Kriegel, H.-P., & Sander, J. (1999) · Proceedings of the 1999 ACM SIGMOD international conference on Management of data · doi:10.1145/304182.304187 · Cited by 1,335
K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
Selim, S. Z., & Ismail, M. A. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767478 · Cited by 1,212
An efficient approach to clustering in large multimedia databases with noise
Hinneburg, A., & Keim, D. A. (1998) · KOPS (University of Konstanz) · Cited by 1,181
Refining Initial Points for K-Means Clustering
Bradley, P. S., & Fayyad, U. M. (1998) · Cited by 1,031
WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases
Sheikholeslami, G., Chatterjee, S., & Zhang, A. (1998) · Cited by 756
Scaling clustering algorithms to large databases
Bradley, P., Fayyad, U. M., & Reina, C. (1998) · Cited by 716
Guha, S., Mishra, N., Motwani, R., & O'Callaghan, L. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892124 · Cited by 623
Self-citationAn Efficient Data Clustering Method for Very Large Databases
Zhang, T. (1996) · Medical Entomology and Zoology · Cited by 494
Henzinger, M., Raghavan, P., & Rajagopalan, S. (1999) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/050/05 · Cited by 418
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Hinneburg, A., & Keim, D. A. (1999) · KOPS (University of Konstanz) · Cited by 339
Meyerson, A. (2001) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959917 · Cited by 262
Self-citationApproximate medians and other quantiles in one pass and with limited memory
Manku, G. S., Rajagopalan, S., & Lindsay, B. G. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276342 · Cited by 261
Hancock: a language for extracting signatures from data streams
Cortes, C., Fisher, K., Pregibon, D., & Rogers, A. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347094 · Cited by 179
An Approximate L p-Difference Algorithm for Massive Data Streams: Extended Abstract
Fong, J. H., & Strauss, M. J. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46541-3_16 · Cited by 163
A Statistical Method for Profiling Network Traffic
Marchette, D. J. (1999) · Cited by 89
Criteria for Polynomial-Time (Conceptual) Clustering
Pitt, L., & Reinke, R. E. (1988) · Machine Learning · doi:10.1007/bf00116830 · Cited by 28
(1997)
Cited by
The PARSEC benchmark suite: characterization and architectural implications
Bienia, C., Kumar, S., Singh, J. P., & Li, K. (2008) · Proceedings of the 17th international conference on Parallel architectures and compilation techniques · doi:10.1145/1454115.1454128 · Cited by 3,444
A Comprehensive Survey of Clustering Algorithms
Xu, D., & Tian, Y. (2015) · Annals of Data Science · doi:10.1007/s40745-015-0040-1 · Cited by 1,939
A Framework for Clustering Evolving Data Streams
Aggarwal, C. C., Yu, P. S., Han, J., & Wang, J. (2003) · Proceedings 2003 VLDB Conference · doi:10.1016/b978-012722442-8/50016-1 · Cited by 1,808
Gaber, M. M., Zaslavsky, A., & Krishnaswamy, S. (2005) · ACM SIGMOD Record · doi:10.1145/1083784.1083789 · Cited by 886
Clustering data streams: theory and practice
Guha, S., Meyerson, A., Mishra, N., Motwani, R., & O'Callaghan, L. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1198387 · Cited by 882
Self-citation
Metadata
- Authors
- O'Callaghan, L., Mishra, N., Meyerson, A., Guha, S., & Motwani, R.
- Venue
- Proceedings 18th International Conference on Data Engineering
- Publisher
- IEEE Comput. Soc
- Published
- 2003-06-25
- Pages
- 685-694
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W1949687736
- Cited by
- 577
- References
- 31
- FWCI
- 19.15
- Type
- conference paper
- 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.