Sökning: onr:"swepub:oai:DiVA.org:kth-323022" >
Neural Greedy Pursu...
Neural Greedy Pursuit for Feature Selection
-
- Das, Sandipan (författare)
- KTH,Teknisk informationsvetenskap
-
- Javid, Alireza M. (författare)
- KTH,Teknisk informationsvetenskap
-
- Borpatra Gohain, Prakash (författare)
- KTH,Teknisk informationsvetenskap
-
visa fler...
-
- Eldar, Yonina C. (författare)
- Weizmann Inst Sci, Math & Comp Sci, Rehovot, Israel.
-
- Chatterjee, Saikat (författare)
- KTH,Teknisk informationsvetenskap
-
visa färre...
-
(creator_code:org_t)
- Institute of Electrical and Electronics Engineers (IEEE), 2022
- 2022
- Engelska.
-
Ingår i: 2022 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN). - : Institute of Electrical and Electronics Engineers (IEEE).
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We propose a greedy algorithm to select N important features among P input features for a non-linear prediction problem. The features are selected one by one sequentially, in an iterative loss minimization procedure. We use neural networks as predictors in the algorithm to compute the loss and hence, we refer to our method as neural greedy pursuit (NGP). NGP is efficient in selecting N features when N << P, and it provides a notion of feature importance in a descending order following the sequential selection procedure. We experimentally show that NGP provides better performance than several feature selection methods such as DeepLIFT and Drop-one-out loss. In addition, we experimentally show a phase transition behavior in which perfect selection of all N features without false positives is possible when the training data size exceeds a threshold.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Feature selection
- Deep learning
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)