Performance characterization of K-winner machines
暂无分享,去创建一个
The paper reports on new findings about the properties of K-winner machines (KWMs). The resulting theoretical model is sharply characterized in terms of generalization performance, and exhibits interesting features from an application perspective as well. The major novel aspect lies in connecting analytically the KWM framework to established methods, proposed by Vapnik and Cherkassky, for assessing a classifier's generalization performance.
[1] Sandro Ridella,et al. K-winner machines for pattern classification , 2001, IEEE Trans. Neural Networks.
[2] Teuvo Kohonen,et al. Self-organization and associative memory: 3rd edition , 1989 .
[3] Yann LeCun,et al. Measuring the VC-Dimension of a Learning Machine , 1994, Neural Computation.
[4] William Li,et al. Measuring the VC-Dimension Using Optimized Experimental Design , 2000, Neural Computation.