.png){kind=icon}
Return
Linear discriminant analysis with spectral regularization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-013-0485-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Linear discriminant analysis (LDA) is a popular technique that works for both dimensionality reduction and classification. However, LDA faces the problem of small sample size in dealing with high dimensional data. Several approaches have been proposed to overcome this issue, but the resulting transformation matrix fails to extract shared structures among data samples. In this paper, we propose trace norm regularized LDA that not only tackles the problem of small sample size but also uncover the underlying structures between target classes. Specifically, our formulation characterizes the intrinsic dimensionality of a transformation matrix owing to the appealing property of trace norm. Evaluations over nine real data sets deliver the effectiveness of our algorithm.
Keywords:
Linear discriminant analysis
Spectral regression
Trace/nuclear norm
Singular value thresholding
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
Cited Papers
ShareSave
ShareSaveExtracting phonetic knowledge from learning systems: Perceptrons, support vector machines and linear discriminants.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
ShareSaveA novel feature selection method based on normalized mutual informationAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
ShareSaveShareSaveShareSave
View more