Multiple graph unsupervised feature selection
- Publication Type:
- Journal Article
- Citation:
- Signal Processing, 2016, 120 pp. 754 - 760
- Issue Date:
- 2016-03-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 1-s2.0-S016516841400601X-main.pdf | Published Version | 269.88 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2014 Elsevier B.V. All rights reserved. Feature selection improves the quality of the model by filtering out the noisy or redundant part. In the unsupervised scenarios, the selection is challenging due to the unavailability of the labels. To overcome that, the graphs which can unfold the geometry structure on the manifold are usually used to regularize the selection process. These graphs can be constructed either in the local view or the global view. As the local graph is more discriminative, previous methods tended to use the local graph rather than the global graph. But the global graph also has useful information. In light of this, in this paper, we propose a multiple graph unsupervised feature selection method to leverage the information from both local and global graphs. Besides that, we enforce the ll2,pl norm to achieve more flexible sparse learning. The experiments which inspect the effects of multiple graph and ll2,pl norm are conducted respectively on various datasets, and the comparisons to other mainstream methods are also presented in this paper. The results support that the multiple graph could be better than the single graph in the unsupervised feature selection, and the overall performance of the proposed method is higher than the other comparisons.
Please use this identifier to cite or link to this item: