An unsupervised feature selection algorithm: laplacian score combined with distance-based entropy measure

Authors:
Rongye Liu;Ning Yang;Xiangqian Ding;Lintao Ma
Affiliations:
Department of Information Science and Engineering, Ocean University of China, Qingdao, China;The Center of Information Engineering, Ocean University of China, Qingdao, China;The Center of Information Engineering, Ocean University of China, Qingdao, China;The Center of Information Engineering, Ocean University of China, Qingdao, China
Venue:
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Year:
2009

Citing 7
Cited 1

Neural Networks for Pattern Recognition

Neural Networks for Pattern Recognition
Unsupervised Feature Selection Applied to Content-Based Retrieval of Lung Images

IEEE Transactions on Pattern Analysis and Machine Intelligence
Document clustering based on non-negative matrix factorization

Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
An introduction to variable and feature selection

The Journal of Machine Learning Research
Feature Selection for Unsupervised Learning

The Journal of Machine Learning Research
Computational Methods of Feature Selection (Chapman & Hall/Crc Data Mining and Knowledge Discovery Series)

Computational Methods of Feature Selection (Chapman & Hall/Crc Data Mining and Knowledge Discovery Series)
Constraint Score: A new filter method for feature selection with pairwise constraints

Pattern Recognition

Hybrid feature selection method for supervised classification based on Laplacian score ranking

MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.