论文信息 - The K1-Map Reduction for Pattern Classifications

The K1-Map Reduction for Pattern Classifications

A shortcut hand-reduction method known as the Karnaugh map (K map) is an efficient way of reducing Boolean functions to a minimum form for the purpose of minimizing hardware requirements. In this paper, by applying the prime group and the essential prime group concepts of the K maps to pattern classification problems, the K1-map reduction method is proposed. The K1-map reduction method can be used to design restricted Coulomb energy networks and to determine the number of hidden units problems in a systematic manner.

Sheng-De Wang | Tsong-Chih Hsu

[1] Shang-Liang Chen,et al. Orthogonal least squares learning algorithm for radial basis function networks , 1991, IEEE Trans. Neural Networks.

[2] Sukhan Lee,et al. A Gaussian potential function network with hierarchically self-organizing learning , 1991, Neural Networks.

[3] Mohamad T. Musavi,et al. On the training of radial basis function classifiers , 1992, Neural Networks.

[4] Christian Lebiere,et al. The Cascade-Correlation Learning Architecture , 1989, NIPS.

[5] M. J. Hudak. RCE classifiers: theory and practice , 1992 .

[6] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[7] Bruce G. Batchelor,et al. Practical approach to pattern classification , 1974 .

[8] Mohamad Musavi,et al. Improving the performance of probabilistic neural networks , 1992, [Proceedings 1992] IJCNN International Joint Conference on Neural Networks.

[9] Bruce A. Whitehead,et al. Evolving space-filling curves to distribute radial basis functions over an input space , 1994, IEEE Trans. Neural Networks.

[10] F. Girosi,et al. Networks for approximation and learning , 1990, Proc. IEEE.

[11] Leon N. Cooper,et al. Pattern Class Degeneracy in an Unrestricted Storage Density Memory , 1987, NIPS.

[12] Steven J. Nowlan,et al. Maximum Likelihood Competitive Learning , 1989, NIPS.