Fast Classification with Sequential Feature Selection in Test Phase

June 25, 2023 ยท Entered Twilight ยท ๐Ÿ› arXiv.org

๐Ÿ’ค TWILIGHT: Eternal Rest
Repo abandoned since publication

Repo contents: .gitignore, FCwSFS.py, README.md, cube.py, datasets.py, forest.py, main.py, mnist.py, results, utils.py

Authors Ali Mirzaei, Vahid Pourahmadi, Hamid Sheikhzadeh, Alireza Abdollahpourrostam arXiv ID 2306.14347 Category cs.LG: Machine Learning Cross-listed cs.IT, eess.SP Citations 1 Venue arXiv.org Repository https://github.com/alimirzaei/FCwSFS Last Checked 3 months ago
Abstract
This paper introduces a novel approach to active feature acquisition for classification, which is the task of sequentially selecting the most informative subset of features to achieve optimal prediction performance during testing while minimizing cost. The proposed approach involves a new lazy model that is significantly faster and more efficient compared to existing methods, while still producing comparable accuracy results. During the test phase, the proposed approach utilizes Fisher scores for feature ranking to identify the most important feature at each step. In the next step the training dataset is filtered based on the observed value of the selected feature and then we continue this process to reach to acceptable accuracy or limit of the budget for feature acquisition. The performance of the proposed approach was evaluated on synthetic and real datasets, including our new synthetic dataset, CUBE dataset and also real dataset Forest. The experimental results demonstrate that our approach achieves competitive accuracy results compared to existing methods, while significantly outperforming them in terms of speed. The source code of the algorithm is released at github with this link: https://github.com/alimirzaei/FCwSFS.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning