Abstract
The aim of the present article is to obtain a theoretical result essential for applications of combinatorial semigroups for the design of multiple classification systems in data mining. We consider a novel construction of multiple classification systems, or classifiers, combining several binary classifiers. The construction is based on combinatorial Rees matrix semigroups without any restrictions on the sandwich-matrix. Our main theorem gives a complete description of all optimal classifiers in this novel construction.
Original language | English |
---|---|
Pages (from-to) | 242-251 |
Number of pages | 10 |
Journal | Semigroup Forum |
Volume | 82 |
Issue number | 2 |
DOIs | |
Publication status | Published - Apr 2011 |
Externally published | Yes |
Keywords
- Combinatorial semigroups
- Data mining