Feature selection and kernel design via linear programming

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 786-791

  Fung, Glenn ^a   Rosales, Romer ^a   Rao, R Bharat ^a  

^a SIEMENS CORPORATE RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BASELINE METHODS; CONVEX PROBLEMS; KERNEL LEARNING; LINEAR PROGRAMMING FORMULATION; OPTIMIZATION PROBLEMS; SEMIDEFINITE PROGRAMS; SIMILARITY FUNCTIONS; STATE OF THE ART;

ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS;

LINEAR PROGRAMMING;

EID: 47849083027     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

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. Bennett, M. Momma, and M. Embrechts. Mark: a boosting algorithm for heterogeneous kernel models. In Proceedings Knowledge Discovery and Data Mining, 2002.
3. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam's razor. Information Processing Letters, 24:377-380, 1987.
4. W. Cohen, R. Schapire, and Y. Singer. Learning to order things. In Advances in Neural Information Processing Systems 10, 1998.
5. N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machines. Cambridge University Press, 2000.
6. G. Fung, M. Dundar, J. Bi, and B. Rao. A fast iterative algorithm for fisher discriminant using heterogeneous kernels. In Proceedings of the twenty-first international conference on Machine learning. ACM Press, 2004.
7. G. H. Golub and C. F. Van Loan. Matrix Computations. The John Hopkins University Press, Baltimore, Maryland, 3rd edition, 1996.
8. T. Graepel. Kernel matrix completion by semidefinite programming. In Proceedings of the International Conference on Neural Networks, ICANN, 2002.
9. G. Lanckriet, N. Cristianini, P. Bartlett, L. El Ghaoui, and M. Jordan. Learning the kernel matrix with semidefinite programming. Journal of Machine Learning Research, 5:27-72, 2004.
10. R. Rosales and G. Fung. Learning sparse metrics via linear programming. In Proceedings Knowledge Discovery and Data Mining, 2006.
11. M. Schultz and T. Joachims. Learning a distance metric from relative comparisons. In Advances in Neural Information Processing Systems, 2003.
12. K. Wagstaff, C. Cardie, S. Rogers, and S. Schroedl. Constrained k-means clustering with background knowledge. In International Conference on Machine Learning, 2001.
13. K. Weinberger, F. Sha, and L. Saul. Learning a kernel matrix for nonlinear dimensionality reduction. In Proceedings of the Twenty First International Confernence on Machine Learning, 2004.
14. E.P. Xing, A.Y. Ng, M.I. Jordan, and S. Russell. Distance metric learning, with application to clustering with side information. In Advances in Neural Information Processing Systems, 2002.