An approach to supervised distance metric learning based on difference of convex functions programming. (September 2018)

• Record Type: Journal Article
• Authors: Nguyen, Bac; De Baets, Bernard
• Is Part Of: Pattern recognition. Volume 81(2018:Sep.)
• Page Start: 562
• Page End: 574
• Publication Date: 2018-09
• Subjects: Distance metric learning -- Nearest neighbor -- Linear transformation -- DC programming; Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2018.04.024
• Languages: English
• ISSNs: 0031-3203

Abstract

Highlights: We develop a metric learning method (DML-dc) for nearest-neighbor classification. DML-dc is based on difference of convex functions (DC) programming. DML-dc uses the ramp loss function to avoid the influence of outliers. Extensive experiments on several benchmark data sets show the effectiveness of DML-dc. Abstract: Distance metric learning has motivated a great deal of research over the last years due to its robustness for many pattern recognition problems. In this paper, we develop a supervised distance metric learning method that aims to improve the performance of nearest-neighbor classification. Our method is inspired by the large-margin principle, resulting in an objective function based on a sum of margin violations to be minimized. Due to the use of the ramp loss function, the corresponding objective function is nonconvex, making it more challenging. To overcome this limitation, we formulate our distance metric learning problem as an instance of difference of convex functions (DC) programming. This allows us to design a more robust method than when using standard optimization techniques. The effectiveness of this method is empirically demonstrated through extensive experiments on several standard benchmark data sets.