ویراساینس.
سند علمی

Feasibility Based-Large Margin Nearest Neighbor Metric Learning

Babak Hosseini, Barbara Hammer

چکیده

In the area of data classification, one of the prominent algorithms is the large margin nearest neighbor (LMNN) approach which is a metric learning to enhance the performance of the popular k-nearest neighbor classifier. In principles, LMNN learns a more efficient metric in the input space by using a linear mapping as the outcome of a convex optimization problem. However, one of the greatest weak points of LMNN is the strong reliance of its optimization paradigm on how the neighboring points are chosen. In this paper, it is mathematically proved for the first time that the regular way of choosing the target points can lead to non-feasible optimization conditions regardless of the number of chosen neighboring points. We present a mathematical approach to categorize the target points into feasible and infeasible exemplars, an also we provide a feasibility measure for preference of the target candidates. In our proposed Feasibility Based-LMNN algorithm, we use the above clue to construct the optimization problem based on the most promising general mapping directions in the input space. Our empirical results shows that via using the proposed FB-LMNN approach the optimization problem will converge in a better optimum point, and therefor leads to better classification on the well-known benchmark datasets

اسناد مشابه

  • Convergence of Multi-pass Large Margin Nearest Neighbor Metric Learning

    سند علمی۲۰۱۶ICANNChristina Göpfert, Benjamin Paassen, Barbara Hammer

    Large margin nearest neighbor classification (LMNN) is a popular technique to learn a metric that improves the accuracy of a simple knearest neighbor classifier via a convex optimization scheme. However, the optimization problem is convex only under the assumption that the neares

  • Modified Large Margin Nearest Neighbor Metric Learning for Regression

    مقاله‌ی دسترسی آزاد۲۰۱۴IEEE Signal Processing LettersKondo C.Assi, HubertLabelle, FaridaCheriet

  • Efficiently Learning a Distance Metric for Large Margin Nearest Neighbor Classification

    سند علمی۲۰۱۱AAAIKyoungup Park, Chunhua Shen, Zhihui Hao, Junae Kim

    We concern the problem of learning a Mahalanobis distance metric for improving nearest neighbor classification. Our work is built upon the large margin nearest neighbor (LMNN) classification framework. Due to the semidefiniteness constraint in the optimization problem of LMNN, it

  • Distance Metric Learning for Large Margin Nearest Neighbor Classification

    سند علمی۲۰۰۵IJPRAIKilian Q. Weinberger, John Blitzer, Lawrence K. Saul

    We show how to learn aMahanalobis distance metric for k-nearest neighbor (kNN) classification by semidefinite programming. The metric is trained with the goal that the k-nearest neighbors always belong to the same class while examples from different classes are separated by a lar

  • Large-margin nearest neighbor classifiers via sample weight learning

    سند علمی۲۰۱۱NeurocomputingQinghua Hu, Pengfei Zhu, Yongbin Yang, Daren Yu

    The nearest neighbor classification is a simple and yet effective technique for pattern recognition. Performance of this technique depends significantly on the distance function used to compute similarity between examples. Some techniques were developed to learn weights of featur

  • Dynamic time warping constraint learning for large margin nearest neighbor classification

    سند علمی۲۰۱۱Inf. Sci.Daren Yu, Xiao Yu, Qinghua Hu, Jinfu Liu

    Nearest neighbor (NN) classifier with dynamic time warping (DTW) is considered to be an effective method for time series classification. The performance of NN-DTW is dependent on the DTW constraints because the NN classifier is sensitive to the used distance function. For time se