Ślęzak, D., & Stawicki, S. (2020). The Problem of Finding the Simplest Classifier Ensemble is NP-Hard – A Rough-Set-Inspired Formulation Based on Decision Bireducts. Rough Sets.
Styl ChicagoŚlęzak, Dominik, a Sebastian Stawicki. "The Problem of Finding the Simplest Classifier Ensemble Is NP-Hard – A Rough-Set-Inspired Formulation Based On Decision Bireducts." Rough Sets 2020.
Citace podle MLAŚlęzak, Dominik, a Sebastian Stawicki. "The Problem of Finding the Simplest Classifier Ensemble Is NP-Hard – A Rough-Set-Inspired Formulation Based On Decision Bireducts." Rough Sets 2020.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..