The p-norm push: a simple convex ranking algorithm that concentrates at the top of the list
From MaRDI portal
Publication:2880971
zbMATH Open1235.68185MaRDI QIDQ2880971FDOQ2880971
Publication date: 17 April 2012
Published in: Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)
Full work available at URL: http://www.jmlr.org/papers/v10/rudin09b.html
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cited In (18)
- Extreme learning machine for ranking: generalization analysis and applications
- Generic subset ranking using binary classifiers
- A review on instance ranking problems in statistical learning
- Multi-attribute community detection in international trade network
- The fraud loss for selecting the model complexity in fraud detection
- Quantitative robustness of instance ranking problems
- Ranking with a P-Norm Push
- Editorial: Preference learning and ranking
- Approximation analysis of gradient descent algorithm for bipartite ranking
- Support Vector Algorithms for Optimizing the Partial Area under the ROC Curve
- The convergence rate of a regularized ranking algorithm
- Generalization performance of bipartite ranking algorithms with convex losses
- Robust ordinal regression in preference learning and ranking
- Sequential event prediction
- General framework for binary classification on top samples
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
- The risk of trivial solutions in bipartite top ranking
- Learning to rank on graphs
This page was built for publication: The \(p\)-norm push: a simple convex ranking algorithm that concentrates at the top of the list
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880971)
