The p-norm push: a simple convex ranking algorithm that concentrates at the top of the list

MaRDI QIDQ2880971zbMATH OpenFDO

Authors Cynthia Rudin

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

zbMATH Keywords

rankinginformation retrievalgeneralization boundsRankBoostRoc

Mathematics Subject Classification ID

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

Recommendations

• Ranking with a P-Norm Push
• On ranking and generalization bounds
• Learning Theory
• Regularized ranking with convex losses and \(\ell^1\)-penalty
• The convergence rate of a regularized ranking algorithm

Cited in

(19)

• The fraud loss for selecting the model complexity in fraud detection
• Approximation analysis of gradient descent algorithm for bipartite ranking
• Extreme learning machine for ranking: generalization analysis and applications
• Subset Ranking Using Regression
• Editorial: Preference learning and ranking
• General framework for binary classification on top samples
• Robust ordinal regression in preference learning and ranking
• The risk of trivial solutions in bipartite top ranking
• Quantitative robustness of instance ranking problems
• Learning to rank on graphs
• Sequential event prediction
• Generic subset ranking using binary classifiers
• The convergence rate of a regularized ranking algorithm
• A review on instance ranking problems in statistical learning
• Multi-attribute community detection in international trade network
• Ranking with a P-Norm Push
• Generalization performance of bipartite ranking algorithms with convex losses
• Support vector algorithms for optimizing the partial area under the ROC curve
• An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods

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)