Test-Cost-Sensitive Quick Reduct
| Autor: | Tsvetozar Georgiev, Antonio Maratea, Alessio Ferone |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Reduct
Computer science Dimensionality reduction Granular computing Sampling (statistics) 020206 networking & telecommunications Feature selection Sample (statistics) 02 engineering and technology computer.software_genre Data quality 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Data mining Rough set computer |
| Zdroj: | Fuzzy Logic and Applications ISBN: 9783030125431 WILF |
| Popis: | In real-world applications, the data gathering process is necessarily bounded by costs in terms of money, time or resources that need to be spent in order to sample a sufficient amount of good quality data. From this point of view Feature Selection (FS) is essential to reduce the total sampling cost while trying to keep the information content of sampled data unaltered, and Rough Sets (RS) offer a natural representation of FS in terms of the so-called reducts. In this paper a modified version of the Quick Reduct (QR) algorithm is proposed, where the criterium to add features to the reduct accounts also for the costs of the features. Exploiting granular computing and the indiscernibility principle, the Test-Cost-Sensitive Quick Reduct (TCSQR) here proposed efficiently derives a close-to-optimal subset of informative and inexpensive features. Promising experimental results have been obtained on three different cost scenarios. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|