Bounding the difference between RankRC and RankSVM and application to multi-level rare class kernel ranking

DOI10.1007/s10618-017-0540-zzbMath1409.68241OpenAlexW2755646241MaRDI QIDQ1741234

Yuying Li, Thomas F. Coleman, Aditya Tayal

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-017-0540-z

zbMATH Keywords

AUCscalable computingnonlinear kernelranking lossranking SVMrare classreceiver operator characteristic

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• LIBSVM
• SMOTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cost-sensitive boosting for classification of imbalanced data
• On surrogate loss functions and \(f\)-divergences
• On the scalability of ordered multi-class ROC analysis
• On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
• Sparse kernel SVMs via cutting-plane training
• 10.1162/15324430260185619
• Comparing the Areas under Two or More Correlated Receiver Operating Characteristic Curves: A Nonparametric Approach
• A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
• 10.1162/153244302760200704
• Training a Support Vector Machine in the Primal
• Learning Theory
• A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
• Convexity, Classification, and Risk Bounds
• Support vector machines for classification in nonstandard situations

This page was built for publication: Bounding the difference between RankRC and RankSVM and application to multi-level rare class kernel ranking