Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches

DOI10.1287/ijoc.2019.0940OpenAlexW3023480501MaRDI QIDQ5148189

Claudio Sterle, Maurizio Boccia, Aantonio Sforza

Publication date: 1 February 2021

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2019.0940

zbMATH Keywords

logical analysis of datacovering/partitioning approachdata mining and machine learningsimple pattern minimality problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (1)

Potential sales estimates of a new store

Uses Software

• Leibniz

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning
• Multi-pattern generation framework for logical analysis of data
• Logical analysis of data: classification with justification
• A new column generation algorithm for logical analysis of data
• Compact MILP models for optimal and Pareto-optimal LAD patterns
• \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
• Logical analysis of data -- an overview: from combinatorial optimization to medical applications
• MILP approach to pattern generation in logical analysis of data
• Separate-and-conquer rule learning
• Logical analysis of numerical data
• Strong valid inequalities for Boolean logical pattern generation
• ROC `n' rule learning -- towards a better understanding of covering algorithms
• Three perspectives of data mining
• Pareto-optimal patterns in logical analysis of data
• Logical analysis of data -- the vision of Peter L. Hammer
• A decomposition approach for a very large scale optimal diversity management problem
• Three approaches to data analysis. Test theory, rough sets and logical analysis of data.
• Classifying negative and positive points by optimal box clustering
• Operations research and data mining
• Maximum patterns in datasets
• Comprehensive vs. comprehensible classifiers in logical analysis of data
• Spanned patterns for the logical analysis of data
• A MINSAT Approach for Learning in Logic Domains
• A Set-Covering Approach with Column Generation for Parsimony Haplotyping
• Column-Generation Framework of Nonlinear Similarity Model for Reconstructing Sibling Groups
• General Symmetry Breaking Constraints

This page was built for publication: Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches