Cargando…
The Problem of Finding the Simplest Classifier Ensemble is NP-Hard – A Rough-Set-Inspired Formulation Based on Decision Bireducts
We investigate decision bireducts which extend the notion of a decision reduct developed in the theory of rough sets. For a decision table [Formula: see text], a decision bireduct is a pair (X, B), where [Formula: see text] is a subset of attributes which allows to distinguish between all pairs of o...
Autores principales: | Ślęzak, Dominik, Stawicki, Sebastian |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7338167/ http://dx.doi.org/10.1007/978-3-030-52705-1_15 |
Ejemplares similares
-
Towards a Classification of Rough Set Bireducts
por: Benítez-Caballero, M. José, et al.
Publicado: (2020) -
Domino: the simplest way to inspire change
por: Tasler, Nick
Publicado: (2015) -
The simplest method to classify CAM lesions
por: Plastow, Ricci, et al.
Publicado: (2016) -
Complexity of the simplest species tree problem
por: Zhu, Tianqi, et al.
Publicado: (2021) -
De Bruijn Superwalk with Multiplicities Problem is NP-hard
por: Kapun, Evgeny, et al.
Publicado: (2013)