\(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
From MaRDI portal
Publication:730482
DOI10.1016/j.dam.2016.08.007zbMath1358.90075OpenAlexW2521139169MaRDI QIDQ730482
Publication date: 28 December 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.08.007
logical analysis of dataBoolean logicpattern generationmultilinear programming\(0\text{-}1\) linearization
Related Items (8)
Graph, clique and facet of Boolean logical polytope ⋮ Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data ⋮ Strong valid inequalities for Boolean logical pattern generation ⋮ Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches ⋮ On Pareto-optimal Boolean logical patterns for numerical data ⋮ A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation ⋮ Spherical classification of data, a new rule-based learning method ⋮ Efficient feature selection for logical analysis of large-scale multi-class datasets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new column generation algorithm for logical analysis of data
- Concave extensions for nonlinear 0-1 maximization problems
- Compact MILP models for optimal and Pareto-optimal LAD patterns
- Pattern-based feature selection in genomics and proteomics
- Logical analysis of data -- an overview: from combinatorial optimization to medical applications
- MILP approach to pattern generation in logical analysis of data
- Logical analysis of Chinese labor productivity patterns
- A convex envelope formula for multilinear functions
- Logical analysis of numerical data
- Strong valid inequalities for Boolean logical pattern generation
- Coronary risk prediction by logical analysis of data
- Pareto-optimal patterns in logical analysis of data
- A branch-and-reduce approach to global optimization
- Efficiently covering complex networks with cliques of similar vertices
- Maximum patterns in datasets
- Comprehensive vs. comprehensible classifiers in logical analysis of data
- A LAD-based method for selecting short oligo probes for genotyping applications
- Spanned patterns for the logical analysis of data
- Nonlinear 0–1 programming: I. Linearization techniques
- L’algebre de Boole et ses applications en recherche operationnelle
- Approximations of pseudo-Boolean functions; applications to game theory
- Faces for a linear inequality in 0–1 variables
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Data reduction and exact algorithms for clique cover
- Analysis of bounds for multilinear functions
This page was built for publication: \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
