Robustness analysis of diversified ensemble decision tree algorithms for microarray data classification

Robustness analysis of diversified ensemble decision tree algorithms for microarray data classification

Ensemble classification methods have shown promise for achieving higher classification accuracy for Microarray data classification analysis. As noise values do exist in all Microarray data even after Microarray data preprocessing stage, robustness is therefore another very important criteria in addition to accuracy for evaluating reliable Microarray classification algorithms. In this paper, we conduct experimental comparison of our newly developed MDMT with C4.5, BaggingC4.5, AdaBoostingC4.5, Random Forest and CS4 on four Microarray cancer data sets. We test and evaluate how well a given single or ensemble classifier can tolerate noise data in unseen test data sets, particularly with increasing levels of noise. The experimental results show that MDMT tolerates the noise values in unseen test data sets better than other compared methods do, particularly with increasing levels of noise data. We observe that Random forests is comparable to MDMT in term of resistance to noise.
The experimental results also show that ensemble decision tree methods tolerate the noise values better than single tree C4.5 does. We conclude that avoiding overlapping genes exist among the ensemble trees is an intuitive, simple and effective way to achieve higher degree of diversity for ensemble decision tree methods. The algorithm based on this principal is more reliable to deal with Microarray data sets with certain level of noise data.

File reproduced in accordance with the copyright policy of the publisher/author.