Hierarchical distance metric learning for large margin nearest neighbor classification

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 25, Issue 7, 2011, Pages 1073-1087

  Sun, Shiliang ^a   Chen, Qiaona ^a  

^a EAST CHINA NORMAL UNIVERSITY   (China)

Author keywords

Distance metric learning; k nearest neighbors classification; large margin

Indexed keywords

CONVEX PROGRAMMING; DATA DISTRIBUTION; DATA POINTS; DIMENSION REDUCTION; DISTANCE METRIC LEARNING; DISTANCE METRICS; HIERARCHICAL STRUCTURES; K-NEAREST NEIGHBORS; KERNEL LEARNING; LARGE MARGIN; NEAREST NEIGHBOR CLASSIFICATION; OVERLAPPING RATIO; REAL WORLD DATA;

PATTERN RECOGNITION; SOFTWARE ENGINEERING;

VIRTUAL REALITY;

EID: 83755186201     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021800141100897X     Document Type: Article

References (20)

1. M. Belkin and P. Niyogi, Laplacian eigenmaps for dimensionality reduction and data representation, Neural Comput. 15(6) (2003) 1373-1396. (Pubitemid 37049796)
2. B. Boser, I. Guyon and V. Vapnik, A training algorithm for optimal margin classifiers, Proc. 5th Ann. ACM Workshop on Computational Learning Theory, Pittsburgh, Pennsylvania (1992), pp. 144-152. (Pubitemid 23615470)
3. S. Boyd and L. Vandenberghe, Convex Optimization (Cambridge University Press, 2004).
4. C. Domeniconi, D. Gunopulos and J. Peng, Large margin nearest neighbor classifiers, IEEE Trans. Neural Networks 16(4) (2005) 899-900.
5. C. Domeniconi, J. Peng and D. Gunopulosi, Locally adaptive metric nearest-neighbor classificaton, IEEE Patt. Anal. Mach. Intell. 24(9) (2002) 1281-1285. (Pubitemid 35242588)
6. R. Duda, P. Hart and D. Stork, Pattern classification (John Wiley and Sons, 2001).
7. J. Friedman, Flexible metric nearest neighbor classification, Technical Report, Stanford University, 1994.
8. J. Goldberger, S. Roweis, G. Hinton and R. Salakhutdinov, Neighbourhood componenets analysis, Adv. Neural Inform. Process. Syst. 17 (2004) 513-520.
9. T. Hastie and R. Tibshirani, Discriminant adaptive nearest neighbor classification, IEEE Patt. Anal. Mach. Intell. 18(6) (1996) 607-616. (Pubitemid 126773896)
10. A. Hillel, T. Hertz, N. Shental and D. Weinshall, Learning a mahalanobis metric from equivalence constraints, J. Mach. Learn. Res. 6 (2005) 937-965.
11. A. Holub, Y. Liu and P. Perona, On constructing facial similarity maps, Proc. Computer Vision and Pattern Recognition, Minneapolis, Minnesota (2007), pp. 1-8.
12. S. Parameswaran and K. Weinberger, Large margin multi-task metric learning, Adv. Neural Inform. Process. Syst. 23 (2011) 1867-1875.
13. J. Peng, D. Heisterkamp and H. Dai, Adaptive kernel metric nearest neighbor classificaton, Proc. 16th Int. Conf. Pattern Recognition (Quebec, Canada, 2002), pp. 33-36. (Pubitemid 44844423)
14. S. Roweis and L. Saul, Nonlinear dimensionality reduction by locally linear embedding, Science 290(5500) (2000) 2323-2326. (Pubitemid 32041578)
15. S. Sun and Q. Chen, Kernel regression with a mahalanobis metric for short-term traffc flow forecasting, Lecture Notes in Computer Science 5326 (2008) 9-16.
16. J. Tenenbaum, V. Silva and J. Langford, A global geometric framework for nonlinear dimensionality reduction, Science 290(5500) (2000) 2319-2323. (Pubitemid 32041577)
17. K. Weinberger, J. Blitzer and L. Saul, Distance metric learning for large margin nearest neighbor classification, Adv. Neural Inform. Process. Syst. 18 (2006) 1473-1480.
18. L. Yang and R. Jin, Distance metric learning: A comprehensive survey, Technical report, Michigan State University, 2006.
19. L. Yang, R. Jin, R. Sukthankar and Y. Liu, An effcient algorithm for local distance metric learning, Proc. Nat. Conf. Artificial Intelligence (2006).
20. Y. Ying, K. Huang and C. Campbell, Sparse metric learning via smooth optimization, Adv. Neural Inform. Process. Syst. 22 (2010) 521-528.