Large-Scale Linear RankSVM
From MaRDI portal
Publication:5378345
DOI10.1162/NECO_a_00571zbMath1410.68319WikidataQ44886453 ScholiaQ44886453MaRDI QIDQ5378345
Publication date: 12 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
A review on instance ranking problems in statistical learning, Nyström-based approximate kernel subspace learning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy function approximation: A gradient boosting machine.
- bmrm
- Pegasos: primal estimated sub-gradient solver for SVM
- Support-vector networks
- Fast algorithms for the calculation of Kendall's \(\tau\)
- Symmetric binary B-trees: Data structure and maintenance algorithms
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- A finite newton method for classification
- Trust Region Methods
- Newton's Method for Large Bound-Constrained Optimization Problems
- Balanced search trees made simple
- A NEW MEASURE OF RANK CORRELATION
- Random forests