Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
type: Item
instance of: scholarly article
title: Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis
zbMATH Open document ID: 1077.68089
author: Endre Boros
author: Vladimir Menkov
published in: Discrete Applied Mathematics
publication date: 2004-11-12T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2115222
zbMATH Keywords: Machine learning
zbMATH Keywords: Feature generation
zbMATH Keywords: Binary optimization
describes a project that uses: UCI-ml
MaRDI profile type: Publication
full work available at URL: j.dam.2004.06.006
OpenAlex ID: W2011015448
cites work: Q3792078
cites work: A formalism for relevance and its application in feature subset selection
cites work: Selection of relevant features and examples in machine learning
cites work: Occam's razor
cites work: Pseudo-Boolean optimization
cites work: Logical analysis of numerical data
cites work: Finding essential attributes from binary data
cites work: Feature Selection via Mathematical Programming
cites work: Q3327527
cites work: Discrete-Variable Extremum Problems
cites work: Q5538300
cites work: Boolean query optimization and the 0-1 hyperbolic sum problem
cites work: Q4382643
DOI: 10.1016/J.DAM.2004.06.006
description: scientific article; zbMATH DE number 2115222