Classification by ensembles from random partitions of high-dimensional data

Hongshik Ahn, Hojin Moon, Melissa J. Fazzari, Noha Lim, James J. Chen, Ralph L. Kodell

Research output: Contribution to journalArticle

68 Scopus citations

Abstract

A robust classification procedure is developed based on ensembles of classifiers, with each classifier constructed from a different set of predictors determined by a random partition of the entire set of predictors. The proposed methods combine the results of multiple classifiers to achieve a substantially improved prediction compared to the optimal single classifier. This approach is designed specifically for high-dimensional data sets for which a classifier is sought. By combining classifiers built from each subspace of the predictors, the proposed methods achieve a computational advantage in tackling the growing problem of dimensionality. For each subspace of the predictors, we build a classification tree or logistic regression tree. Our study shows, using four real data sets from different areas, that our methods perform consistently well compared to widely used classification methods. For unbalanced data, our approach maintains the balance between sensitivity and specificity more adequately than many other classification methods considered in this study.

Original languageEnglish (US)
Pages (from-to)6166-6179
Number of pages14
JournalComputational Statistics and Data Analysis
Volume51
Issue number12
DOIs
StatePublished - Aug 15 2007

    Fingerprint

Keywords

  • Class prediction
  • Classification tree
  • Cross validation
  • Logistic regression
  • Majority voting
  • Risk profiling

ASJC Scopus subject areas

  • Statistics and Probability
  • Computational Mathematics
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this