scientific article; zbMATH DE number 5957322

MaRDI QIDQ3093337zbMATH OpenFDO

Authors Michael Schmitt, Laura Martignon

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v7/schmitt06a.html

zbMATH Keywords

bounded rationalityfast and frugal heuristicgreedy methodhardness of approximationNP-completenessPAC learning

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On the complexity of learning strings and sequences
• scientific article; zbMATH DE number 1104336
• Randomized algorithms for lexicographic inference
• scientific article; zbMATH DE number 1353833
• On the intrinsic complexity of learning
• The query complexity of learning DFA
• Computability-theoretic learning complexity
• On polynomial-time learnability in the limit of strictly deterministic automata
• scientific article; zbMATH DE number 1183266
• On the Complexity of a Game Related to the Dictionary Problem

Cited in

(14)

• Fast, frugal, and fit: simple heuristics for paired comparison
• Lexicographic preferences for predictive modeling of human decision making: a new machine learning method with an application in accounting
• 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
• Tight upper bounds for the expected loss of lexicographic heuristics in binary multi-attribute choice
• Naturalism, tractability and the adaptive toolbox
• Randomized algorithms for lexicographic inference
• Building rankings encompassing multiple criteria to support qualitative decision-making
• Democratic approximation of lexicographic preference models
• An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages
• On the complexity of learning strings and sequences

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093337)