Computation of Concave Piecewise Linear Discriminant Functions Using Chebyshev Polynomials

Authors:
Chris E. Van Haersma Buma;Robert P. W. Duin
Affiliations:
Department of Applied Physics, Delft University of Technology, Delft, The Netherlands./ Physics Laboratories, Dutch Defense Research Organization RVO-TNO, The Hague, The Netherland;Department of Applied Physics, Delft University of Technology, Delft, The Netherlands.
Venue:
IEEE Transactions on Computers
Year:
1976

Citing 2
Cited 1

Pattern recognition using chebychev polynomial discriminant functions

Pattern recognition using chebychev polynomial discriminant functions
Pattern Recognition by Piecewise Linear Discriminant Functions

IEEE Transactions on Computers

Recent Developments in Pattern Recognition

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

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.