Compact MILP models for optimal and Pareto-optimal LAD patterns

Citations

WEB OF SCIENCE

19
Citations

SCOPUS

25

초록

This paper develops MILP models for various optimal and Pareto-optimal LAD patterns that involve at most 2n 0-1 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 0-1 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. (C) 2012 Elsevier B.V. All rights reserved.

키워드

LADMILPStrong prime patternStrong spanned patternMaximum prime patternMaximum spanned patternLOGICAL ANALYSISDATASETS
제목
Compact MILP models for optimal and Pareto-optimal LAD patterns
저자
Guo, CuiRyoo, Hong Seo
DOI
10.1016/j.dam.2012.05.006
발행일
2012-11
유형
Article
저널명
Discrete Applied Mathematics
160
16-17
페이지
2339 ~ 2348