Compact MILP models for optimal and Pareto-optimal LAD patterns

DOI10.1016/j.dam.2012.05.006zbMath1248.68404MaRDI QIDQ714016

Cui Guo, Hong Seo Ryoo

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

zbMATH Keywords

MILP; LAD; maximum prime pattern; maximum spanned pattern; strong prime pattern; strong spanned pattern

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68T10: Pattern recognition, speech recognition

68P05: Data structures

Related Items

Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches, \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation, Strong valid inequalities for Boolean logical pattern generation, Spherical classification of data, a new rule-based learning method, Efficient feature selection for logical analysis of large-scale multi-class datasets, Logical analysis of multiclass data with relaxed patterns, On Pareto-optimal Boolean logical patterns for numerical data

Uses Software

• UCI-ml
• Gurobi

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