Machine Learning: ECML 2003

DOI10.1007/b13633zbMath1257.68126OpenAlexW2479545322MaRDI QIDQ5897342

Johannes Fürnkranz, Eyke Hüllermeier

Publication date: 23 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13633

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (16)

Discovering a taste for the unusual: exceptional models for preference mining ⋮ Label ranking by learning pairwise preferences ⋮ Preference relation-based Markov random fields for recommender systems ⋮ A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings ⋮ Learning weak constraints in answer set programming ⋮ Learning to rank the distinctiveness of behaviour in serial offending ⋮ On the ERA ranking representability of pairwise bipartite ranking functions ⋮ Democratic approximation of lexicographic preference models ⋮ Variable consistency dominance-based rough set approach to preference learning in multicriteria ranking ⋮ Sequential event prediction ⋮ Consistent union and prioritized consistent union: new operations for preference aggregation ⋮ Learning intransitive reciprocal relations with kernel methods ⋮ Combining predictions in pairwise classification: an optimal adaptive voting strategy and its relation to weighted voting ⋮ Multilabel classification via calibrated label ranking ⋮ Kernel-based learning methods for preference aggregation ⋮ Semi-supervised Learning to Rank with Nonlinear Preference Model

This page was built for publication: Machine Learning: ECML 2003