TY - GEN
T1 - Data structure based discriminant score for feature selection
AU - Wei, Feng
AU - He, Mingyi
AU - Mei, Shaohui
AU - Lei, Tao
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014/10/20
Y1 - 2014/10/20
N2 - Selecting features from hyperspectral data under unsupervised mode is a hard work, owing to the absence of labeled data. However, most of current unsupervised feature selection algorithms ignore the fact that real data has the distribution of manifold structure which is embedded into original high dimensional space. In order to solve this problem, an unsupervised feature selection method based on the data structure, called Data structure based Discriminant Score (DDS) is presented in this paper. The proposed algorithm is a linear approximation of multi-manifolds based process which considering local and non-local quantities simultaneously. It evaluates candidate features by calculating their power of maximizing the non-local, and in the same time, minimizing the local scatter. The property enables DDS more effective than some other feature selection methods. Experiments on a benchmark hyperspectral data set demonstrate the efficiency of our algorithm.
AB - Selecting features from hyperspectral data under unsupervised mode is a hard work, owing to the absence of labeled data. However, most of current unsupervised feature selection algorithms ignore the fact that real data has the distribution of manifold structure which is embedded into original high dimensional space. In order to solve this problem, an unsupervised feature selection method based on the data structure, called Data structure based Discriminant Score (DDS) is presented in this paper. The proposed algorithm is a linear approximation of multi-manifolds based process which considering local and non-local quantities simultaneously. It evaluates candidate features by calculating their power of maximizing the non-local, and in the same time, minimizing the local scatter. The property enables DDS more effective than some other feature selection methods. Experiments on a benchmark hyperspectral data set demonstrate the efficiency of our algorithm.
KW - Feature Selection
KW - Hyperspectral
KW - Manifold Structure
KW - Unsupervised Learning
UR - http://www.scopus.com/inward/record.url?scp=84912131756&partnerID=8YFLogxK
U2 - 10.1109/ICIEA.2014.6931511
DO - 10.1109/ICIEA.2014.6931511
M3 - 会议稿件
AN - SCOPUS:84912131756
T3 - Proceedings of the 2014 9th IEEE Conference on Industrial Electronics and Applications, ICIEA 2014
SP - 2071
EP - 2074
BT - Proceedings of the 2014 9th IEEE Conference on Industrial Electronics and Applications, ICIEA 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 9th IEEE Conference on Industrial Electronics and Applications, ICIEA 2014
Y2 - 9 June 2014 through 11 June 2014
ER -