ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1005.0928
  4. Cited By
Training linear ranking SVMs in linearithmic time using red-black trees
v1v2 (latest)

Training linear ranking SVMs in linearithmic time using red-black trees

6 May 2010
A. Airola
T. Pahikkala
T. Salakoski
ArXiv (abs)PDFHTML

Papers citing "Training linear ranking SVMs in linearithmic time using red-black trees"

5 / 5 papers shown
A Log-linear Gradient Descent Algorithm for Unbalanced Binary
  Classification using the All Pairs Squared Hinge Loss
A Log-linear Gradient Descent Algorithm for Unbalanced Binary Classification using the All Pairs Squared Hinge Loss
Kyle R. Rust
T. Hocking
178
2
0
21 Feb 2023
Scalable Nonlinear AUC Maximization Methods
Scalable Nonlinear AUC Maximization Methods
Majdi Khalid
I. Ray
H. Chitsaz
235
0
0
02 Oct 2017
A Sparse Nonlinear Classifier Design Using AUC Optimization
A Sparse Nonlinear Classifier Design Using AUC OptimizationSDM (SDM), 2016
Vishal Kakkar
S. Shevade
S. Sundararajan
Dinesh Garg
159
9
0
27 Dec 2016
Fast Kronecker product kernel methods via generalized vec trick
Fast Kronecker product kernel methods via generalized vec trick
A. Airola
T. Pahikkala
285
25
0
07 Jan 2016
Efficient Regularized Least-Squares Algorithms for Conditional Ranking
  on Relational Data
Efficient Regularized Least-Squares Algorithms for Conditional Ranking on Relational DataMachine-mediated learning (ML), 2012
T. Pahikkala
A. Airola
Michiel Stock
B. De Baets
Willem Waegeman
217
39
0
21 Sep 2012
1
Page 1 of 1