Logical analysis of numerical data

DOI10.1007/BF02614316zbMath0887.90179DBLPjournals/mp/BorosHIK97OpenAlexW2063813235WikidataQ59560844 ScholiaQ59560844MaRDI QIDQ1365054

Peter L. Hammer, Toshihide Ibaraki, Endre Boros, Alexander Kogan

Publication date: 28 August 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02614316

zbMATH Keywords

data analysisset coveringmachine learningpolynomial time algorithmsbinarizationlogical analysis of datapartially defined Boolean functionsmontonicitythresholdness

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Theory of data (68P99)

Related Items (56)

Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints ⋮ Graph, clique and facet of Boolean logical polytope ⋮ A decomposability index in logical analysis of data ⋮ Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis ⋮ Discrete models for data imputation ⋮ Pareto-optimal patterns in logical analysis of data ⋮ A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning ⋮ Logical analysis of data -- the vision of Peter L. Hammer ⋮ Probabilistic optimization via approximate \(p\)-efficient points and bundle methods ⋮ Supervised classification and mathematical optimization ⋮ Logical analysis of numerical data ⋮ Pattern-based feature selection in genomics and proteomics ⋮ Logical analysis of data -- an overview: from combinatorial optimization to medical applications ⋮ A hybrid heuristic for the set covering problem ⋮ Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data ⋮ Strong valid inequalities for Boolean logical pattern generation ⋮ Logical analysis of multiclass data with relaxed patterns ⋮ Pattern definition of the \(p\)-efficiency concept ⋮ Pruning boxes in a box-based classification method ⋮ Supervised box clustering ⋮ Time and space complexity of deterministic and nondeterministic decision trees ⋮ Robust cutpoints in the logical analysis of numerical data ⋮ Variations on extending partially defined Boolean functions with missing bits. ⋮ Totally optimal decision rules ⋮ PEBBL: an object-oriented framework for scalable parallel branch and bound ⋮ Modeling country risk ratings using partial orders ⋮ Recent advances in the theory and practice of logical analysis of data ⋮ Logical analysis of data: classification with justification ⋮ Optimization for simulation: LAD accelerator ⋮ A hybrid classifier based on boxes and nearest neighbors ⋮ Logical analysis of data as a tool for the analysis of probabilistic discrete choice behavior ⋮ Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches ⋮ An estimation algorithm using distance clustering of data. ⋮ On Pareto-optimal Boolean logical patterns for numerical data ⋮ A fractional stochastic integer programming problem for reliability-to-stability ratio in forest harvesting ⋮ Biclustering in data mining ⋮ Comprehensive vs. comprehensible classifiers in logical analysis of data ⋮ Multi-group support vector machines with measurement costs: A biobjective approach ⋮ Reformulation of the support set selection problem in the logical analysis of data ⋮ A new imputation method for incomplete binary data ⋮ Spanned patterns for the logical analysis of data ⋮ Accelerated algorithm for pattern detection in logical analysis of data ⋮ Subset-conjunctive rules for breast cancer diagnosis ⋮ A 3-flip neighborhood local search for the set covering problem ⋮ A mixed-integer programming approach to multi-class data classification problem ⋮ Analysis of a multi-category classifier ⋮ Compact MILP models for optimal and Pareto-optimal LAD patterns ⋮ A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation ⋮ \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation ⋮ Efficient feature selection for logical analysis of large-scale multi-class datasets ⋮ An Improved Branch-and-Bound Method for Maximum Monomial Agreement ⋮ Using a similarity measure for credible classification ⋮ MILP approach to pattern generation in logical analysis of data ⋮ Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities ⋮ Carpal tunnel syndrome automatic classification: electromyography vs. ultrasound imaging ⋮ Probabilistic modeling of multiperiod service levels

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inferring decision trees using the minimum description length principle
• Structure identification in relational data
• Logical analysis of numerical data
• Error-free and best-fit extensions of partially defined Boolean functions
• Decomposability of partially defined Boolean functions
• On connected Boolean functions
• Complexity of identification and dualization of positive Boolean functions
• A theory of the learnable
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study

This page was built for publication: Logical analysis of numerical data