Minimummaximum local structure information for feature selection
Feature selection methods have been extensively applied in machine learning tasks, such as computer vision, pattern recognition, and data mining. These methods aim to identify a subset of the original features with high discriminating power. Among them, the feature selection technique for unsupervised tasks is more attractive since the cost to obtain the labels of the data and/or the information between classes is often high. On the other hand, the low-dimensional manifold of the same class data is usually revealed by considering the local invariance of the data structure, it may not be adequate to deal with unsupervised tasks where the class information is completely absent. In this paper, a novel feature selection method, called Minimummaximum local structure information Laplacian Score (MMLS), is proposed to minimize the within-locality information (i.e., preserving the manifold structure of the same class data) and to maximize the between-locality information (i.e., maximizing the information between the manifold structures of the different class data) at the same time. The effectiveness of the proposed algorithm is demonstrated with experiments on classification and clustering.
feature selection laplacian score locality preserving laplacian eigenmap manifold learning