Compact MILP models for optimal and Pareto-optimal LAD patterns
From MaRDI portal
Publication:714016
DOI10.1016/j.dam.2012.05.006zbMath1248.68404OpenAlexW2071016485MaRDI QIDQ714016
Publication date: 19 October 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.05.006
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Data structures (68P05)
Related Items (7)
Strong valid inequalities for Boolean logical pattern generation ⋮ Logical analysis of multiclass data with relaxed patterns ⋮ Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches ⋮ On Pareto-optimal Boolean logical patterns for numerical data ⋮ \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation ⋮ Spherical classification of data, a new rule-based learning method ⋮ Efficient feature selection for logical analysis of large-scale multi-class datasets
Uses Software
Cites Work
- MILP approach to pattern generation in logical analysis of data
- Occam's razor
- Logical analysis of numerical data
- Pareto-optimal patterns in logical analysis of data
- Very simple classification rules perform well on most commonly used datasets
- Logical analysis of data -- the vision of Peter L. Hammer
- Maximum patterns in datasets
- Comprehensive vs. comprehensible classifiers in logical analysis of data
- Spanned patterns for the logical analysis of data
This page was built for publication: Compact MILP models for optimal and Pareto-optimal LAD patterns