Latent coincidence analysis: A hidden variable model for distance metric learning

Advances in Neural Information Processing Systems

Volumn 4, Issue , 2012, Pages 3230-3238

  Der, Matthew ^a   Saul, Lawrence K ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COINCIDENCE ANALYSIS; DIMENSIONALITY REDUCTION; DISTANCE METRIC LEARNING; EXPECTATION-MAXIMIZATION ALGORITHMS; HIDDEN VARIABLE MODELS; HIGH DIMENSIONAL DATA; LATENT VARIABLE MODELS; POSTERIOR DISTRIBUTIONS;

ALGORITHMS; INFERENCE ENGINES; ITERATIVE METHODS; PARAMETER ESTIMATION;

EQUIVALENCE CLASSES;

EID: 84877760772     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. D. B. Rubin and D. T. Thayer. EM algorithms for ML factor analysis. Psychometrika, 47:69-76, 1982.
2. G. McLachlan and K. Basford. Mixture Models: Inference and Applications to Clustering. Marcel Dekker, 1988.
3. T. Cover and P. Hart. Nearest neighbor pattern classification. In IEEE Transactions in Information Theory, IT-13, pages 21-27, 1967.
4. J. Goldberger, S. Roweis, G. Hinton, and R. Salakhutdinov. Neighbourhood components analysis. In L. K. Saul, Y. Weiss, and L. Bottou, editors, Advances in Neural Information Processing Systems 17, pages 513-520, Cambridge, MA, 2005. MIT Press.
5. K.Q. Weinberger and L.K. Saul. Distance metric learning for large margin nearest neighbor classification. The Journal of Machine Learning Research, 10:207-244, 2009.
6. J. V. Davis, B. Kulis, P. Jain, S. Sra, and I. S. Dhillon. Information-theoretic metric learning. In ICML, pages 209-216, Corvalis, Oregon, USA, June 2007.
7. G. Hinton and S. Roweis. Stochastic neighbor embedding. In S. Thrun S. Becker and K. Ober- mayer, editors, Advances in Neural Information Processing Systems 15, pages 833-840. MIT Press, Cambridge, MA, 2003.
8. C. Cortes and V. Vapnik. Support-vector networks. Machine Learning, 20:273-297, 1995.
9. B. Kulis, M. A. Sustik, and I. S. Dhillon. Learning low-rank kernel matrices. In Proceedings of the Twenty-Third International Conference on Machine Learning (ICML-06), 2006.
10. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B, 39:1-37, 1977.
11. http://yann.lecun.com/exdb/mnist/.
12. http://mlg.ucd.ie/datasets/bbc.html.
13. http://www.dataminingresearch.com/index.php/2010/09/classic3-classic4- datasets/.
14. http://archive.ics.uci.edu/ml/datasets.html.
15. R A Fisher. The use of multiple measurements in taxonomic problems. Annals of Eugenics, 7(2):179-188, 1936.
16. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
17. R. Salakhutdinov, S. T. Roweis, and Z. Ghahramani. On the convergence of bound optimization algorithms. In Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI-03), pages 509-516, 2003.
18. S. Shalev-Shwartz, Y. Singer, and A. Y. Ng. Online and batch learning of pseudo-metrics. In Proceedings of the Twenty First International Conference on Machine Learning (ICML-04), pages 94-101, Banff, Canada, 2004.
19. T. Jaakkola and M. Jordan. A variational approach to bayesian logistic regression models and their extensions. In Proceedings of the Sixth International Workshop on Artificial Intelligence and Statistics, 1997.
20. M. Dredze, K. Crammer, and F. Pereira. Confidence-weighted linear classification. In Andrew McCallum and Sam Roweis, editors, Proceedings of the 25th Annual International Conference on Machine Learning (ICML 2008), pages 264-271. Omnipress, 2008.
21. G. Chechik, U. Shalit, V. Sharma, and S. Bengio. An online algorithm for large scale image similarity learning. In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, editors, Advances in Neural Information Processing Systems 22, pages 306-314. 2009.