A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yan, Kedong | - |
dc.contributor.author | Ryoo, Hong Seo | - |
dc.date.accessioned | 2021-09-01T10:11:45Z | - |
dc.date.available | 2021-09-01T10:11:45Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2019-08 | - |
dc.identifier.issn | 0925-5001 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/63670 | - |
dc.description.abstract | 0-1 multilinear program (MP) holds a unifying theory to LAD pattern generation. This paper studies a multi-term relaxation of the objective function of the pattern generation MP for a tight polyhedral relaxation in terms of a small number of stronger 0-1 linear inequalities. Toward this goal, we analyze data in a graph to discover useful neighborhood properties among a set of objective terms around a single constraint term. In brief, they yield a set of facet-defining inequalities for the 0-1 multilinear polytope associated with the McCormick inequalities that they replace. The construction and practical utility of the new inequalities are illustrated on a small example and thoroughly demonstrated through numerical experiments with 12 public machine learning datasets. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.subject | RISK | - |
dc.title | A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Ryoo, Hong Seo | - |
dc.identifier.doi | 10.1007/s10898-018-0680-8 | - |
dc.identifier.scopusid | 2-s2.0-85049001246 | - |
dc.identifier.wosid | 000482123200006 | - |
dc.identifier.bibliographicCitation | JOURNAL OF GLOBAL OPTIMIZATION, v.74, no.4, pp.705 - 735 | - |
dc.relation.isPartOf | JOURNAL OF GLOBAL OPTIMIZATION | - |
dc.citation.title | JOURNAL OF GLOBAL OPTIMIZATION | - |
dc.citation.volume | 74 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 705 | - |
dc.citation.endPage | 735 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | RISK | - |
dc.subject.keywordAuthor | Logical analysis of data | - |
dc.subject.keywordAuthor | Pattern | - |
dc.subject.keywordAuthor | 0-1 multilinear programming | - |
dc.subject.keywordAuthor | Multi-term polyhedral relaxation | - |
dc.subject.keywordAuthor | Facet-defining inequalities | - |
dc.subject.keywordAuthor | Graph | - |
dc.subject.keywordAuthor | Star | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.