The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
A support vector method for multivariate performance measures
Abstract
This paper presents a Support Vector Method for optimizing multivariate nonlinear performance measures like the F1-score. Taking a multivariate prediction approach, we give an algorithm with which such multivariate SVMs can be trained in polynomial time for large classes of potentially non-linear performance measures, in particular ROCArea and all measures that can be computed from the contingency table. The conventional classification SVM arises as a special case of our method.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Probabilistic Outputs for Support vector Machines and Comparisons to Regularized Likelihood Methods
Platt, J. C. (1999) · Cited by 6,385
Support vector machine learning for interdependent and structured output spaces
Tsochantaridis, I., Hofmann, T., Joachims, T., & Altun, Y. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015341 · Cited by 1,243
Self-citationTaskar, B., Guestrin, C., & Koller, D. (2003) · Cited by 1,206
Large Margin Rank Boundaries for Ordinal Regression
Herbrich, R., Graepel, T., & Obermayer, K. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0010 · Cited by 1,074
AUC Optimization vs. Error Rate Minimization
Cortes, C., & Mohri, M. (2003) · Cited by 530
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/1532443041827916 · Cited by 363
A study of thresholding strategies for text categorization
Yang, Y. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.383975 · Cited by 358
Morik, K. J., Brockhausen, P., & Joachims, T. (1999) · RePEc: Research Papers in Economics · Cited by 350
Self-citationSupport Vector Machines for Classification in Nonstandard Situations
Lin, Y., Lee, Y., & Wahba, G. (2002) · Machine Learning · doi:10.1023/a:1012406528296 · Cited by 348
Evaluating and optimizing autonomous text classification systems
Lewis, D. D. (1995) · Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '95 · doi:10.1145/215206.215366 · Cited by 308
Data mining in metric space: an empirical analysis of supervised learning performance criteria
Caruana, R., & Niculescu-Mizil, A. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014063 · Cited by 303
Learning Decision Trees Using the Area Under the ROC Curve
Ferri, C., Flach, P. A., & Hernández‐Orallo, J. (2002) · Bristol Research (University of Bristol) · Cited by 296
Optimizing classifier performance via an approximation to the Wilcoxon-Mann-Whitney statistic
Yan, L., Dodier, R. H., Mozer, M. C., & Wolniewicz, R. H. (2003) · Cited by 225
Optimising area under the ROC curve using gradient descent
Herschtal, A., & Raskutti, B. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015366 · Cited by 190
An iterative method for multi-class cost-sensitive learning
Abe, N., Zadrozny, B., & Langford, J. C. (2004) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1014052.1014056 · Cited by 148
Optimizing F-Measure with Support Vector Machines
Musicant, D. R., Kumar, V., & Ozgur, A. (2003) · Cited by 83
Estimating Class Membership Probabilities using Classifier Learners.
Langford, J. C., & Zadrozny, B. (2005) · International Conference on Artificial Intelligence and Statistics · Cited by 47
Cited by
The relationship between Precision-Recall and ROC curves
Davis, J., & Goadrich, M. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143874 · Cited by 6,559
(2015) · Cited by 2,857
Training linear SVMs in linear time
Joachims, T. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150429 · Cited by 1,920
Self-citationLearning to rank for information retrieval
Liu, T.-Y. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835676 · Cited by 1,856
Certifying and Removing Disparate Impact
Feldman, M., Friedler, S. A., Moeller, J., Scheidegger, C., & Venkatasubramanian, S. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783311 · Cited by 1,827
Metadata
- Authors
- Joachims, T.
- Venue
- Proceedings of the 22nd international conference on Machine learning - ICML '05
- Publisher
- ACM Press
- Published
- 2005
- Pages
- 377-384
- OpenAlex
- W2070771761
- Cited by
- 786
- References
- 20
- FWCI
- 19.32
- 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.