The problem of finding the simplest classifier ensemble is NP-hard -- a rough-set-inspired formulation based on decision bireducts (Q2096566)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The problem of finding the simplest classifier ensemble is NP-hard -- a rough-set-inspired formulation based on decision bireducts |
scientific article; zbMATH DE number 7614604
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The problem of finding the simplest classifier ensemble is NP-hard -- a rough-set-inspired formulation based on decision bireducts |
scientific article; zbMATH DE number 7614604 |
Statements
The problem of finding the simplest classifier ensemble is NP-hard -- a rough-set-inspired formulation based on decision bireducts (English)
0 references
9 November 2022
0 references
decision bireducts
0 references
classifier ensembles
0 references
rule-based classifiers
0 references
decision model simplification
0 references
NP-hardness
0 references
