The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Handling concept drifts in incremental learning with support vector machines
Open accessAbstract
With the increase in the size of real-world databases, there is an ever-increasing need to scale up inductive learning algorithms.Incremental learning techniques are one possible solution to the scalability problem.In this paper, we propose three ctiteria to evaluate the robustness and reliability of incremental learning methods, and use them to study the robustness of an incremental training method for Support Vector Machines.We provide empirical results using benchmark machine learning datasets to show that support vectors form a svccdnct and suficient set for block-by-block incremental learning.
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
From data mining to knowledge discovery: an overview
Fayyad, U. M., Piatetsky-Shapiro, G., & Smyth, P. (1996) · Knowledge Discovery and Data Mining · Cited by 2,395
Instance-based learning algorithms
Aha, D. W., Kibler, D., & Albert, M. K. (1991) · Machine Learning · doi:10.1007/bf00153759 · Cited by 2,163
An improved training algorithm for support vector machines
Osuna, E., Freund, R., & Girosi, F. (2002) · Neural Networks for Signal Processing VII. Proceedings of the 1997 IEEE Signal Processing Society Workshop · doi:10.1109/nnsp.1997.622408 · Cited by 1,061
Incremental learning from noisy data
Schlimmer, J. C., & Granger, R. H. (1986) · Machine Learning · doi:10.1007/bf00116895 · Cited by 653
A case study of incremental concept induction
Schlimmer, J. C., & Fisher, D. (1986) · National Conference on Artificial Intelligence · Cited by 298
Effective learning in dynamic environments by explicit context tracking
Widmer, G., & Kubat, M. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-56602-3_139 · Cited by 172
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 127
Proceedings of the eighth international workshop on Machine learning
Birnbaum, L. A., & Collins, G. C. (1991) · Cited by 80
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
Dynamic Weighted Majority: An Ensemble Method for Drifting Concepts
Kolter, J. Z., & Maloof, M. A. (2007) · doi:10.5555/1314498.1390333 · Cited by 648
Incremental learning with support vector machines
Ruping, S. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989589 · Cited by 524
Learning drifting concepts: Example selection vs. example weighting
Klinkenberg, R. (2004) · Intelligent Data Analysis · doi:10.3233/ida-2004-8305 · Cited by 438
Liu, D., Zhou, J., Pan, D., Peng, Y., & Peng, X. (2015) · Measurement · doi:10.1016/j.measurement.2014.11.031 · Cited by 266
Metadata
- Authors
- Syed, N. A., Liu, H., & Sung, K. K.
- Venue
- Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 1999-08
- Pages
- 317-321
- OpenAlex
- W2078382802
- Cited by
- 282
- References
- 10
- FWCI
- 2.83
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Handling concept drifts in incremental learning with support vector machines. https://app.cochat.ai/papers/10.1145/312129.312267
- The paper
- Syed, N. A., Liu, H., & Sung, K. K. (1999). Handling concept drifts in incremental learning with support vector machines. Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/312129.312267
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.