The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Mining high-speed data streams
Open accessAbstract
&% ' ! ( ) * $ (+ , $ -. ( * / " 10 20 3 4 5 &% 6 7 7 ( & 98 : $ # $ ( % ; % % 9 < /= $ ?> @ $ !BA 7 6 C 5 $ D= $ 9 5) 4 5 94 5 E ( * 5 9 F4 5 G 4 5 !> 5> @ 9 4 5 $ (H * 4 5 6 % $0 I= J % % $ 5 9 $ (A LK 3 M> > @ $ : $ = $ * $ 6 5 & $ 5 % 4 $ EN EO MP QK !H 7 B M $ R * 4 5 % 5 Q 5 $= $ & $ $ S4 5 != $ ( 6 $ T 5 U= / 5 ( .>@ $ & /V W > 5% A XN EO MP QK Y= U 5) = / > @ ( $ 6 98 E 4 5 ( 5 6 8 M $V Z 6> 5% $ 6> @ / 6 $= $ 9 5 [4 5 9\ @) ] 5 $) ] 5 /% 8 E 50 A _' 4 $ aF $\ @ 5 * 4 5 5 b 4 ) $ 6 ? 4 5 > 4 5 !C > = % % _ 5 % _ 5 $ = % 3 c 8 !6= / # $ % L% 5 / (A ed f a 4 5 CN FO MP LK !g !> 5 9> @ $ ) $ 5 $ 9 5 ( ?F4 % h 5 94 5 9 [ C $V $ $ F 98 /V B> @ / 6 $ E 9 " B $ = ( A Ld b e > > 5% &N EO MP QK I 5 D= $ 4 5 4 c i 8 :d b * = $= $ $ ?( 68 j k 5 a0 3 % l E 5 # $ h e 98 d U 5 5 9 " "= > 54 (A Categories and Subject Descriptors ` A m A n Fo p q r $q 5s Wq 5t vu !w Xq 5x q y u z 7u x Zr '{ '| }P , ( * ;Ẽ> 5> % = 5 # 6 5 + E$A m A 5% 5 * 4 Q > 5> > ' $% > 5% M 5 /% M> 5 54 = $ $ * $= 4 5 M0 ; c4 * % ( ¤ # 8 j4 5% % 3 5 5 ( 9 8 , ( A K 3 B4 : 5 5 /) # $% 9> 5 $ 3 98 5 % D $± 6= $ $ 6 % * /= $ / E> ' BA ² 4 5 / B % BH E 9 S $± = / / B , % 9 5 ! 5 % h * % D¦ A A H o § 9³ { hª = $ 9 5= $ $ ( 3 C ¤ , Q> @ 9 * % : , 5 3 ( * $ L } 5 5 9 }« 5 } C a / * ! 9 5% !$G 4 5 5 , $G 4 $ ' % 5 = 5 L 8 5 ? 5 ¤ ZA aŹ4 5 F $ # $ .5 $ " % 9 5 6 % * $ $ .$ $ 4 5> " C M8 $0 ® % % 9 ./V W > 5% $ (A ' & C f > > 5% = E ,% $ < c Zg ,0 Q .8 L ( 9A FO E $V Z > % H $ # $ " $ ( % = J 5 L $= $ 9 % % 9 5 Q 8 @ ( ( = $ 9 5 (H $% $= $ 9 !4 5 5 = ) != / > 5 $ != $ 9 5 5 /= $ % % 9 5 !8 3= % % (H Z% h * 5¤ > 5 9) = $ $ 6 % % 8 LQK !µ 5 C= $ $ ,= .> @ / ( (H Q 5 C> @ > ) 4 5% h Ed b * $ F% 9 e 6 % % F 8 } (A LF : 5 c $V > 5 8 } 5 ' $ $ S= $ 9 4 $ !&4 * G 4 5 4 S= $ 6> 54 5 * $= $ 9 $ ?M /) % ' BH S0 Q .=$V > @ $= / & D 4 5= ( # % 4 $ e0 3 % % * /= $ 5 4 5% ( $ a -5 $V = $ $> 5 9 A ² 4 5 / B a ( D 5 5 $ C 6 /G B4 > 5> @ $ [ C= $ > @ &0 3 < $ CA bd $ _ 5 /0 $V Z 6> 5% $ # 7 5 9 5 $ ! ( e ¶ $ .=* D 5 $ H 5 !G 4 B h & 98 Q4 B4 $ " ( , 10 3 0 3 5 94 5 * 94 5 5 6 F > 5 9 $ / (A Q• Q $ " > 5% e> 5 $ / B a 5 $V Z 6> 5% $ M8 M8 4 4 5 4 5 F= * D E> 5 * % $ ¸0 3 $ $ a 5 / $ & * F $ 3 6 / ' ( H ! C % -% 9 & 9 &= / 4 5> $ H S 9 * $= / C4 5 4 ( * % 0 3 5 / & E $% $ 5 Q= $ $V 4 % @ 58 9 C 9 S 5 !% $ c 5 % ) * % A 6d 5 / b 4 = $ a 8 S /V W > 5% $ & b > @ $ ) ] $ 5 $ b ( CH 6 5 9 f 98 ; _ c ( * a 8 ;« V $ b $ 6 /% 8 * $= $ 9 $ MG 4 5 $ * % A ' % % BH 0 ; 0 Q 4 % ¶% ¤ # & .# e¥ eP ,P T $ 6 9> @ $ ( = $ 9 B 4 5 94 5 % a 5 5 $« 5 $% BH J 5= $ 9 > @ ( M /V W > 5% $ S Z 5 $ # H ® $ # $ &% 5 > @ 9 $ h % % U % 4 * % b 58 9 C 9 A ¹ 4 = J C $ 5 $ ( ( ?8 4 % « % % / * " 5= / $ $ ( % }% 5 5 e $ ) 5 b¦ % f¤ B 10 3 T D 9 5% 5 H ; 4 = $= $ $ # 9 e /G B4 $ h % : $ ) 5 (ª H "0 3 = J [ M 4 * ( ' % W% $ ( 4 c $V (A F 10 Q $ # $ (H 5 % ' * % & % 9 5 E 8 5 : ' > @ D¦ A A H Wo m © 9{ 'ª } # , 9 5 « 5= 5 9 = $ 6 8 j X Q¥ eP ,P > @ 98 $0 !A ¹ , ; ) * % $± = / / B (H * 4 5 : a 5 M 4 ( B / !M 5 c $% W% 5 $ 0 3 % % * % h M 5 9 5 , * ( $ * D% 5 a ( ( ! * = b 6 5 A K 3 5 $ < 5 % $ 5 # a e $V Z > % $ 5 H W> @ $ h % % b $ # $ c $= / ( $ 5 8 9 º 74 58 # 9 ( * % $ ! 8 : % b $V Z > % $ (A 7» ; 5 / ?> 54 5= / a 5 D ( e $%
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
(1992) · Cited by 23,431
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Simultaneous Statistical Inference
Miller, R. G. (1981) · Springer Series in Statistics · doi:10.1007/978-1-4613-8122-8 · Cited by 5,604
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.2307/2282952 · Cited by 1,166
Sampling Large Databases for Association Rules
Toivonen, H. T. T. (1996) · Cited by 1,089
Incremental Induction of Decision Trees
Utgoff, P. E. (1989) · Machine Learning · doi:10.1023/a:1022699900025 · Cited by 791
SPRINT: A Scalable Parallel Classifier for Data Mining
Shafer, J. C., Agrawal, R., & Mehta, M. (1996) · Cited by 787
Cited by
A survey on concept drift adaptation
Gama, J., Žliobaitė, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A. (2014) · ACM Computing Surveys · doi:10.1145/2523813 · Cited by 3,735
Models and issues in data stream systems
Babcock, B., Babu, S., Datar, M., Motwani, R., & Widom, J. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543615 · Cited by 2,495
Wu, X., Zhu, X., Wu, G.-Q., & Ding, W. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.109 · Cited by 2,410
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
Mining time-changing data streams
Hulten, G., Spencer, L., & Domingos, P. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502529 · Cited by 1,748
Self-citationLearning under Concept Drift: A Review
Lu, J., Liu, A., Dong, F., Gu, F., Gama, J., & Zhang, G. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2876857 · Cited by 1,603
Mining concept-drifting data streams using ensemble classifiers
Wang, H., Fan, W., Yu, P. S., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956778 · Cited by 1,256
A streaming ensemble algorithm (SEA) for large-scale classification
Street, W. N., & Kim, Y. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502568 · Cited by 1,205
Ensemble learning for data stream analysis: A survey
Krawczyk, B., Minku, L. L., Gama, J., Stefanowski, J., & Woźniak, M. (2017) · Information Fusion · doi:10.1016/j.inffus.2017.02.004 · Cited by 1,050
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Deep Neural Networks and Tabular Data: A Survey
Borisov, V., Leemann, T., Seßler, K., Haug, J., Pawelczyk, M., & Kasneci, G. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3229161 · Cited by 1,025
Density-Based Clustering over an Evolving Data Stream with Noise
Cao, F., Estert, M., Qian, W., & Zhou, A. (2006) · Proceedings of the 2006 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972764.29 · Cited by 1,016
Esling, P., & Agon, C. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379788 · Cited by 997
Gaber, M. M., Zaslavsky, A., & Krishnaswamy, S. (2005) · ACM SIGMOD Record · doi:10.1145/1083784.1083789 · Cited by 886
Adaptive random forests for evolving data stream classification
Gomes, H. M., Bifet, A., Read, J., Barddal, J. P., Enembreck, F., Pfharinger, B., Holmes, G., & Abdessalem, T. (2017) · Machine Learning · doi:10.1007/s10994-017-5642-8 · Cited by 805
Learning in Nonstationary Environments: A Survey
Ditzler, G., Roveri, M., Alippi, C., & Polikar, R. (2015) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2015.2471196 · Cited by 793
Zhu, Y., & Shasha, D. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50039-1 · Cited by 656
Dynamic Weighted Majority: An Ensemble Method for Drifting Concepts
Kolter, J. Z., & Maloof, M. A. (2007) · doi:10.5555/1314498.1390333 · Cited by 648
One-class classification: taxonomy of study and review of techniques
Khan, S. S., & Madden, M. G. (2014) · The Knowledge Engineering Review · doi:10.1017/s026988891300043x · Cited by 600
Towards Making Systems Forget with Machine Unlearning
Cao, Y., & Yang, J. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.35 · Cited by 622
A Survey on Ensemble Learning for Data Stream Classification
Gomes, H. M., Barddal, J. P., Enembreck, F., & Bifet, A. (2018) · ACM Computing Surveys · doi:10.1145/3054925 · Cited by 579
Sentiment Knowledge Discovery in Twitter Streaming Data
Bifet, A., & Frank, E. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-16184-1_1 · Cited by 573
New ensemble methods for evolving data streams
Bifet, A., Holmes, G., Pfahringer, B., Kirkby, R., & Gavaldà, R. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557041 · Cited by 558
Estimation of energy consumption in machine learning
García-Martín, E., Rodrigues, C. F., Riley, G., & Grahn, H. (2019) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2019.07.007 · Cited by 558
On evaluating stream learning algorithms
Gama, J., Sebastião, R., & Rodrigues, P. P. (2013) · Machine Learning · doi:10.1007/s10994-012-5320-9 · Cited by 532
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
A survey on data preprocessing for data stream mining: Current status and future directions
Ramírez-Gallego, S., Krawczyk, B., García, S., Woźniak, M., & Herrera, F. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.01.078 · Cited by 502
Adaptive Learning from Evolving Data Streams
Bifet, A., & Gavaldà, R. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03915-7_22 · Cited by 486
Saffari, A., Leistner, C., Santner, J., Godec, M., & Bischof, H. (2009) · 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops · doi:10.1109/iccvw.2009.5457447 · Cited by 481
Hierarchical Document Clustering Using Frequent Itemsets
Fung, B. C. M., Wang, K., & Ester, M. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.6 · Cited by 471
Data mining with differential privacy
Friedman, A., & Schuster, A. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835868 · Cited by 461
A comprehensive survey of anomaly detection techniques for high dimensional big data
Thudumu, S., Branch, P., Jin, J., & Singh, J. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00320-x · Cited by 425
Reacting to Different Types of Concept Drift: The Accuracy Updated Ensemble Algorithm
Brzezinski, D., & Stefanowski, J. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2251352 · Cited by 423
Dynamic weighted majority: a new ensemble method for tracking concept drift
Kolter, J. Z., & Maloof, M. A. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250911 · Cited by 419
Leveraging Bagging for Evolving Data Streams
Bifet, A., Holmes, G., & Pfahringer, B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15880-3_15 · Cited by 378
Metalearning: A survey of trends and technologies
Lemke, C., Budka, M., & Gabrys, B. (2015) · Artificial Intelligence Review · doi:10.1007/s10462-013-9406-y · Cited by 365
Classifier Ensembles for Changing Environments
Kuncheva, L. I. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-25966-4_1 · Cited by 335
Issues in evaluation of stream learning algorithms
Gama, J., Sebastião, R., & Rodrigues, P. P. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557060 · Cited by 333
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
A review of data mining using big data in health informatics
Herland, M., Khoshgoftaar, T. M., & Wald, R. (2014) · Journal Of Big Data · doi:10.1186/2196-1115-1-2 · Cited by 319
Processing complex aggregate queries over data streams
Dobra, A., Garofalakis, M., Gehrke, J., & Rastogi, R. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564699 · Cited by 319
Learning model trees from evolving data streams
Ikonomovska, E., Gama, J., & Džeroski, S. (2011) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0201-y · Cited by 304
Learning from streaming data with concept drift and imbalance: an overview
Hoens, T. R., Polikar, R., & Chawla, N. V. (2012) · Progress in Artificial Intelligence · doi:10.1007/s13748-011-0008-0 · Cited by 301
Accurate decision trees for mining high-speed data streams
Gama, J., Rocha, R., & Medas, P. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956813 · Cited by 298
A Survey of Data Mining and Deep Learning in Bioinformatics
Lan, K., Wang, D.-T., Fong, S., Liu, L.-S., Wong, K. K. L., & Dey, N. (2018) · Journal of Medical Systems · doi:10.1007/s10916-018-1003-9 · Cited by 288
Proceedings of the 19th Python in Science Conference
(2020) · Proceedings of the Python in Science Conference · doi:10.25080/majora-342d178e-02b · Cited by 284
Scaling up machine learning: parallel and distributed approaches
Bekkerman, R., Bilenko, M., & Langford, J. (2011) · Proceedings of the 17th ACM SIGKDD International Conference Tutorials · doi:10.1145/2107736.2107740 · Cited by 282
On computing correlated aggregates over continual data streams
Gehrke, J., Korn, F., & Srivastava, D. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375665 · Cited by 278
Machine learning for streaming data: state of the art, challenges, and opportunities
Gomes, H. M., Read, J., Bifet, A., Barddal, J. P., & Gama, J. (2019) · ACM SIGKDD Explorations Newsletter · doi:10.1145/3373464.3373470 · Cited by 267
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 issues in smart grid – A review
Tu, C., He, X., Shuai, Z., & Jiang, F. (2017) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2017.05.134 · Cited by 256
Incremental tensor analysis: Theory and applications
Sun, J., Tao, D., Papadimitriou, S., Yu, P. S., & Faloutsos, C. (2008) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1409620.1409621 · Cited by 254
Computational Health Informatics in the Big Data Age: A Survey
Fang, R., Pouyanfar, S., Yang, Y., Chen, S.-C., & Iyengar, S. S. (2017) · ACM Computing Surveys · doi:10.1145/2932707 · Cited by 210
Lifelong Machine Learning with Deep Streaming Linear Discriminant Analysis
Hayes, T. L., & Kanan, C. (2019) · arXiv · doi:10.48550/arxiv.1909.01520 · Cited by 150
Soe, Y. N., Feng, Y., Santosa, P. I., Hartanto, R., & Sakurai, K. (2020) · Electronics · doi:10.3390/electronics9010144 · Cited by 110
Event-based classification of social media streams
Reuter, T., & Cimiano, P. (2012) · Proceedings of the 2nd ACM International Conference on Multimedia Retrieval · doi:10.1145/2324796.2324824 · Cited by 98
FAHT: An Adaptive Fairness-aware Decision Tree Classifier
Zhang, W., & Ntoutsi, E. (2019) · Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/205 · Cited by 85
Incremental Learning of NCM Forests for Large-Scale Image Classification
Ristin, M., Guillaumin, M., Gall, J., & Van Gool, L. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.467 · Cited by 82
Survey on Models and Techniques for Root-Cause Analysis
Solé, M., Muntés-Mulero, V., Rana, A. I., & Estrada, G. (2017) · arXiv · doi:10.48550/arxiv.1701.08546 · Cited by 74
(2012) · Cited by 4
Metadata
- Authors
- Domingos, P., & Hulten, G.
- Venue
- Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2000-08
- Pages
- 71-80
- OpenAlex
- W2068714596
- Cited by
- 2,185
- References
- 25
- FWCI
- 23.77
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.