Efficiently learning a distance metric for large margin nearest neighbor classification

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2011, Pages 453-458

  Park, Kyoungup ^a,c   Shen, Chunhua ^a,b   Hao, Zhihui ^d   Kim, Junae ^a,c  

^a CSIRO   (Australia)

^b UNIVERSITY OF ADELAIDE   (Australia)

^c AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^d BEIJING INSTITUTE OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING PROJECTION METHOD; CLASSIFICATION FRAMEWORK; COLUMN GENERATION; COMPUTATION COMPLEXITY; DISTANCE METRICS; EIGEN DECOMPOSITION; EIGEN-VALUE; INPUT DATAS; INTERIOR-POINT METHOD; MAHALANOBIS DISTANCES; NEAREST NEIGHBOR CLASSIFICATION; NEAREST NEIGHBORS; OPTIMIZATION PROBLEMS; SEMIDEFINITENESS;

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; INPUT OUTPUT PROGRAMS; OPTIMIZATION;

ARTIFICIAL INTELLIGENCE;

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

References (12)

1. Bottou, L., and Bousquet, O. 2008. The tradeoffs of large scale learning. In Platt, J.; Koller, D.; Singer, Y.; and Roweis, S., eds., Advances in Neural Information Processing Systems 20, 161-168. Cambridge, MA: MIT Press.
2. Boyd, S., and Vandenberghe, L. 2004. Convex Optimization. Cambridge University Press.
3. Cristianini, N., and Shawe-Taylor, J. 2000. An Introduction to Support Vector Machines. Cambridge University Press.
4. Globerson, A., and Roweis, S. 2005. Metric learning by collapsing classes. In Proc. Adv. Neural Inf. Process. Syst.
5. Goldberger, J.; Roweis, S.; Hinton, G.; and Salakhutdinov, R. 2004. Neighbourhood component analysis. In Proc. Adv. Neural Inf. Process. Syst. MIT Press.
6. Lübbecke, M. E., and Desrosiers, J. 2005. Selected topics in column generation. Operation Res. 53(6):1007-1023. (Pubitemid 43061815)
7. Schapire, R. E. 1999. Theoretical views of boosting and applications. In Proc. Int. Conf. Algorithmic Learn. Theory, 13-25. London, UK: Springer-Verlag.
8. Shalev-Shwartz, S., and Srebro, N. 2008. Svm optimization: Inverse dependence on training set size. In Proceedings of the 25th International Conference on Machine Learning, 928-935.
9. Shen, C.; Kim, J.; Wang, L.; and van den Hengel, A. 2009. Positive semidefinite metric learning with boosting. In Bengio, Y.; Schuurmans, D.; Lafferty, J.; Williams, C.; and Culotta, A., eds., Proc. Adv. Neural Inf. Process. Syst., 1651-1659. Vancouver, B.C., Canada: MIT Press.
10. Shen, C.; Welsh, A.; and Wang, L. 2008. PSDBoost: Matrix-generation linear programming for positive semidefinite matrices learning. In Koller, D.; Schuurmans, D.; Bengio, Y.; and Bottou, L., eds., Proc. Adv. Neural Inf. Process. Syst., 1473-1480. Vancouver, B.C., Canada: MIT Press.
11. Weinberger, K. Q.; Blitzer, J.; and Saul, L. K. 2005. Distance metric learning for large margin nearest neighbor classification. In Proc. Adv. Neural Inf. Process. Syst., 1473-1480.
12. Xing, E.; Ng, A.; Jordan, M.; and Russell, S. 2002. Distance metric learning, with application to clustering with side-information. In Proc. Adv. Neural Inf. Process. Syst. MIT Press.