Robust Sparse Subspace Learning for unsupervised feature selection

Feature selection is an effective technique for dimensionality reduction to get the most useful information from huge raw data. Many spectral feature selection algorithms have been proposed to address the unsupervised feature selection problem, but most of them fail to pay attention to the noises induced during the feature selection process. In this paper, we not only consider the feature structural learning, but also try to avoid these noises induced during the feature selection process. We utilize the feature structural learning to select the discriminant features and use the robust methods to make selected features more reliable. Furthermore, we propose a new unsupervised feature selection algorithm, namely Robust Sparse Subspace Learning Feature Selection(RSS). And we employ a coordinate descendent algorithm to solve the RSS formulation. Experiments are conducted on several popular datasets to validate the effectiveness of our proposed algorithm and results show that this RSS algorithm achieves better results than traditional feature selection algorithms in most cases.