Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis (Q1885808): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:06, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis |
scientific article |
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
