Name
Abstract | ||
|---|---|---|
Unsupervised feature selection is designed to select an optimal feature subset without any label information from high-dimensional data, which is implemented by eliminating the irrelevant and redundant features and has been attracted widespread attention in recent years. Specifically, the obtained low-dimensional representation is interpretable that is useful to machine learning applications. In this paper, we propose a novel unsupervised feature selection algorithm, namely ordinal preserving self-representation (OPSR) for image classification and clustering. First, each feature in high-dimensional data is represented by the linear combination of other features. Then, the topology information is introduced into the objective function for utilizing the ordinal locality of high-dimensional data adequately. At last, an efficient iteratively update algorithm is designed to solve the proposed OPSR, and its convergence is proved in detail. Extensive experimental results on six benchmark databases demonstrate that the effectiveness of the OPSR and its superiority also is verified by comparing with some state-of-the-art feature selection algorithms. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/ACCESS.2018.2878855 | IEEE ACCESS |
Keywords | Field | DocType |
Dimensionality reduction,unsupervised feature selection,ordinal locality-preserving,self-representation | Locality,Dimensionality reduction,Pattern recognition,Feature selection,Ordinal number,Computer science,Feature extraction,Artificial intelligence,Contextual image classification,Cluster analysis,Sparse matrix,Distributed computing | Journal |
Volume | ISSN | Citations |
6 | 2169-3536 | 0 |
PageRank | References | Authors |
0.34 | 0 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiangyan Dai | 1 | 14 | 4.19 |
| Yuqi Chen | 2 | 2 | 1.37 |
| Yugen Yi | 3 | 92 | 15.25 |
| Jining Bao | 4 | 2 | 1.75 |
| Lei Wang | 5 | 401 | 111.60 |
| Wei Zhou | 6 | 8 | 2.11 |
| Gang Lei | 7 | 27 | 7.73 |