Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis (Q1885808): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2004.06.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2004.06.006 / rank | |||
Normal rank | |||
Latest revision as of 11:45, 16 December 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
