- Title
- An efficient algorithm for the incremental construction of a piecewise linear classifier
- Creator
- Bagirov, Adil; Ugon, Julien; Webb, Dean
- Date
- 2011
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/57090
- Identifier
- vital:3928
- Identifier
-
https://doi.org/10.1016/j.is.2010.12.002
- Identifier
- ISSN:0306-4379
- Abstract
- In this paper the problem of finding piecewise linear boundaries between sets is considered and is applied for solving supervised data classification problems. An algorithm for the computation of piecewise linear boundaries, consisting of two main steps, is proposed. In the first step sets are approximated by hyperboxes to find so-called "indeterminate" regions between sets. In the second step sets are separated inside these "indeterminate" regions by piecewise linear functions. These functions are computed incrementally starting with a linear function. Results of numerical experiments are reported. These results demonstrate that the new algorithm requires a reasonable training time and it produces consistently good test set accuracy on most data sets comparing with mainstream classifiers. © 2010 Elsevier B.V. All rights reserved.
- Relation
- Information Systems Vol. 36, no. 4 (2011), p. 782-790; http://purl.org/au-research/grants/arc/DP0666061
- Rights
- Copyright Pergamon Press
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0806 Information Systems; Artificial intelligence; Data classification; Data mining; Knowledge-based systems; Supervised learning
- Reviewed
- Hits: 2204
- Visitors: 2139
- Downloads: 2
| Thumbnail | File | Description | Size | Format |
|---|