A review on instance ranking problems in statistical learning
From MaRDI portal
Publication:2127240
Cites work
- 10.1162/153244302320884605
- 10.1162/1532443041827916
- A Computer Method for Calculating Kendall's Tau with Ungrouped Data
- A decision-theoretic generalization of on-line learning and an application to boosting
- A Survey and Empirical Comparison of Object Ranking Methods
- Adaptive partitioning schemes for bipartite ranking
- An Alternative Ranking Problem for Search Engines
- An efficient algorithm for learning to rank from preference graphs
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
- Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
- Bagging predictors
- Bayesian aggregation of order-based rank data
- Boosting algorithms: regularization, prediction and model fitting
- Boosting for high-dimensional linear models
- Boosting With theL2Loss
- Generalization bounds for the area under the ROC curve
- Greedy function approximation: A gradient boosting machine.
- Hierarchical rank aggregation with applications to nanotoxicology
- scientific article; zbMATH DE number 6378127 (Why is no real title available?)
- scientific article; zbMATH DE number 1804115 (Why is no real title available?)
- scientific article; zbMATH DE number 3152611 (Why is no real title available?)
- scientific article; zbMATH DE number 3954047 (Why is no real title available?)
- scientific article; zbMATH DE number 1288298 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1966629 (Why is no real title available?)
- scientific article; zbMATH DE number 1881086 (Why is no real title available?)
- Introduction to algorithms.
- Label ranking algorithms: a survey
- Label ranking by learning pairwise preferences
- Large-scale linear rankSVM
- Learning Theory
- Learning to Rank for Information Retrieval
- Learning to rank on graphs
- Margin-based ranking and an equivalence between AdaBoost and RankBoost
- Multilabel classification via calibrated label ranking
- NON-NULL RANKING MODELS. I
- On predictive accuracy and risk minimization in pairwise label ranking
- On the scalability of ordered multi-class ROC analysis
- Overlaying classifiers: A practical approach to optimal scoring
- Preference Learning and Ranking by Pairwise Comparison
- Preference learning: An introduction
- Ranking and empirical minimization of \(U\)-statistics
- Ranking data with ordinal labels: optimality and pairwise aggregation
- Ranking forests
- Ranking the best instances
- Robust reductions from ranking to classification
- Robust Statistics
- Robustified \(L_2\) boosting
- Sparse Learning-to-Rank via an Efficient Primal-Dual Algorithm
- Stability selection. With discussion and authors' reply
- Statistics for high-dimensional data. Methods, theory and applications.
- Strictly Proper Scoring Rules, Prediction, and Estimation
- Subset Ranking Using Regression
- Surrogate regret bounds for bipartite ranking via strongly proper losses
- The p-norm push: a simple convex ranking algorithm that concentrates at the top of the list
- The treerank tournament algorithm for multipartite ranking
- Who's \#1? The science of rating and ranking
Cited in
(3)
This page was built for publication: A review on instance ranking problems in statistical learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127240)
