- Title
- Classification systems based on combinatorial semigroups
- Creator
- Abawajy, Jemal; Kelarev, Andrei
- Date
- 2013
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/72350
- Identifier
- vital:6884
- Identifier
-
https://doi.org/10.1007/s00233-012-9454-7
- Identifier
- ISSN:0037-1912
- Abstract
- The present article continues the investigation of constructions essential for applications of combinatorial semigroups to the design of multiple classification systems in data mining. Our main theorem gives a complete description of all optimal classification systems defined by one-sided ideals in a construction based on combinatorial Rees matrix semigroups. It strengthens and generalizes previous results, which handled the more narrow case of two-sided ideals.
- Relation
- Semigroup forum Vol. 86, no. 3 (2013), p. 603-612
- Rights
- Copyright Springer
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; Classification systems; Combinatorial semigroups; Data mining
- Reviewed
- Hits: 2176
- Visitors: 2133
- Downloads: 0