Learning a nonlinear embedding by preserving class neighbourhood structure

Journal of Machine Learning Research

Volumn 2, Issue , 2007, Pages 412-419

  Salakhutdinov, Ruslan ^a   Hinton, Geoffrey ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR RATE; FEATURE SPACE; HANDWRITTEN DIGIT RECOGNITION; INPUT SPACE; K-NEAREST NEIGHBOURS; NEAREST NEIGHBOR CLASSIFICATION; NEIGHBOURHOOD; NON-LINEAR TRANSFORMATIONS; NONLINEAR EMBEDDING; UNLABELED DATA;

ARTIFICIAL INTELLIGENCE; CHARACTER RECOGNITION; MULTILAYER NEURAL NETWORKS;

MATHEMATICAL TRANSFORMATIONS;

EID: 80455158726     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (21)

1. Aharon Bar-Hillel, Tomer Hertz, Noam Shental, and DaphnaWeinshall. Learning distance functions using equivalence relations. In ICML, pages 11-18. AAAI Press, 2003.
2. S. Becker and G. E. Hinton. A self-organizing neural network that discovers surfaces in random-dot stereograms. Nature, 355(6356):161-163, 1992.
3. S. Chopra, R. Hadsell, and Y. LeCun. Learning a similarity metric discriminatively, with application to face verification. In IEEE Computer Vision and Pattern Recognition or CVPR, pages I: 539-546, 2005.
4. T. M. Cover and P. E. Hart. Nearest neighbor pattern classification. IEEE Transactions on Information Theory, IT13(1):21-7, January 1967.
5. D. Decoste and B. Schölkopf. Training invariant support vector machines. Machine Learning, 46(1/3):161, 2002.
6. Y. Freund and D. Haussler. Unsupervised learning of distributions on binary vectors using two layer networks. In Advances in Neural Information Processing Systems 4, pages 912-919, San Mateo, CA., 1992. Morgan Kaufmann.
7. K. Fukumizu, F. R. Bach, and M. I. Jordan. Dimensionality reduction for supervised learning with reproducing kernel hilbert spaces. Journal of Machine Learning Research, 5:73-99, 2004.
8. A. Globerson and S. T. Roweis. Metric learning by collapsing classes. In NIPS, 2005.
9. J. Goldberger, S. T. Roweis, G. E. Hinton, and Ruslan Salakhutdinov. Neighbourhood components analysis. In NIPS, 2004.
10. Tomer Hertz, Aharon Bar-Hillel, and Daphna Weinshall. Boosting margin based distance functions for clustering. In ICML, 2004.
11. G. E. Hinton. Training products of experts by minimizing contrastive divergence. Neural Computation, 14(8):1711-1800, 2002.
12. G. E. Hinton, S. Osindero, and Y. W. Teh. A fast learning algorithm for deep belief nets. Neural Computation, 18, 2006.
13. G. E. Hinton and S. T. Roweis. Stochastic neighbor embedding. In NIPS, pages 833-840. MIT Press, 2002.
14. G. E. Hinton and R. R. Salakhutdinov. Reducing the dimensionality of data with neural networks. Science, 313(5786):504-507, July 2006.
15. The MNIST dataset is available at http://yann.lecun.com/exdb/mnist/index. html.
16. P. Smolensky. Information processing in dynamical systems: Foundations of harmony theory. In Parallel Distributed Processing: Volume 1: Foundations, pages 194- 281. MIT Press, Cambridge, 1986.
17. J. V. Stone and N. Harper. Temporal constraints on visual learing: a computational model. Perception, 28:1089-1104, 2002.
18. K. Q.Weinberger, J. Blitzer, and L. K. Saul. Distance metric learning for large margin nearest neighbor classification. In NIPS, 2005.
19. M. Welling, M. Rosen-Zvi, and G. E. Hinton. Exponential family harmoniums with an application to information retrieval. In NIPS 17, pages 1481-1488, Cambridge, MA, 2005. MIT Press.
20. Eric P. Xing, Andrew Y. Ng, Michael I. Jordan, and Stuart J. Russell. Distance metric learning with application to clustering with side-information. In NIPS, pages 505-512. MIT Press, 2002.
21. R. S. Zemel and G. E. Hinton. Discovering and using the single viewpoint constraint. In NIPS 3, San Mateo, CA, 1991