DocumentCode :
1797254
Title :
Data dimensionality reduction approach to improve feature selection performance using sparsified SVD
Author :
Pengpeng Lin ; Jun Zhang ; Ran An
Author_Institution :
Comput. Sci. Dept., Univ. of Kentucky, Lexington, KY, USA
fYear :
2014
fDate :
6-11 July 2014
Firstpage :
1393
Lastpage :
1400
Abstract :
Feature selection is a technique of selecting a subset of relevant features for building robust learning models. In this paper, we developed a data dimensionality reduction approach using sparsified singular value decomposition (SSVD) technique to identify and remove trivial features before applying any advanced feature selection algorithm. First, we investigated how SSVD can be used to identify and remove nonessential features in order to facilitate feature selection performance. Second, we analyzed the application limitations and computing complexity. Next, a set of experiments were conducted and the empirical results show that applying feature selection techniques on the data of which the nonessential features are removed by the data dimensionality reduction approach generally results in better performance with significantly reduced computing time.
Keywords :
computational complexity; data reduction; feature selection; learning (artificial intelligence); singular value decomposition; SSVD technique; computing complexity; data dimensionality reduction approach; feature selection algorithm; feature selection performance; feature selection technique; robust learning model; sparsified SVD; sparsified singular value decomposition technique; trivial features; Approximation methods; Complexity theory; Educational institutions; Electronic mail; Matrix decomposition; Singular value decomposition; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks (IJCNN), 2014 International Joint Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4799-6627-1
Type :
conf
DOI :
10.1109/IJCNN.2014.6889366
Filename :
6889366
Link To Document :
بازگشت