Logical analysis of data: classification with justification

DOI10.1007/s10479-011-0916-1zbMath1230.68165OpenAlexW2118369625WikidataQ59560532 ScholiaQ59560532MaRDI QIDQ646700

Kazuhisa Makino, Endre Boros, Peter L. Hammer, Alexander Kogan, Toshihide Ibaraki, Yves Cramer

Publication date: 17 November 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-0916-1

zbMATH Keywords

justifiable classifierslearning from examplesrule-based classifiers

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning, Totally optimal decision rules, Logical proportions-related classification methods beyond analogy, Recent advances in the theory and practice of logical analysis of data, Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior, Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches, On Pareto-optimal Boolean logical patterns for numerical data, MCP: capturing big data by satisfiability (tool description)

Uses Software

• UCI-ml
• JBool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logical analysis of data -- an overview: from combinatorial optimization to medical applications
• Constructing optimal binary decision trees is NP-complete
• Logical analysis of numerical data
• Error-free and best-fit extensions of partially defined Boolean functions
• Learning decision trees from random examples
• The maximum box problem and its application to data analysis
• Pareto-optimal patterns in logical analysis of data
• Decomposability of partially defined Boolean functions
• Maximum patterns in datasets
• A theory of the learnable
• Disjunctive normal forms of Boolean functions with a small number of zeros
• On lower bounds for the complexity of disjunctive normal forms of Boolean functions with a small number of zeros
• On Dedekind's Problem: The Number of Monotone Boolean Functions