By Topic

An Unsupervised Feature Selection Algorithm: Laplacian Score Combined with Distance-Based Entropy Measure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Rongye Liu ; Dept. of Inf. Sci. & Eng., Ocean Univ. of China, Qingdao, China ; Ning Yang ; Xiangqian Ding ; Lintao Ma

In unsupervised learning paradigm, we are not given class labels, which features should we keep? Unsupervised feature selection method well solves this problem and has got a good effect in features selection with unlabeled data. Laplacian Score (LS) is a newly proposed unsupervised feature selection algorithm. However it uses k-means clustering method to select the top k features, therefore, the disadvantages of k-means clustering method greatly affect the result and increases the complexity of LS. In this paper, we introduce a novel algorithm called LSE (Laplacian Score combined with distance-based entropy measure) for automatically selecting subset of features. LSE uses distance-based entropy to replace the k-means clustering method in LS, which intrinsically solves the drawbacks of LS and contribute to the stability and efficiency of LSE. We compare LSE with LS on six UCI data sets. Experimental results demonstrate LSE can outperform LS on stability and efficiency, especially when processing high dimension datasets.

Published in:

Intelligent Information Technology Application, 2009. IITA 2009. Third International Symposium on  (Volume:3 )

Date of Conference:

21-22 Nov. 2009