Incremental learning with support vector machines
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Support vector machines (SVMs) have become a popular tool for machine learning with large amounts of high dimensional data. In this paper an approach for incremental learning with support vector machines is presented, that improves the existing approach of Syed et al. (1999). An insight into the interpretability of support vectors is also given.
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
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Making Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411
UCI Repository of Machine Learning Databases
Murphy, P. M. (1994) · Medical Entomology and Zoology · Cited by 1,844
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
Detecting Concept Drift with Support Vector Machines
Klinkenberg, R., & Joachims, T. (2000) · Cited by 422
Handling concept drifts in incremental learning with support vector machines
Syed, N. A., Liu, H., & Sung, K. K. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312267 · Cited by 282
Cited by
Learning a Unified Classifier Incrementally via Rebalancing
Hou, S., Pan, X., Loy, C. C., Wang, Z., & Lin, D. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00092 · Cited by 1,195
“Incremental learning has been a long standing research area [4, 30].”
BackgroundEnd-to-End Incremental Learning
Castro, F. M., Marín-Jiménez, M. J., Guil, N., Schmid, C., & Alahari, K. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01258-8_15 · Cited by 1,184
The Kernel Recursive Least-Squares Algorithm
Engel, Y., Mannor, S., & Meir, R. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.830985 · Cited by 1,104
Cross-domain video concept detection using adaptive svms
Yang, J., Yan, R., & Hauptmann, A. G. (2007) · Proceedings of the 15th ACM international conference on Multimedia · doi:10.1145/1291233.1291276 · Cited by 667
Aggarwal, C. C. (2015) · Data Mining · doi:10.1007/978-3-319-14142-8_13 · Cited by 606
Machine Learning Paradigms for Speech Recognition: An Overview
Deng, L., & Li, X. (2013) · IEEE Transactions on Audio, Speech, and Language Processing · doi:10.1109/tasl.2013.2244083 · Cited by 456
Learning drifting concepts: Example selection vs. example weighting
Klinkenberg, R. (2004) · Intelligent Data Analysis · doi:10.3233/ida-2004-8305 · Cited by 438
Accurate On-line Support Vector Regression
Ma, J., Theiler, J., & Perkins, S. (2003) · Neural Computation · doi:10.1162/089976603322385117 · Cited by 408
Research Review for Broad Learning System: Algorithms, Theory, and Applications
Gong, X., Zhang, T., Chen, C. L. P., & Liu, Z. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3061094 · Cited by 350
Classifying large data sets using SVMs with hierarchical clusters
Yu, H., Yang, J., & Han, J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956786 · Cited by 273
Liu, D., Zhou, J., Pan, D., Peng, Y., & Peng, X. (2015) · Measurement · doi:10.1016/j.measurement.2014.11.031 · Cited by 266
A comprehensive survey and taxonomy of the SVM-based intrusion detection systems
Mohammadi, M., Rashid, T. A., Karim, S. H. T., Aldalwie, A. H. M., Tho, Q. T., Bidaki, M., Rahmani, A. M., & Hosseinzadeh, M. (2021) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2021.102983 · Cited by 262
Chen, Y., Xiong, J., Xu, W., & Zuo, J. (2019) · Cluster Computing · doi:10.1007/s10586-018-1772-4 · Cited by 166
“The literature [3] firstly had proposed Incremental Learning on Support Vector Machine.”
BackgroundIncremental supervised learning: Algorithms and applications in pattern recognition
Chefrour, A. (2019) · Evolutionary Intelligence · doi:10.1007/s12065-019-00203-y · Cited by 42
“Ruping [31] proposes an incremental SVM algorithm that aims to manage all support vectors incrementally.”
MethodSoto, J. A. C., Jentsch, M., Preuveneers, D., & Ilie-Zudor, E. (2016) · Proceedings of the 6th International Conference on the Internet of Things · doi:10.1145/2991561.2991575 · Cited by 28
Metadata
- Authors
- Ruping, S.
- Venue
- Proceedings 2001 IEEE International Conference on Data Mining
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-14
- Pages
- 641-642
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2132641846
- Cited by
- 524
- References
- 6
- FWCI
- 14.14
- 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.