An efficient algorithm for learning to rank from preference graphs
type: Item
instance of: scholarly article
title: An efficient algorithm for learning to rank from preference graphs
zbMATH Open document ID: 1470.68155
author: Tapio Pahikkala
author: Evgeni Tsivtsivadze
author: Antti Airola
author: Jouni Järvinen
author: Jorma Boberg
published in: Machine Learning
publication date: 2010-10-07T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5796900
zbMATH Keywords: ranking
zbMATH Keywords: preference learning
zbMATH Keywords: preference graph
zbMATH Keywords: regularized least-squares
zbMATH Keywords: kernel methods
describes a project that uses: Eigentaste
MaRDI profile type: Publication
full work available at URL: s10994-008-5097-z
OpenAlex ID: W2139039274
Wikidata QID: Q55980936
cites work: Learning Theory
cites work: Combinatorial matrix theory
cites work: An Alternative Ranking Problem for Search Engines
cites work: 10.1162/1532443041827916
cites work: Benchmarking least squares support vector machine classifiers
cites work: Eigentaste: A constant time collaborative filtering algorithm
cites work: Matrix Analysis
cites work: Graph-Based Semi-Supervised Learning and Spectral Kernel Design
cites work: Regularization Algorithms for Learning That Are Equivalent to Multilayer Networks
cites work: Q3093326
cites work: Q3093184
cites work: Q3174086
cites work: Q3148817
cites work: Advances in Intelligent Data Analysis VI
DBLP publication ID: journals/ml/PahikkalaTAJB09
DOI: 10.1007/S10994-008-5097-Z
description: scientific article; zbMATH DE number 5796900