Building classification models from microarray data with tree-based classification algorithms

Authors:
Peter J. Tan;David L. Dowe;Trevor I. Dix
Affiliations:
Clayton School of Information Technology, Monash University, Melbourne, Australia;Clayton School of Information Technology, Monash University, Melbourne, Australia;Clayton School of Information Technology, Monash University, Melbourne, Australia
Venue:
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Year:
2007

Citing 5
Cited 1

C4.5: programs for machine learning

C4.5: programs for machine learning
Boosting a weak learning algorithm by majority

Information and Computation
Random Forests

Machine Learning
Decision forests with oblique decision trees

MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
MML inference of oblique decision trees

AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence

Multi-Test decision trees for gene expression data analysis

SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Building classification models plays an important role in DNA mircroarray data analyses. An essential feature of DNA microarray data sets is that the number of input variables (genes) is far greater than the number of samples. As such, most classification schemes employ variable selection or feature selection methods to pre-process DNA microarray data. This paper investigates various aspects of building classification models from microarray data with tree-based classification algorithms by using Partial Least-Squares (PLS) regression as a feature selection method. Experimental results show that the Partial Least-Squares (PLS) regression method is an appropriate feature selection method and tree-based ensemble models are capable of delivering high performance classification models for microarray data.