2016
DOI: 10.1155/2016/1058305
|View full text |Cite
|
Sign up to set email alerts
|

Robust Feature Selection from Microarray Data Based on Cooperative Game Theory and Qualitative Mutual Information

Abstract: High dimensionality of microarray data sets may lead to low efficiency and overfitting. In this paper, a multiphase cooperative game theoretic feature selection approach is proposed for microarray data classification. In the first phase, due to high dimension of microarray data sets, the features are reduced using one of the two filter-based feature selection methods, namely, mutual information and Fisher ratio. In the second phase, Shapley index is used to evaluate the power of each feature. The main innovati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(4 citation statements)
references
References 25 publications
(41 reference statements)
0
4
0
Order By: Relevance
“…The major aim behind this combination is to use a bare minimum of dimensions while maximizing the classification performance. Regarding Table 5, the most interesting result concerned the Leukemia1 dataset since the best model, P-PCA-C5.0, achieved an excellent accuracy of 100% with only ′ = 3 selected dimensions and a response time of 2 seconds, which is much better than what was reported in [11][12], [14][15]. The classification accuracy of 100% was obtained by computing the percentage of correct predictions from the confusion matrix (c) shown in Fig.…”
Section: Resultsmentioning
confidence: 87%
See 1 more Smart Citation
“…The major aim behind this combination is to use a bare minimum of dimensions while maximizing the classification performance. Regarding Table 5, the most interesting result concerned the Leukemia1 dataset since the best model, P-PCA-C5.0, achieved an excellent accuracy of 100% with only ′ = 3 selected dimensions and a response time of 2 seconds, which is much better than what was reported in [11][12], [14][15]. The classification accuracy of 100% was obtained by computing the percentage of correct predictions from the confusion matrix (c) shown in Fig.…”
Section: Resultsmentioning
confidence: 87%
“…Atiyeh and Mohammad implemented an innovative feature selection approach Based on Cooperative Game Theory and Qualitative Mutual Information (QMT). The classification accuracy on 11 microarray datasets, namely Leukemia1, SRBCT, Lung, and prostate cancer, shows that the proposed approach improves both accuracy and stability compared to other methods [12]. Chandra proposed an efficient feature selection technique that removes the drawbacks of [13], by taking into account the redundancy between features.…”
Section: Related Workmentioning
confidence: 99%
“…Then for the optimal solution of the objective function, only the second order can be considered and the expression is shown as Eq. (5).…”
Section: Svm-rfe Feature Selection Algorithmmentioning
confidence: 99%
“…Chehong Zhu [4] developed and designed a deep learning entity model of mortgage risk, and found that there is a highly optimal control relationship between personal behavior of early repayment of loans and loan characteristics and macroeconomic variables. Mortazavi A [5] removed irrelevant features by searching the optimal feature subset to produce the minimum error on the original dataset. Schapiro et al [6] proposed the AdaBoost algorithm, which allows the classifier to improve its focus on a small number of classes of samples by focusing on the samples that are misclassified after each round and giving them higher weights.…”
Section: Introductionmentioning
confidence: 99%