On Stochastic Complexity and Admissible Models for Neural Network Classifiers
暂无分享,去创建一个
[1] Padhraic Smyth. Admissible stochastic complexity models for classification problems , 1992 .
[2] Jorma Rissanen,et al. Universal coding, information, prediction, and estimation , 1984, IEEE Trans. Inf. Theory.
[3] Andrew R. Barron,et al. Minimum complexity density estimation , 1991, IEEE Trans. Inf. Theory.
[4] O. Mangasarian,et al. Multisurface method of pattern separation for medical diagnosis applied to breast cytology. , 1990, Proceedings of the National Academy of Sciences of the United States of America.
[5] A. Barron,et al. Statistical properties of artificial neural networks , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.
[6] George Cybenko,et al. Complexity Theory of Neural Networks and Classification Problems , 1990, EURASIP Workshop.
[7] John S. Bridle,et al. Training Stochastic Model Recognition Algorithms as Networks can Lead to Maximum Mutual Information Estimation of Parameters , 1989, NIPS.
[8] Padhraic Smyth,et al. A Rule-Based Approach to Neural Network Classifiers , 1990 .
[9] A. Rosenfeld. Image pattern recognition , 1981, Proceedings of the IEEE.
[10] C. S. Wallace,et al. Estimation and Inference by Compact Coding , 1987 .