The problem of finding the simplest classifier ensemble is NP-hard -- a rough-set-inspired formulation based on decision bireducts

DOI10.1007/978-3-030-52705-1_15OpenAlexW3041351030MaRDI QIDQ2096566

Dominik Ślęzak, Sebastian Stawicki

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-52705-1_15

zbMATH Keywords

NP-hardnessrule-based classifiersclassifier ensemblesdecision bireductsdecision model simplification

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Partially-defined equivalence relations: relationship with orthopartitions and connection to rough sets

This page was built for publication: The problem of finding the simplest classifier ensemble is NP-hard -- a rough-set-inspired formulation based on decision bireducts