Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis

DOI10.1016/J.DAM.2004.06.006MaRDI QIDQ1885808zbMATH OpenOpenAlexFDO

Authors Endre Boros, Vladimir Menkov

Publication date 12 November 2004

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2004.06.006

zbMATH Keywords

Binary optimizationFeature generationMachine learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Boolean programming (90C09) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1303636
• Logical analysis of numerical data
• Approximation algorithms for discrete polynomial optimization
• On the complexity of some data analysis problems
• Dualization, decision lists and identification of monotone discrete functions

Cites work

• A formalism for relevance and its application in feature subset selection
• Boolean query optimization and the 0-1 hyperbolic sum problem
• Discrete-variable extremum problems
• Feature Selection via Mathematical Programming
• Finding essential attributes from binary data
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 4056803 (Why is no real title available?)
• scientific article; zbMATH DE number 1131222 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• Logical analysis of numerical data
• Occam's razor
• Pseudo-Boolean optimization
• Selection of relevant features and examples in machine learning

Cited in

(3)

• A discrete optimization method based on a parameterization of a Grassmannian in multidimensional dichotomous data structuring
• Supervised box clustering
• Retracted article: Discrete optimization method based on Grassmannian parameterization in multidimensional dichotomic data structuring

Describes a project that uses

Uses Software

• UCI

This page was built for publication: Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885808)