This paper develops MILP models for various optimal and Pareto-optimal LAD patterns that involve at most 2n 01 decision variables, where n is the number of support features for the data under analysis, which usually is small. Noting that the previous MILP pattern generation models are defined in 2n+m 01 variables, where m is the number of observations in the dataset with m≫n in general, the new models are expected to generate useful LAD patterns more efficiently. With experiments on six well-studied machine learning datasets, we first demonstrate the efficiency of the new MILP models and next use them to show different utilities of strong prime patterns and strong spanned patterns in enhancing the overall classification accuracy of a LAD decision theory.
Bibliographical noteFunding Information:
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (Grant Number: 2010-0016571 ).
- Maximum prime pattern
- Maximum spanned pattern
- Strong prime pattern
- Strong spanned pattern
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics