Abstract
The amount of features in datasets has increased significantly in the age of big data. Processing such datasets requires an enormous amount of computing power, which exceeds the capability of traditional machines. Based on mutual information and selection gain, the novel feature selection approach is proposed. With Mackey-Glass, S&P 500, and TAIEX time series datasets, we investigated how good the proposed approach could perform feature selection for a compact subset of feature variables optimal or near optimal, through comparing the results by the proposed approach to those by the brute force method. With these results, we determine the proposed approach can establish a subset solution optimal or near optimal to the problem of feature selection with very fast calculation.
Original language | English |
---|---|
Title of host publication | Intelligent Information and Database Systems - 9th Asian Conference, ACIIDS 2017, Proceedings |
Editors | Satoshi Tojo, Le Minh Nguyen, Ngoc Thanh Nguyen, Bogdan Trawinski |
Publisher | Springer Verlag |
Pages | 445-454 |
Number of pages | 10 |
ISBN (Print) | 9783319544717 |
DOIs | |
State | Published - 2017 |
Externally published | Yes |
Event | 9th Asian Conference on Intelligent Information and Database Systems, ACIIDS 2017 - Kanazawa, Japan Duration: 03 04 2017 → 05 04 2017 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 10191 LNAI |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 9th Asian Conference on Intelligent Information and Database Systems, ACIIDS 2017 |
---|---|
Country/Territory | Japan |
City | Kanazawa |
Period | 03/04/17 → 05/04/17 |
Bibliographical note
Publisher Copyright:© Springer International Publishing AG 2017.
Keywords
- Feature selection
- Information entropy
- Probability density estimation
- Time series dataset