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

DOI10.1016/j.dam.2004.06.006zbMath1077.68089OpenAlexW2011015448MaRDI QIDQ1885808

Vladimir Menkov, Endre Boros

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

Machine learningBinary optimizationFeature generation

Mathematics Subject Classification ID

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

Related Items (3)

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

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pseudo-Boolean optimization
• Occam's razor
• Selection of relevant features and examples in machine learning
• Boolean query optimization and the 0-1 hyperbolic sum problem
• Logical analysis of numerical data
• Finding essential attributes from binary data
• A formalism for relevance and its application in feature subset selection
• Feature Selection via Mathematical Programming
• Discrete-Variable Extremum Problems

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