Adaptive Feature Selection Based on the Most Informative Graph-Based Features

DOI10.1007/978-3-319-58961-9_25MaRDI QIDQ5082164zbMATH OpenOpenAlexWikidataFDO

Authors Lixin Cui, Yuhang Jiao, Lu Bai, Luca Rossi, Edwin R. Hancock

Publication date 15 June 2022

Published in Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://eprints.whiterose.ac.uk/114047/1/paper_22.pdf

Mathematics Subject Classification ID

Random walks on graphs (05C81) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Measures of information, entropy (94A17)

Recommendations

• A Graph-Based Approach to Feature Selection
• Feature selection based on graph structure
• Feature grouping and selection: a graph-based approach
• scientific article; zbMATH DE number 1759533
• A robust graph-based semi-supervised sparse feature selection method
• Feature selection based on the best-path algorithm in high dimensional graphical models

Cites work

• A quantum Jensen-Shannon graph kernel for unattributed graphs
• Depth-based hypergraph complexity traces from directed line graphs
• Fast depth-based subgraph kernels for unattributed graphs

Cited in

(7)

• Feature grouping and selection: a graph-based approach
• Feature selection based on graph structure
• An instance voting approach to feature selection
• Joint hypergraph learning and sparse regression for feature selection
• A Graph-Based Approach to Feature Selection
• Coupled-feature hypergraph representation for feature selection
• Supervised feature selection using integration of densest subgraph finding with floating forward-backward search

This page was built for publication: Adaptive Feature Selection Based on the Most Informative Graph-Based Features

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