Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis (Q1885808)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2115222
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis |
scientific article; zbMATH DE number 2115222 |
Statements
Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis (English)
0 references
12 November 2004
0 references
Machine learning
0 references
Feature generation
0 references
Binary optimization
0 references
0.722362756729126
0 references
0.7222602367401123
0 references
0.7100238800048828
0 references
0.7096734642982483
0 references
