"The Problem of Finding the Simplest Classifier Ensemble is NP-Hard - A ..."

Dominik Slezak, Sebastian Stawicki (2020)

> Home

Details and statistics

DOI: 10.1007/978-3-030-52705-1_15

access: closed

type: Conference or Workshop Paper

metadata version: 2021-07-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/rskt/SlezakS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rskt/SlezakS20
Dominik Slezak, Sebastian Stawicki:
The Problem of Finding the Simplest Classifier Ensemble is NP-Hard - A Rough-Set-Inspired Formulation Based on Decision Bireducts. IJCRS 2020: 204-212

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.