The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Ordinal Regression by Extended Binary Classification
Abstract
We present a reduction framework from ordinal regression to binary classification based on extended examples. The framework consists of three steps: extracting \nextended examples from the original examples, learning a binary classifier on the extended examples with any binary classification algorithm, and constructing a \nranking rule from the binary classifier. A weighted 0/1 loss of the binary classifier would then bound the mislabeling cost of the ranking rule. Our framework \nallows not only to design good ordinal regression algorithms based on well-tuned binary classification approaches, but also to derive new generalization bounds for \nordinal regression from known bounds for binary classification. In addition, our framework unifies many existing ordinal regression algorithms, such as perceptron \nranking and support vector ordinal regression. When compared empirically on benchmark data sets, some of our newly designed algorithms enjoy advantages \nin terms of both training speed and generalization performance over existing algorithms, which demonstrates the usefulness of our framework.
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
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
A Simple Approach to Ordinal Classification
Frank, E., & Hall, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44795-4_13 · Cited by 606
Cited by
Incremental support vector learning for ordinal regression
Gu, B., Sheng, V. S., Tay, K. Y., Romano, W., & Li, S. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2342533 · Cited by 707
Ordinal Regression with Multiple Output CNN for Age Estimation
Niu, Z., Zhou, M., Wang, L., Gao, X., & Hua, G. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.532 · Cited by 661
Ordinal Regression Methods: Survey and Experimental Study
Gutierrez, P. A., Perez-Ortiz, M., Sanchez-Monedero, J., Fernandez-Navarro, F., & Hervas-Martinez, C. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2457911 · Cited by 483
LETOR: A benchmark collection for research on learning to rank for information retrieval
Qin, T., Liu, T.-Y., Xu, J., & Li, H. (2010) · Information Retrieval · doi:10.1007/s10791-009-9123-y · Cited by 461
Rank consistent ordinal regression for neural networks with application to age estimation
Cao, W., Mirjalili, V., & Raschka, S. (2020) · Pattern Recognition Letters · doi:10.1016/j.patrec.2020.11.008 · Cited by 378
Metadata
- Authors
- Li, L., & Lin, H.-T.
- Venue
- Advances in Neural Information Processing Systems 19
- Publisher
- The MIT Press
- Published
- 2007-09-07
- Pages
- 865-872
- OpenAlex
- W2128186735
- Cited by
- 244
- References
- 3
- FWCI
- 12.44
- Type
- book chapter
- 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.