The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Dynamic weighted majority: a new ensemble method for tracking concept drift
Abstract
Algorithms for tracking concept drift are important for many applications. We present a general method based on the weighted majority algorithm for using any online learner for concept drift. Dynamic weighted majority (DWM) maintains an ensemble of base learners, predicts using a weighted-majority vote of these "experts", and dynamically creates and deletes experts in response to changes in performance. We empirically evaluated two experimental systems based on the method using incremental naive Bayes and incremental tree inducer [ITI] as experts. For the sake of comparison, we also included Blum's implementation of weighted majority. On the STAGGER concepts and on the SEA concepts, results suggest that the ensemble method learns drifting concepts almost as well as the base algorithms learn each concept individually. Indeed, we report the best overall results for these problems to date.
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
(1992) · Cited by 23,431
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
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
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
Popular Ensemble Methods: An Empirical Study
Opitz, D., & Maclin, R. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.614 · Cited by 2,953
Dietterich, T. G. (2000) · Machine Learning · doi:10.1023/a:1007607513941 · Cited by 2,941
Estimating Continuous Distributions in Bayesian Classifiers
John, G. H., & Langley, P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4964 · Cited by 2,885
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Bauer, E., & Kohavi, R. (1999) · Machine Learning · doi:10.1023/a:1007515423169 · Cited by 2,638
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
Mining high-speed data streams
Domingos, P., & Hulten, G. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347107 · Cited by 2,185
Instance-based learning algorithms
Aha, D. W., Kibler, D., & Albert, M. K. (1991) · Machine Learning · doi:10.1007/bf00153759 · Cited by 2,163
Scaling Up the Accuracy of Naive-Bayes Classifiers : a Decision-Tree Hybrid
Kohavi, R. (1996) · Knowledge Discovery and Data Mining · Cited by 2,142
The Weighted Majority Algorithm
Littlestone, N., & Warmuth, M. K. (1994) · Information and Computation · doi:10.1006/inco.1994.1009 · Cited by 1,975
Dynamic itemset counting and implication rules for market basket data
Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253325 · Cited by 1,951
Learning in the Presence of Concept Drift and Hidden Contexts
Widmer, G., & Kubat, M. (1996) · Machine Learning · doi:10.1023/a:1018046501280 · Cited by 1,857
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
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
Langley, P. (1995) · Medical Entomology and Zoology · Cited by 559
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
Littlestone, N. (1988) · Machine Learning · doi:10.1007/bf00116827 · Cited by 497
A case study of incremental concept induction
Schlimmer, J. C., & Fisher, D. (1986) · National Conference on Artificial Intelligence · Cited by 373
Decision Tree Induction Based on Efficient Tree Restructuring
Utgoff, P. E., Berkman, N. C., & Clouse, J. A. (1997) · Machine Learning · doi:10.1023/a:1007413323501 · Cited by 359
Feature selection for ensembles
Opitz, D. W. (1999) · Cited by 310
An empirical evaluation of bagging and boosting
Maclin, R., & Opitz, D. W. (1997) · Cited by 265
On the Quasi-Minimal Solution of the General Covering Problem
Michalski, R. S. (1969) · George Mason University · doi:10.13021/mars/3596 · Cited by 232
Beyond incremental processing: tracking concept drift
Schlimmer, J. C., & Granger, R. (1986) · National Conference on Artificial Intelligence · Cited by 207
Blum, A. (1997) · Machine Learning · doi:10.1023/a:1007335615132 · Cited by 191
Online Ensemble Learning: An Empirical Study
Fern, A., & Givan, R. L. (2003) · Machine Learning · doi:10.1023/a:1025619426553 · Cited by 148
Selecting Examples for Partial Memory Learning
Maloof, M. A., & Michalski, R. S. (2000) · Machine Learning · doi:10.1023/a:1007661119649 · Cited by 142
Self-citationIncremental learning with partial instance memory
Maloof, M. A., & Michalski, R. S. (2003) · Artificial Intelligence · doi:10.1016/j.artint.2003.04.001 · Cited by 125
Self-citationThe application of AdaBoost for distributed, scalable and on-line learning
Fan, W., Stolfo, S. J., & Zhang, J. (1999) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/312129.312283 · Cited by 116
Michalski, R. S. (1983) · doi:10.13021/mars/3477 · Cited by 45
Incremental rule learning with partial instance memory for changing concepts
Maloof, M. A. (2004) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2003.1224005 · Cited by 29
Self-citationIncremental Learning with Partial Instance Memory
Maloof, M. A., & Michalski, R. S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-48050-1_4 · Cited by 26
Self-citation(1996)
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
Sagi, O., & Rokach, L. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1249 · Cited by 3,103
Collaborative filtering with temporal dynamics
Koren, Y. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557072 · Cited by 1,203
Avidan, S. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.35 · Cited by 1,112
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
Metadata
- Authors
- Kolter, J. Z., & Maloof, M. A.
- Venue
- Third IEEE International Conference on Data Mining
- Publisher
- IEEE Comput. Soc
- Published
- 2004-04-23
- Pages
- 123-130
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2110222014
- Cited by
- 419
- References
- 35
- FWCI
- 10.19
- 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.