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
Overfitting and undercomputing in machine learning
Dietterich, T. (1995) · ACM Computing Surveys · doi:10.1145/212094.212114 · Cited by 757
SLIQ: A fast scalable classifier for data mining
Mehta, M., Agrawal, R., & Rissanen, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014141 · Cited by 749
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Littlestone, N. (1988) · Machine Learning · doi:10.1007/bf00116827 · Cited by 497
Incremental Clustering for Mining in a Data Warehousing Environment
Ester, M., Kriegel, H., Sander, J., Wimmer, M. H., & Xu, X. (1998) · Cited by 474
Efficient progressive sampling
Provost, F., Jensen, D., & Oates, T. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312188 · Cited by 357
BOAT—optimistic decision tree construction
Gehrke, J., Ganti, V., Ramakrishnan, R., & Loh, W.-Y. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304197 · Cited by 288
Hoeffding Races: Accelerating Model Selection Search for Classification and Function Approximation
Maron, O., & Moore, A. (2018) · doi:10.1184/r1/6555050 · Cited by 265
Efficient Algorithms for Minimizing Cross Validation Error
Moore, A. W., & Lee, M. S. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50031-3 · Cited by 232
OPUS: An Efficient Admissible Algorithm for Unordered Search
Webb, G. I. (1995) · Journal of Artificial Intelligence Research · doi:10.1613/jair.227 · Cited by 207
Megainduction : machine learning on very large databases
Catlett, J. (1991) · Medical Entomology and Zoology · Cited by 169
BOAT—optimistic decision tree construction
Gehrke, J. E., Ganti, V., Ramakrishnan, R., & Loh, W. (1999) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/304182.304197 · Cited by 149
An Improved Algorithm for Incremental Induction of Decision Trees
Utgoff, P. E. (1994) · Elsevier eBooks · doi:10.1016/b978-1-55860-335-6.50046-5 · Cited by 132
Oversearching and layered search in empirical learning
Quinlan, J. R., & Cameron-Jones, R. M. (1995) · Cited by 119
Organization-based analysis of web-object sharing and caching
Wolman, A., Voelker, G., Sharma, N. K., Cardwell, N., Brown, M., Landray, T., Pinnel, D., Karlin, A. R., & Levy, H. M. (1999) · USENIX Symposium on Internet Technologies and Systems · Cited by 98
Anytime exploratory data analysis for massive data sets
Smyth, P., & Wolpert, D. H. (1997) · Knowledge Discovery and Data Mining · Cited by 21
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-citation
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.