An efficient algorithm for learning to rank from preference graphs
From MaRDI portal
Recommendations
Cites work
- 10.1162/1532443041827916
- A unifying view of sparse approximate Gaussian process regression
- Advances in Intelligent Data Analysis VI
- An Alternative Ranking Problem for Search Engines
- Benchmarking least squares support vector machine classifiers
- Combinatorial matrix theory
- Eigentaste: A constant time collaborative filtering algorithm
- Graph-Based Semi-Supervised Learning and Spectral Kernel Design
- scientific article; zbMATH DE number 1804115 (Why is no real title available?)
- In defense of one-vs-all classification
- Learning Theory
- Learning Theory
- Learning Theory
- Matrix Analysis
- Regularization algorithms for learning that are equivalent to multilayer networks
- Value regularization and Fenchel duality
Cited in
(31)- On kernel methods for covariates that are rankings
- Symmetry and antisymmetry properties of optimal solutions to regression problems
- Preference-based learning to rank
- Learning to rank on graphs
- A review on instance ranking problems in statistical learning
- Generalized vec trick for fast learning of pairwise kernel models
- Efficient regularized least-squares algorithms for conditional ranking on relational data
- Preference Learning and Ranking by Pairwise Comparison
- Co-regularized least-squares for label ranking
- Efficient learning of label ranking by soft projections onto polyhedra
- A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
- Ranking as function approximation
- Efficient cross-validation for kernelized least-squares regression with sparse basis expansions
- 10.1162/1532443041827916
- Distributed spectral pairwise ranking algorithms
- Learning to Rank in Entity Relationship Graphs
- Efficient learning of sparse ranking functions
- Learning rates for regularized least squares ranking algorithm
- Large-scale linear rankSVM
- Advances in Intelligent Data Analysis VI
- An Alternative Ranking Problem for Search Engines
- Learning to rank in vector spaces and social networks
- A MIP-based approach to learn MR-sort models with single-peaked preferences
- Optimality of regularized least squares ranking with imperfect kernels
- Generic subset ranking using binary classifiers
- Debiased magnitude-preserving ranking: learning rate and bias characterization
- Reliable graph-based collaborative ranking
- An experimental comparison of cross-validation techniques for estimating the area under the ROC curve
- VE dimension induced by Bayesian networks over the Boolean domain
- Learning intransitive reciprocal relations with kernel methods
- Learning to rank: a ROC-based graph-theoretic approach
This page was built for publication: An efficient algorithm for learning to rank from preference graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1959647)
