Semi-Supervised Weighted Distance Metric Learning for kNN Classification
K-Nearest Neighbor (kNN) classification is one of the mast popular machine learning techniques, but it often fails (o work well due to less known information or inappropriate choice of distance melric or the presence of a lot of unrelated features. To handle those issues, we introduce a semi-supervised weighted distance metric learning method for kNN classification. This method uses a graph-based semi-supervised Label Propagation algorithm lo gain more classification information with liny initial classification information, then resorts to improved weighted Relevant Component Analysis to learn a Mahalanobis distance metric, and finally uses learned Mahalanuhis distance metric to replace the original Euclidean distance of kNN classifier. Experiments on UCI dalasets show the effectiveness of our method.
It nearest neighbor classification semi-superised learning relevant component analysis metric learning
Fangming Gu Dayou Liu Xinying Wang
College of Computer Science and Technology Jilin University Changchun,China College of Computer Science and Engineering Changchun University of Technology Changchun. China
国际会议
长春
英文
406-409
2010-08-24(万方平台首次上网日期,不代表论文的发表时间)