Semantic hashing

A. Andoni, P. Indyk, Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions, in: FOCS, IEEE Computer Society, 2006, pp. 459–468.

Bengio, 2007, Scaling learning algorithms towards AI, Large-Scale Kernel Machines, 10.7551/mitpress/7496.003.0016

Blei, 2003, Latent Dirichlet allocation, Journal of Machine Learning Research, 3, 993

S. Chopra, R. Hadsell, Y. LeCun, Learning a similarity metric discriminatively, with application to face verification, in: IEEE Computer Vision and Pattern Recognition or CVPR, 2005, pp. 539–546.

Datar, Immorlica, Indyk, Mirrokni, Locality-Sensitive Hashing scheme based on p-stable distributions, in: COMPGEOM: Annual ACM Symposium on Computational Geometry, 2004.

Deerwester, 1990, Indexing by latent semantic analysis, Journal of the American Society of Information Science, 41, 391, 10.1002/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9

J.H. Friedman, J.L. Bentley, R.A. Finkel, An algorithm for finding best matches in logarithmic time, Technical Report 75-482, Stanford CS, 1975.

P. Gehler, A. Holub, M. Welling, The rate adapting poisson (RAP) model for information retrieval and object recognition, in: Proceedings of the 23rd International Conference on Machine Learning, 2006.

Hinton, 2002, Training products of experts by minimizing contrastive divergence, Neural Computation, 14, 1711, 10.1162/089976602760128018

Hinton, 2006, A fast learning algorithm for deep belief nets, Neural Computation, 18, 1527, 10.1162/neco.2006.18.7.1527

Hinton, 2002, Stochastic neighbor embedding, 833

Hinton, 2006, Reducing the dimensionality of data with neural networks, Science, 313, 504, 10.1126/science.1127647

T. Hofmann, Probabilistic latent semantic analysis, in: Proceedings of the 15th Conference on Uncertainty in AI, Morgan Kaufmann, San Fransisco, California, 1999, pp. 289–296.

Lewis, 2004, RCV1: a new benchmark collection for text categorization research, Journal of Machine Learning Research, 5, 361

Liu, 2004, An investigation of practical approximate nearest neighbor algorithms, Advances in Neural Information Processing Systems

Neal, 1998, A view of the EM algorithm that justifies incremental, sparse and other variants, 355

Salakhutdinov, 2007, Learning a nonlinear embedding by preserving class neighbourhood structure, AI and Statistics

Salton, 1991, Developments in automatic text retrieval, Science, 253

Salton, 1988, Term-weighting approaches in automatic text retrieval, Information Processing and Management, 24, 513, 10.1016/0306-4573(88)90021-0

A. Torralba, R. Fergus, Y. Weiss, Small codes and large image databases for recognition, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2008.

Welling, 2005, Exponential family harmoniums with an application to information retrieval, 1481

E. Xing, R. Yan, A.G. Hauptmann, Mining associated text and images with dual-wing harmoniums, in: Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (UAI-2005), 2005.