Abstract
A piecewise linear function is represented in terms of a set of linear functions through the use of the maximum and minimum functions. A procedure for finding piecewise linear discriminant functions for pattern recognition is described. The procedure iteratively uses the accelerated relaxation method to find every linear function in a piecewise linear function. The procedure was implemented by a Fortran program. Experimental results with the program showed that the procedure is promising for obtaining piecewise linear discriminant functions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
