Recognizing Handwritten Digits Using Mixtures of Linear Models
暂无分享,去创建一个
[1] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[2] Yann LeCun,et al. Tangent Prop - A Formalism for Specifying Selected Invariances in an Adaptive Network , 1991, NIPS.
[3] Yann LeCun,et al. Efficient Pattern Recognition Using a New Transformation Distance , 1992, NIPS.
[4] Geoffrey E. Hinton,et al. Autoencoders, Minimum Description Length and Helmholtz Free Energy , 1993, NIPS.
[5] Richard S. Zemel,et al. Unsupervised learning of object models , 1993 .
[6] Nanda Kambhatla,et al. Fast Non-Linear Dimension Reduction , 1993, NIPS.
[7] Maurice Milgram,et al. Transformation Invariant Autoassociation with Application to Handwritten Character Recognition , 1994, NIPS.
[8] Patrice Y. Simard,et al. Learning Prototype Models for Tangent Distance , 1994, NIPS.
[9] Jonathan J. Hull,et al. A Database for Handwritten Text Recognition Research , 1994, IEEE Trans. Pattern Anal. Mach. Intell..
[10] R. Zemel. A minimum description length framework for unsupervised learning , 1994 .
[11] Geoffrey E. Hinton,et al. The Helmholtz Machine , 1995, Neural Computation.
[12] Geoffrey E. Hinton,et al. The "wake-sleep" algorithm for unsupervised neural networks. , 1995, Science.