2019
DOI: 10.1016/j.ins.2018.12.061
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…Since acoustic sensors may collect signals with information overlap, these methods can compress those signals, proving a compact representation through a subset of their eigenvectors. In general, subspace-based methods operate on multiple patterns at once, achieving higher recognition rates than methods that operate on single patterns [16], [17], [18].…”
Section: Introductionmentioning
confidence: 99%
“…Since acoustic sensors may collect signals with information overlap, these methods can compress those signals, proving a compact representation through a subset of their eigenvectors. In general, subspace-based methods operate on multiple patterns at once, achieving higher recognition rates than methods that operate on single patterns [16], [17], [18].…”
Section: Introductionmentioning
confidence: 99%