2017
DOI: 10.18280/ama_b.600101
|View full text |Cite
|
Sign up to set email alerts
|

An improved rotation forest algorithm based on heterogeneous classifiers ensemble for classifying gene expression profile

Abstract: Many machine learning methods can't obtain higher classification performance because of the characteristics of high dimension and small samplest of gene expression profile. This paper proposes an improved rotation forest algorithm based on heterogeneous classifiers ensemble to classify gene expression profile.Firstly, all the original genes are ranked by using relieff algorithm, and then some top-ranked genes are selected to build a new training subset from original training set. Secondly, because decision tre… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 30 publications
0
3
0
Order By: Relevance
“…In [14], a rotation forest algorithm created on heterogeneous classifiers ensemble is applied to classified the gene expression outline. The local optimum and overfitting were improved through heterogeneous rotation forests.…”
Section: Related Workmentioning
confidence: 99%
“…In [14], a rotation forest algorithm created on heterogeneous classifiers ensemble is applied to classified the gene expression outline. The local optimum and overfitting were improved through heterogeneous rotation forests.…”
Section: Related Workmentioning
confidence: 99%
“…Another algorithm used is Rotation Forest [23] with base classifier C4.5 decision tree. The experiments were conducted in the feature set of 800 features and the best performance of the model, for every 10 iterations of the Rotation Forest algorithm, up to 100 iterations, is presented in Table 14.…”
Section: Improving the Accuracymentioning
confidence: 99%
“…Extensive exploitation of the RotF as a base learner can take place during both the process of discerning the most questionable unlabeled instances, so as to get labeled by a human expert, and the building of the intermediate classification models during the conducted iterations along with the final one. By this procedure, the proposed algorithm may sufficiently benefited concerning the properties of stability and robustness, either acting individually or as a wrapper technique based on heterogeneous base learners . Consequently, by obtaining decent disambiguating performance over the exploitation of unlabeled pool, a dramatically large reduction of the human effort spent is achieved, acquiring satisfactory quality of classification accuracy rates through a small number of iterations.…”
Section: Introductionmentioning
confidence: 99%