A review on instance ranking problems in statistical learning
From MaRDI portal
Publication:2127240
DOI10.1007/s10994-021-06122-3OpenAlexW3215419681MaRDI QIDQ2127240
Publication date: 20 April 2022
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.02998
supervised learningstructural risk minimizationempirical risk minimizationsurrogate lossesinstance ranking problems
Related Items
Uses Software
Cites Work
- Greedy function approximation: A gradient boosting machine.
- Bagging predictors
- Ranking data with ordinal labels: optimality and pairwise aggregation
- Adaptive partitioning schemes for bipartite ranking
- Boosting algorithms: regularization, prediction and model fitting
- Hierarchical rank aggregation with applications to nanotoxicology
- Statistics for high-dimensional data. Methods, theory and applications.
- Overlaying classifiers: A practical approach to optimal scoring
- Robust reductions from ranking to classification
- Multilabel classification via calibrated label ranking
- Robustified \(L_2\) boosting
- On the scalability of ordered multi-class ROC analysis
- On predictive accuracy and risk minimization in pairwise label ranking
- A decision-theoretic generalization of on-line learning and an application to boosting
- Learning to rank on graphs
- An efficient algorithm for learning to rank from preference graphs
- Label ranking by learning pairwise preferences
- Ranking and empirical minimization of \(U\)-statistics
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
- Boosting for high-dimensional linear models
- Preference Learning: An Introduction
- Label Ranking Algorithms: A Survey
- Preference Learning and Ranking by Pairwise Comparison
- A Survey and Empirical Comparison of Object Ranking Methods
- NON-NULL RANKING MODELS. I
- Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
- Learning to Rank for Information Retrieval
- 10.1162/153244302320884605
- Boosting With theL2Loss
- Stability Selection
- 10.1162/1532443041827916
- Bayesian Aggregation of Order-Based Rank Data
- The TreeRank Tournament algorithm for multipartite ranking
- Sparse Learning-to-Rank via an Efficient Primal-Dual Algorithm
- Subset Ranking Using Regression
- Strictly Proper Scoring Rules, Prediction, and Estimation
- Large-Scale Linear RankSVM
- An Alternative Ranking Problem for Search Engines
- Learning Theory
- A Computer Method for Calculating Kendall's Tau with Ungrouped Data
- Robust Statistics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
