arrow
返回

A subset method for improving Linear Discriminant Analysis

delete2014-08-01
delete25
PRE
AI
C
Chao Yao *
Z
Zhaoyang Lu
J
Jing Li
Y
Yamei Xu
韩
韩军功 (Jungong Han)
DOI:10.1016/j.neucom.2014.02.004delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Linear Discriminant Analysis (LDA) is one of the most popular methods for dimension reduction. However, it suffers from class separation problem for C-class when the reduced dimensionality is less than C-1. To cope with this problem, we propose a subset improving method in this paper. In the method, the subspaces are found for each subset rather than that for the entire data set. To partition the entire data set into subsets, a cost matrix is first estimated from the training set with the pre-learned classifier, then the graph cut method is adopted to minimize the cost between each subset. We use LDA to find subspaces for each subset. Experimental results based on different applications demonstrate both the generality and effectiveness of the proposed method. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Linear Discriminant Analysis
Dimension reduction
Subset
Graph cut

期刊

Neurocomputing 封面图
Neurocomputing
IF:
6.5
论文数:
2.5W
被引数:
6.5W

机构

X
Xidian University
学者数:
2.4W
论文数: 1.9W
被引数: 9.7K
引用论文

引用论文

Reframing Education as a Public and Common Good
err
IF0
err2019-01-01
err0
PREAI
errRita Locatelli
err分享
err收藏
Power Walker Helps a Child with Cerebral Palsy
err2016-05-01
err0
errOAAI
errAnna McCormick; Hana Alazem; Aliasgar Morbi; Richard Beranek; Roselle Adler; Genevieve Tibi; Elizabeth Vilé
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
err分享
err收藏
学者 查看更多内容