- 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/61886
- Identifier
- vital:4945
- 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. © 2012 Springer Science+Business Media New York.
- Relation
- Semigroup Forum Vol. 86, no. 3 (2013), p. 603-612
- Rights
- Copyright 2012 Springer Science-Business Media New York
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; Classification systems; Combinatorial semigroups; Data mining
- Full Text
- Reviewed
- Hits: 3035
- Visitors: 3268
- Downloads: 285
Thumbnail | File | Description | Size | Format | |||
---|---|---|---|---|---|---|---|
View Details Download | SOURCE1 | Accepted version | 319 KB | Adobe Acrobat PDF | View Details Download |