An adaptive heuristic for feature selection based on complementarity
From MaRDI portal
Publication:1722737
DOI10.1007/s10994-018-5728-yzbMath1480.62133OpenAlexW2809190716WikidataQ129627581 ScholiaQ129627581MaRDI QIDQ1722737
Sumanta Singha, Prakash P. Shenoy
Publication date: 18 February 2019
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-018-5728-y
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Uses Software
Cites Work
- Is mutual information adequate for feature selection in regression?
- Feature subset selection in large dimensionality domains
- Consistency-based search in feature selection
- Relevance measures for subset variable selection in regression problems based on \(k\)-additive mutual information
- Stochastic complexity and modeling
- Wrappers for feature subset selection
- Learning Boolean concepts in the presence of many irrelevant features
- Theoretical and empirical analysis of ReliefF and RReliefF
- Multivariante information transmission
- Information of interactions in complex systems
- A new outlook on Shannon's information measures
- A Branch and Bound Algorithm for Feature Subset Selection
- 10.1162/153244303322753616
- Elements of Information Theory
- Problems and methods with multiple objective functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An adaptive heuristic for feature selection based on complementarity