Adaptive partitioning schemes for bipartite ranking
From MaRDI portal
(Redirected from Publication:413849)
Recommendations
- Learning Theory
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems
- Upper bounds and aggregation in bipartite ranking
- Bipartite ranking: a risk-theoretic perspective
- Ranking with adaptive neighbors
- Adaptive submodular ranking
- Learning Theory
- Approximation analysis of gradient descent algorithm for bipartite ranking
Cites work
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 47282 (Why is no real title available?)
- scientific article; zbMATH DE number 1380579 (Why is no real title available?)
- scientific article; zbMATH DE number 835699 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- 10.1162/1532443041827916
- A critical analysis of variants of the AUC
- Adaptive estimation of the optimal ROC curve and a bipartite ranking algorithm
- Analysis of a complexity-based pruning scheme for classification trees
- Approximation Theorems of Mathematical Statistics
- Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
- Concept learning using complexity regularization
- Improving the AUC of probabilistic estimation trees.
- Learning Theory
- Model selection by resampling penalization
- Optimal aggregation of classifiers in statistical learning.
- Overlaying classifiers: A practical approach to optimal scoring
- Ranking and empirical minimization of \(U\)-statistics
- Theory of Classification: a Survey of Some Recent Advances
- Tree induction for probability-based ranking
- Tree-Based Ranking Methods
Cited in
(11)- scientific article; zbMATH DE number 1931855 (Why is no real title available?)
- Ranking forests
- The treerank tournament algorithm for multipartite ranking
- A review on instance ranking problems in statistical learning
- Ranking the best instances
- PAC-Bayesian high dimensional bipartite ranking
- Generalization performance of bipartite ranking algorithms with convex losses
- New rank learning algorithm
- Ranking data with ordinal labels: optimality and pairwise aggregation
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
- A new probabilistic approach in rank regression with optimal Bayesian partitioning
This page was built for publication: Adaptive partitioning schemes for bipartite ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413849)
