Learning distance to subspace for the nearest subspace methods in high-dimensional data classification

• Published in: Information sciences Vol. 481; pp. 69 - 80
• Main Authors: Zhu, Rui, Dong, Mingzhi, Xue, Jing-Hao
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.05.2019
• Subjects: Distance metric learning; Distance to subspace; Nearest subspace methods (NSM); Orthogonal distance; Score distance; Orthogonal distance; Nearest subspace methods (NSM); Score distance; Distance to subspace; Distance metric learning
• ISSN: 0020-0255; 1872-6291
• DOI: 10.1016/j.ins.2018.12.061

The nearest subspace methods (NSM) are a category of classification methods widely applied to classify high-dimensional data. In this paper, we propose to improve the classification performance of NSM through learning tailored distance metrics from samples to class subspaces. The learned distance metric is termed as ‘learned distance to subspace’ (LD2S). Using LD2S in the classification rule of NSM can make the samples closer to their correct class subspaces while farther away from their wrong class subspaces. In this way, the classification task becomes easier and the classification performance of NSM can be improved. The superior classification performance of using LD2S for NSM is demonstrated on three real-world high-dimensional spectral datasets.