An efficient algorithm for learning to rank from preference graphs
From MaRDI portal
Publication:1959647
DOI10.1007/S10994-008-5097-ZzbMath1470.68155DBLPjournals/ml/PahikkalaTAJB09OpenAlexW2139039274WikidataQ55980936 ScholiaQ55980936MaRDI QIDQ1959647
Jorma Boberg, Tapio Pahikkala, Evgeni Tsivtsivadze, Antti Airola, Jouni Järvinen
Publication date: 7 October 2010
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-008-5097-z
Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (12)
A review on instance ranking problems in statistical learning ⋮ Generalized vec trick for fast learning of pairwise kernel models ⋮ Distributed spectral pairwise ranking algorithms ⋮ Symmetry and antisymmetry properties of optimal solutions to regression problems ⋮ Learning rates for regularized least squares ranking algorithm ⋮ 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 ⋮ Efficient cross-validation for kernelized least-squares regression with sparse basis expansions ⋮ Efficient regularized least-squares algorithms for conditional ranking on relational data ⋮ Learning intransitive reciprocal relations with kernel methods ⋮ Generic subset ranking using binary classifiers ⋮ Debiased magnitude-preserving ranking: learning rate and bias characterization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Benchmarking least squares support vector machine classifiers
- Regularization Algorithms for Learning That Are Equivalent to Multilayer Networks
- Graph-Based Semi-Supervised Learning and Spectral Kernel Design
- Matrix Analysis
- 10.1162/1532443041827916
- Advances in Intelligent Data Analysis VI
- An Alternative Ranking Problem for Search Engines
- Learning Theory
- Learning Theory
- Learning Theory
This page was built for publication: An efficient algorithm for learning to rank from preference graphs