scientific article
From MaRDI portal
Publication:3093337
zbMath1222.68299MaRDI QIDQ3093337
Michael Schmitt, Laura Martignon
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v7/schmitt06a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-completenessbounded rationalityPAC learninghardness of approximationgreedy methodfast and frugal heuristic
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
Building rankings encompassing multiple criteria to support qualitative decision-making ⋮ Lexicographic preferences for predictive modeling of human decision making: a new machine learning method with an application in accounting ⋮ Naturalism, tractability and the adaptive toolbox ⋮ Randomized Algorithms for Lexicographic Inference ⋮ Democratic approximation of lexicographic preference models ⋮ Editorial: Preference learning and ranking ⋮ Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains ⋮ New complexity results on aggregating lexicographic preference trees using positional scoring rules ⋮ Voting on multi-issue domains with conditionally lexicographic preferences ⋮ Meta-inductive prediction based on attractivity weighting: mathematical and empirical performance evaluation
This page was built for publication:
