An Adaptive Procedure for Multiclass Pattern Classification
暂无分享,去创建一个
Abstract—A more general adaptive procedure for determining linear or piecewise linear discriminant functions for multiclass pattern classification is proposed. The adaptive procedure is a many-pattern or group-pattern adaptation. The training sequence consists of groups of vectors in matrix form instead of single vectors. The convergence proof shows that this procedure terminates in a finite number of adaptions if the solution exists. A necessary and suffcient condition is developed for testing the linear separability of each subset of (d + 1) samples. Furthermore, the proposed procedure can be implemented with the addition of only a little complexity to existing systems. Computer simulations indecate satisfactory results.
[1] J. B. Rosen. Pattern separation by convex programming , 1965 .
[2] R. L. Kashyap,et al. An Algorithm for Linear Inequalities and its Applications , 1965, IEEE Trans. Electron. Comput..
[3] Albert B Novikoff,et al. ON CONVERGENCE PROOFS FOR PERCEPTRONS , 1963 .
[4] Richard O. Duda,et al. Pattern Classification by Iteratively Determined Linear and Piecewise Linear Discriminant Functions , 1966, IEEE Trans. Electron. Comput..