Deep Metric Learning for K Nearest Neighbor Classification

被引:17
作者
Liao, Tingting [1 ,2 ]
Lei, Zhen [3 ]
Zhu, Tianqing [4 ]
Zeng, Shan [5 ]
Li, Yaqin [5 ]
Yuan, Cao [5 ]
机构
[1] Chinese Acad Sci, Inst Automat, Ctr Biometr & Secur Res CBSR, Natl Lab Pattern Recognit NLPR,CASIA, Beijing 100190, Peoples R China
[2] Univ Chinese Acad Sci UCAS, Sch Artificial Intelligence, Beijing 100049, Peoples R China
[3] Chinese Acad Sci, Hong Kong Inst Sci & Innovat, Ctr Artificial Intelligence & Robot, Hongkong 999077, Peoples R China
[4] Univ Technol Sydney, Fac Engn & Informat Technol, Ultimo, NSW 2007, Australia
[5] Wuhan Polytech Univ, Coll Math, Comp Sci Dept, Wuhan 430023, Peoples R China
关键词
K nearest neighbor; distance metric learning; prototype reduction; PROTOTYPE REDUCTION; DIMENSIONALITY; EIGENFACES;
D O I
10.1109/TKDE.2021.3090275
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
K Nearest Neighbor (kNN) has gained popularity in machine learning due to its simplicity and good performance. However, kNN faces two problems with classification tasks. The first is that an appropriate distance measurement is required to compute distances between test sample and training samples. The other is the highly computational complexity due to the requirement of searching the nearest neighbors in the whole training data. In order to mitigate these two problems, we propose a novel method named KCNN to enhance the performance of kNN. KCNN uses convolutional neural networks (CNN) to learn a suitable distance metric as well as prototype reduction to learn a reduced set of prototypes which can represent the original set. It has several superiorities compared with related methods. The combination of CNN and kNN empowers it to extract discriminative hierarchical features with which kNN can easily classify. KCNN learns spatial information on an image instead of considering it as a vector to learn distance metric. Moreover, KCNN simultaneously learns a reduced set of prototypes, which help improve classification efficiency and avoid noisy samples of the massive training set. The proposed method has a better robustness and convergence than CNN, especially when projecting input data into a rather low-dimension space.
引用
收藏
页码:264 / 275
页数:12
相关论文
共 48 条
[1]  
[Anonymous], 1982, Pattern recognition: A statistical approach
[2]   Eigenfaces vs. Fisherfaces: Recognition using class specific linear projection [J].
Belhumeur, PN ;
Hespanha, JP ;
Kriegman, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (07) :711-720
[3]  
Bellet A, 2014, Arxiv, DOI [arXiv:1306.6709, DOI 10.48550/ARXIV.1306.6709]
[4]  
Bengio Y., 2007, Advances in Neural Information Processing Systems 19, V19, P153
[5]  
Cai D, 2007, PROC CVPR IEEE, P650
[6]   FINDING PROTOTYPES FOR NEAREST NEIGHBOR CLASSIFIERS [J].
CHANG, CL .
IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (11) :1179-1184
[7]   Learning a similarity metric discriminatively, with application to face verification [J].
Chopra, S ;
Hadsell, R ;
LeCun, Y .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :539-546
[8]  
Finn C, 2017, PR MACH LEARN RES, V70
[9]  
Globerson A., 2005, P ADV NEUR INF PROC, P451, DOI [DOI 10.5555/2976248.2976305, 10.5555/2976248.2976305]
[10]  
Goldberger J., 2004, ADV NEURAL INFORM PR, P513