Learning sparse metrics via linear programming

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn 2006, Issue , 2006, Pages 367-373

  Rosales, Rómer ^a   Fung, Glenn ^a  

^a SIEMENS CORPORATE RESEARCH   (United States)

Author keywords

Convex optimization; Dimensionality reduction; Linear programming; Linear projections; Metric learning; Relative distance constraints

Indexed keywords

CONFORMAL MAPPING; FUNCTION EVALUATION; LINEAR PROGRAMMING; OBJECT RECOGNITION; OPTIMIZATION; PROBLEM SOLVING;

CONVEX OPTIMIZATION; DIMENSIONALITY REDUCTION; LINEAR PROJECTIONS; METRIC LEARNING; RELATIVE DISTANCE CONSTRAINTS;

LEARNING SYSTEMS;

EID: 33749562338     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1150402.1150444     Document Type: Conference Paper

References (18)

1. V. Athitsos, J. Alon, S. Sclaroff, and G. Kollios. Boostmap: A method for efficient approximate similarity rankings. In Computer Vision and Pattern Recognition, 2004.
2. K. P. Bennett, A. Demiriz, and J. Shawe-Taylor. A column generation algorithm for boosting. In Proc. 17th International Conf. on Machine Learning, pages 65-72. Morgan Kaufmann, San Francisco, CA, 2000.
3. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam's razor. Information Processing Letters, 24:377-380, 1987.
4. P. S. Bradley and O. L. Mangasarian. Feature selection via concave minimization and support vector machines. In J. Shavlik, editor, Machine Learning Proceedings of the Fifteenth International Conference(ICML '98), pages 82-90, San Francisco, California, 1998. Morgan Kaufmann. ftp://ftp.cs.wisc.edu/ math-prog/tech-reports/9803.ps.
5. T. Cox and M. Cox. Multidimensional Scaling. Chapman & Hall, London, 1994.
6. C. Faloutsos and K. Lin. Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. ACM SIGMOD, pages 163-174, 1995.
7. G. Fung, O. L. Mangasarian, and A. Smola. Minimal kernel classifiers. Journal of Machine Learning Research, pages 303-321, 2002. University of Wisconsin Data Mining Institute Technical Report 00-08, November 200, ftp://ftp.cs.wisc.edu/pub/dini/tech-reports/00-08.ps.
8. G. H. Golub and C. F. Van Loan. Matrix Computations. The John Hopkins University Press, Baltimore, Maryland, 3rd edition, 1996.
9. I. Jolliffe. Principal Component Analysis. Springer-Verlag, New York, 1989.
10. K.Wagstaff, C. Cardie, S. Rogers, and S. Schroedl. Constrained k-means clustering with background knowledge. In International Conference on Machine Learning, 2001.
11. S. Roweis and L. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290:2323-2326, 2000.
12. M. Schultz and T. Joachims. Learning a distance metric from relative comparisons. In Advances in Neural Information Processing Systems, 2003.
13. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, 2000.
14. K. C. Toh, M. J. Todd, and R. Tutuncu. SDPT3 - a Matlab software package for semidefinite programming. Optimization Methods and Software, 11:545-581, 1999.
15. W.Cohen, R.Schapire, and Y. Singer. Learning to order things. In Advances in Neural Information Processing Systems 10, 1998.
16. K. Weinberger, J. Blitzer, and L. Saul. Distance metric learning for large margin nearest neighbor classification. In Advances m Neural Information Processing Systems 18, 2006.
17. K. Q. Weinberger, B. D. Packer, and L. K. Saul. Unsupervised learning of image manifolds by semidefinite programming. In Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, Barbados, January 2005.
18. E. Xing, A. Ng, M. Jordan, and S. Russell. Distance metric learning, with application to clustering with side information. In Advances in Neural Information Processing Systems, 2002.