Generalized iterative RELIEF for supervised distance metric learning |
| |
Authors: | Chin-Chun Chang [Author Vitae] |
| |
Affiliation: | Department of Computer Science and Engineering, National Taiwan Ocean University, Keelung 202, Taiwan |
| |
Abstract: | The RELIEF algorithm is a popular approach for feature weighting. Many extensions of the RELIEF algorithm are developed, and I-RELIEF is one of the famous extensions. In this paper, I-RELIEF is generalized for supervised distance metric learning to yield a Mahananobis distance function. The proposed approach is justified by showing that the objective function of the generalized I-RELIEF is closely related to the expected leave-one-out nearest-neighbor classification rate. In addition, the relationships among the generalized I-RELIEF, the neighbourhood components analysis, and graph embedding are also pointed out. Experimental results on various data sets all demonstrate the superiority of the proposed approach. |
| |
Keywords: | Distance metric learning Iterative RELIEF Feature weighting |
本文献已被 ScienceDirect 等数据库收录! |
|