Strong valid inequalities for Boolean logical pattern generation
- Authors
- Yan, Kedong; Ryoo, Hong Seo
- Issue Date
- 9월-2017
- Publisher
- SPRINGER
- Keywords
- Boolean logic; Logical analysis of data; Pattern; 0-1 multilinear programming; 0-1 linearization; Hypercube; Clique
- Citation
- JOURNAL OF GLOBAL OPTIMIZATION, v.69, no.1, pp.183 - 230
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF GLOBAL OPTIMIZATION
- Volume
- 69
- Number
- 1
- Start Page
- 183
- End Page
- 230
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/82392
- DOI
- 10.1007/s10898-017-0512-2
- ISSN
- 0925-5001
- Abstract
- 0-1 multilinear programming (MP) captures the essence of pattern generation in logical analysis of data (LAD). This paper utilizes graph theoretic analysis of data to discover useful neighborhood properties among data for data reduction and multi-term linearization of the common constraint of an MP pattern generation model in a small number of stronger valid inequalities. This means that, with a systematic way to more efficiently generating Boolean logical patterns, LAD can be used for more effective analysis of data in practice. Mathematical properties and the utility of the new valid inequalities are illustrated on small examples and demonstrated through extensive experiments on 12 real-life data mining datasets.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Industrial and Management Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.