An efficient algorithm for the incremental construction of a piecewise linear classifier

Authors:
A. M. Bagirov;J. Ugon;D. Webb
Affiliations:
Centre for Informatics and Applied Optimization, School of Information Technology and Mathematical Sciences, University of Ballarat, Victoria 3353, Australia;Centre for Informatics and Applied Optimization, School of Information Technology and Mathematical Sciences, University of Ballarat, Victoria 3353, Australia;Centre for Informatics and Applied Optimization, School of Information Technology and Mathematical Sciences, University of Ballarat, Victoria 3353, Australia
Venue:
Information Systems
Year:
2011

Citing 11
Cited 0

Comparison of a neural network and a piecewise linear classifier

Pattern Recognition Letters
Design of piecewise linear classifiers from formal neurons by a basis exchange technique

Pattern Recognition
On Piecewise-Linear Classification

IEEE Transactions on Pattern Analysis and Machine Intelligence
The piecewise linear classifier DIPOL92

ECML-94 Proceedings of the European conference on machine learning on Machine Learning
Machine learning, neural and statistical classification

Machine learning, neural and statistical classification
Polyhedral separability through successive LP

Journal of Optimization Theory and Applications
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)

Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
A simple and fast multi-class piecewise linear pattern classifier

Pattern Recognition
Rapid and brief communication: Design efficient support vector machine for fast classification

Pattern Recognition
Locally Trained Piecewise Linear Classifiers

IEEE Transactions on Pattern Analysis and Machine Intelligence
Methods of decreasing the number of support vectors via k-mean clustering

ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.