Name
Abstract | ||
|---|---|---|
Unsupervised feature selection has attracted more and more attention due to the rapid growth of the large amount of unlabelled and high-dimensional data. The performance of traditional spectral-based unsupervised methods always depends on the quality of constructed similarity matrix. However, real world data always contain a large number of noise samples and features that make the similarity matrix created by original data cannot be fully relied. We propose an unsupervised feature selection method which conducts feature selection and local structure learning simultaneously. Moreover, we add an important constraint on the similarity matrix to allow it to capture more accurate information of the data structure. To perform feature selection, orthogonal constraint and `2;p-norm are adopted on the projection matrix. An efficient and simple algorithm is derived to tackle the problem. We conduct comprehensive experiments on various benchmark data sets, including handwritten digit, face image, and biomedical data, to validate the effectiveness of the proposed approach. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/TKDE.2019.2937924 | IEEE Transactions on Knowledge and Data Engineering |
Keywords | DocType | Volume |
Structured optimal graph,embedded method,manifold learning,unsupervised feature selection | Journal | 33 |
Issue | ISSN | Citations |
3 | 1041-4347 | 2 |
PageRank | References | Authors |
0.38 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Feiping Nie | 1 | 7061 | 309.42 |
| Wei Zhu | 2 | 63 | 10.82 |
| Xuelong Li | 3 | 15049 | 617.31 |