Name
Abstract | ||
|---|---|---|
With the explosive growth of information, inconsistent data are increasingly common. However, traditional feature selection methods are lack of efficiency due to inconsistent data repairing beforehand. Therefore, it is necessary to take inconsistencies into consideration during feature selection to not only reduce time costs but also guarantee accuracy of machine learning models. To achieve this goal, we present FRIEND, a feature selection approach on inconsistent data. Since features in consistency rules have higher correlation with each other, we aim to select a specific amount of features from these. We prove that the specific feature selection problem is NP-hard and develop an approximation algorithm for this problem. Extensive experimental results demonstrate the efficiency and effectiveness of our proposed approach. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.neucom.2020.01.094 | Neurocomputing |
Keywords | DocType | Volume |
Feature selection,Inconsistent data,Mutual information,Data quality,Approximation | Journal | 391 |
ISSN | Citations | PageRank |
0925-2312 | 1 | 0.35 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhixin Qi | 1 | 13 | 2.66 |
| Hongzhi Wang | 2 | 421 | 73.72 |
| Tao He | 3 | 1 | 0.35 |
| Jianzhong Li | 4 | 63 | 24.23 |
| Hong Gao | 5 | 1086 | 120.07 |