Large-scale linear rankSVM
From MaRDI portal
Publication:5378345
DOI10.1162/NECO_A_00571zbMATH Open1410.68319DBLPjournals/neco/LeeL14WikidataQ44886453 ScholiaQ44886453MaRDI QIDQ5378345FDOQ5378345
Authors: Ching-pei Lee, Chih-Jen Lin
Publication date: 12 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- LIBLINEAR: a library for large linear classification
- Newton's Method for Large Bound-Constrained Optimization Problems
- bmrm
- Pegasos: primal estimated sub-gradient solver for SVM
- Greedy function approximation: A gradient boosting machine.
- Random forests
- Support-vector networks
- Title not available (Why is that?)
- A NEW MEASURE OF RANK CORRELATION
- Title not available (Why is that?)
- Trust region Newton method for logistic regression
- Trust Region Methods
- Symmetric binary B-trees: Data structure and maintenance algorithms
- A modified finite Newton method for fast solution of large scale linear SVMs
- Bundle methods for regularized risk minimization
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- A finite newton method for classification
- Fast algorithms for the calculation of Kendall's \(\tau\)
- Large-scale linear support vector regression
- Balanced search trees made simple
Cited In (5)
Uses Software
This page was built for publication: Large-scale linear rankSVM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378345)