2019
DOI: 10.1007/978-981-13-7403-6_4
|View full text |Cite
|
Sign up to set email alerts
|

Graph-Based Supervised Feature Selection Using Correlation Exponential

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…To determine the same, different graph approaches have been proposed for feature selection [25][26][27][28][29][30][31][32][33][34][35][36][37]. Das et al [30] used Feature Association Map to present a graph-based hybrid feature selection method.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…To determine the same, different graph approaches have been proposed for feature selection [25][26][27][28][29][30][31][32][33][34][35][36][37]. Das et al [30] used Feature Association Map to present a graph-based hybrid feature selection method.…”
Section: Introductionmentioning
confidence: 99%
“…Das et al [30] used Feature Association Map to present a graph-based hybrid feature selection method. While Kumar et al [34] employed correlation exponential in the graph-based feature selection method. Lim et al [18] presented a feature-dependency-based unsupervised feature selection (DUFS) method that uses pairwise dependency of the features to perform feature selection.…”
Section: Introductionmentioning
confidence: 99%