Supervised feature selection using integration of densest subgraph finding with floating forward-backward search

DOI10.1016/J.INS.2021.02.034MaRDI QIDQ6086296zbMATH OpenOpenAlexFDO

Authors Tapas Bhadra, Sanghamitra Bandyopadhyay

Publication date 9 November 2023

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2021.02.034

zbMATH Keywords

mutual informationnormalized mutual informationpattern recognitionsupervised feature selection

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Feature grouping and selection: a graph-based approach
• A Graph-Based Approach to Feature Selection
• A robust graph-based semi-supervised sparse feature selection method
• Supervised feature selection by clustering using conditional mutual information-based distances
• Adaptive Feature Selection Based on the Most Informative Graph-Based Features

Cites work

• A survey on semi-supervised feature selection methods
• Feature selection for support vector machines via mixed integer linear programming
• Gene selection for cancer classification using support vector machines
• Independent component analysis, a new concept?
• Pattern Recognition Algorithms for Data Mining
• Statistical comparisons of classifiers over multiple data sets
• The Best Two Independent Measurements Are Not the Two Best
• Wrappers for feature subset selection

Cited in

(1)

• Streaming feature selection via graph diffusion

This page was built for publication: Supervised feature selection using integration of densest subgraph finding with floating forward-backward search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6086296)