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
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-citationOnline learning: A comprehensive survey
Hoi, S. C. H., Sahoo, D., Lu, J., & Zhao, P. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.04.112 · Cited by 746
Aggarwal, C. C. (2015) · Data Mining · doi:10.1007/978-3-319-14142-8_13 · Cited by 606
Density-based clustering for real-time stream data
Chen, Y., & Tu, L. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281210 · Cited by 572
A Framework for Projected Clustering of High Dimensional Data Streams
Aggarwal, C. C., Han, J., Wang, J., & Yu, P. S. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50075-9 · Cited by 519
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
Fuzzy c-Means Algorithms for Very Large Data
Havens, T. C., Bezdek, J. C., Leckie, C., Hall, L. O., & Palaniswami, M. (2012) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2012.2201485 · Cited by 470
Closed-Loop and Activity-Guided Optogenetic Control
Grosenick, L., Marshel, J. H., & Deisseroth, K. (2015) · Neuron · doi:10.1016/j.neuron.2015.03.034 · Cited by 380
Esmin, A. A. A., Coelho, R. A., & Matwin, S. (2015) · Artificial Intelligence Review · doi:10.1007/s10462-013-9400-4 · Cited by 340
A survey on data stream clustering and classification
Nguyen, H.-L., Woon, Y.-K., & Ng, W.-K. (2015) · Knowledge and Information Systems · doi:10.1007/s10115-014-0808-1 · Cited by 321
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
Hierarchical Clustering of Time-Series Data Streams
Rodrigues, P. P., Gama, J., & Pedroso, J. P. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190727 · Cited by 260
Big data stream analysis: a systematic literature review
Kolajo, T., Daramola, O., & Adebiyi, A. (2019) · Journal of Big Data · doi:10.1186/s40537-019-0210-7 · Cited by 259
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.