Computation of Concave Piecewise Linear Discriminant Functions Using Chebyshev Polynomials

In two-class pattern classification problems, the use of piecewise linear discriminant functions (PLDF´s) is often encountered. Following a consideration of the relative advantages of a PLDF above an optimal¿high degree¿discriminant function, a new procedure to compute a concave PLDF is presented. The characteristic property of this procedure is that the number of linear functions necessary for adequate results of the PLDF is determined adaptively during the procedure. The linear functions are computed with Chebyshev polynominals.