Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis (Q1885808): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2004.06.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011015448 / rank | |||
Normal rank | |||
Revision as of 22:38, 19 March 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
