Information Processing Letters
Cause-effect relationships and partially defined Boolean functions
Annals of Operations Research
Machine Learning
Logical analysis of numerical data
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Advanced Scout: Data Mining and Knowledge Discovery in NBA Data
Data Mining and Knowledge Discovery
An Implementation of Logical Analysis of Data
IEEE Transactions on Knowledge and Data Engineering
Training Support Vector Machines: an Application to Face Detection
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Global Optimization of Multiplicative Programs
Journal of Global Optimization
Pareto-optimal patterns in logical analysis of data
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Spanned patterns for the logical analysis of data
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Comprehensive vs. comprehensible classifiers in logical analysis of data
Discrete Applied Mathematics
A system for induction of oblique decision trees
Journal of Artificial Intelligence Research
Logical analysis of diffuse large B-cell lymphomas
Artificial Intelligence in Medicine
Compact MILP models for optimal and Pareto-optimal LAD patterns
Discrete Applied Mathematics
Hi-index | 0.04 |
Pattern generation methods for the Logical Analysis of Data (LAD) have been term-enumerative in nature. In this paper, we present a Mixed 0-1 Integer and Linear Programming (MILP) approach that can identify LAD patterns that are optimal with respect to various previously studied and new pattern selection preferences. Via art of formulation, the MILP-based method can generate optimal patterns that also satisfy user-specified requirements on prevalence, homogeneity and complexity. Considering that MILP problems with hundreds of 0-1 variables are easily solved nowadays, the proposed method presents an efficient way of generating useful patterns for LAD. With extensive experiments on benchmark datasets, we demonstrate the utility of the MILP-based pattern generation.