- Title
- A polynomial ring construction for the classification of data
- Creator
- Kelarev, Andrei; Yearwood, John; Vamplew, Peter
- Date
- 2009
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/65763
- Identifier
- vital:2108
- Identifier
-
https://doi.org/10.1017/s0004972708001111
- Identifier
- ISSN:0004-9727
- Abstract
- Drensky and Lakatos (Lecture Notes in Computer Science, 357 (Springer, Berlin, 1989), pp. 181-188) have established a convenient property of certain ideals in polynomial quotient rings, which can now be used to determine error-correcting capabilities of combined multiple classifiers following a standard approach explained in the well-known monograph by Witten and Frank (Data Mining: Practical Machine Learning Tools and Techniques (Elsevier, Amsterdam, 2005)). We strengthen and generalise the result of Drensky and Lakatos by demonstrating that the corresponding nice property remains valid in a much larger variety of constructions and applies to more general types of ideals. Examples show that our theorems do not extend to larger classes of ring constructions and cannot be simplified or generalised.
- Relation
- Bulletin of the Australian Mathematical Society Vol. 79, no. 2 (2009), p. 213-225
- Rights
- Copyright Cambridge University Press
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- Ring constructions; Group rings; Classification
- Full Text
- Reviewed
- Hits: 1959
- Visitors: 2262
- Downloads: 294
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Accepted version | 261 KB | Adobe Acrobat PDF | View Details Download |