2022
DOI: 10.1007/s10489-022-03863-z
|View full text |Cite
|
Sign up to set email alerts
|

A novel feature selection method via mining Markov blanket

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 36 publications
0
4
0
Order By: Relevance
“…Our approach’s central basis was that protein sets which are crucial in distinguishing disease states may be key biological drivers of the disease ( 32 ). We developed a novel ML methodology that employs auxiliary Markov blanket feature selection ( 77, 78 ) combined with multiple recursive feature selection algorithms to mitigate bias towards any specific algorithm ( 79 ) and reduce overfitting, which is the fundamental challenge considering the inherent low sample size and high dimensionality of our, and many others, proteomics datasets. The first step of our method was the creation of Leave-One-Out (LOO) partitions of our data ( 35 ).…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Our approach’s central basis was that protein sets which are crucial in distinguishing disease states may be key biological drivers of the disease ( 32 ). We developed a novel ML methodology that employs auxiliary Markov blanket feature selection ( 77, 78 ) combined with multiple recursive feature selection algorithms to mitigate bias towards any specific algorithm ( 79 ) and reduce overfitting, which is the fundamental challenge considering the inherent low sample size and high dimensionality of our, and many others, proteomics datasets. The first step of our method was the creation of Leave-One-Out (LOO) partitions of our data ( 35 ).…”
Section: Methodsmentioning
confidence: 99%
“…The suite of algorithms employed included RFE with Logistic Regression (LR) with L1 and L2 regularization penalties, respectively ( 30, 31 ), RFE with regularized Linear Discriminant Analysis (rLDA) ( 80 ), RFE with Random Forests (RF) ( 29 ), Boruta - Random Forests ( 81 ), and Maximum-Relevance-Minimum-Redundancy (MRMR) with an F-Statistic evaluator ( 82 ). Markov blanket feature selection was employed separately on the original datasets, due to computational expense and subsequently incorporated during the later aggregation steps ( 77, 78 ).…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…One way to achieve it is by using bootstrapping with replacement to generate the training set for developing each DT's unique feature set. However, features considered for splitting each node are not chosen from the full feature set but rather from a subset of features [45]. In addition, be aware that RF is more akin to an unintelligible black box model.…”
Section: Model Framework and Parametersmentioning
confidence: 99%