Cited by 707Machine Learning and AlgorithmsMachine Learning and ELMStochastic Gradient Optimization Techniques

Incremental support vector learning for ordinal regression

Gu, Bin, Sheng, Victor S., Tay, Keng Yeow, Romano, Walter, Li, Shuo·2015·IEEE Transactions on Neural Networks and Learning Systems

Abstract

Support vector ordinal regression (SVOR) is a popular method to tackle ordinal regression problems. However, until now there were no effective algorithms proposed to address incremental SVOR learning due to the complicated formulations of SVOR. Recently, an interesting accurate on-line algorithm was proposed for training ν -support vector classification (ν-SVC), which can handle a quadratic formulation with a pair of equality constraints. In this paper, we first present a modified SVOR formulation based on a sum-of-margins strategy. The formulation has multiple constraints, and each constraint includes a mixture of an equality and an inequality. Then, we extend the accurate on-line ν-SVC algorithm to the modified formulation, and propose an effective incremental SVOR algorithm. The algorithm can handle a quadratic formulation with multiple constraints, where each constraint is constituted of an equality and an inequality. More importantly, it tackles the conflicts between the equality and inequality constraints. We also provide the finite convergence analysis for the algorithm. Numerical experiments on the several benchmark and real-world data sets show that the incremental algorithm can converge to the optimal solution in a finite number of steps, and is faster than the existing batch and incremental SVOR algorithms. Meanwhile, the modified formulation has better accuracy than the existing incremental SVOR algorithm, and is as accurate as the sum-of-margins based formulation of Shashua and Levin.

Integrity signals

Registry

Crossref · 10.1109/tnnls.2014.2342533

Cites

38 of 38 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Facial expression detection has a fast and strong but fluctuating response, and EEG detection has a smooth but stable response over the trial time.

    “The reason could be based on the fact that the facial expression detection has a fast and strong but fluctuating response, and the EEG detection had a smooth but stable response over the trial time [20].”
  • Decremental and incremental strategies have been applied to integrate relevant data samples for SVR training and ignore irrelevant parts.

    “In order to improve the stability and robustness of SVR with largescale training samples, decremental and incremental strategies [136,137] have been applied to integrate the relevant data sample for SVR training and ignore the irrelevant part.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Gu, B., Sheng, V. S., Tay, K. Y., Romano, W., & Li, S.
Affiliations
  • Western University (CA)
  • University of Central Arkansas (US)
  • London Health Sciences Centre (CA)
  • St Joseph's Health Care (CA)
Venue
IEEE Transactions on Neural Networks and Learning Systems
Published
2015-07
Volume
26
Issue
7
Pages
1403-1416
ISSN
  • 2162-237X (ISSN-L)
  • 2162-2388
OpenAlex
W2061879449
Cited by
707
References
38
Citations by year
2026: 6 · 2025: 5 · 2024: 13 · 2023: 14 · 2022: 23 · 2021: 20 · 2020: 29 · 2019: 41 · 2018: 97 · 2017: 245 · 2016: 179 · 2015: 34 · 2013: 1
FWCI
152.17
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Neural Networks and Learning Systems (publishedVersion)
  • PubMed (publishedVersion)
  • Scholarship@Western (Western University) (submittedVersion)
Funders
  • Priority Academic Program Development, Jiangsu Higher Education Institutions
  • U.S. National Science Foundation (IIS-1115417)
  • National Natural Science Foundation of China (61232016, 61202137)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and ELM
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
Keywords
incremental learning, online learning, support vector machine classification, equality and inequality constraints, quadratic programming, ordinal classification

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