RaSE: Random Subspace Ensemble Classification

06/16/2020 ∙ by Ye Tian, et al. ∙ 0

We propose a new model-free ensemble classification framework, Random Subspace Ensemble (RaSE), for sparse classification. In the RaSE algorithm, we aggregate many weak learners, where each weak learner is a base classifier trained in a subspace optimally selected from a collection of random subspaces. To conduct subspace selection, we propose a new criterion, ratio information criterion (RIC), based on weighted Kullback-Leibler divergences. The theoretical analysis includes the risk and Monte-Carlo variance of RaSE classifier, establishing the weak consistency of RIC, and providing an upper bound for the misclassification rate of RaSE classifier. An array of simulations under various models and real-data applications demonstrate the effectiveness of the RaSE classifier in terms of low misclassification rate and accurate feature ranking. The RaSE algorithm is implemented in the R package RaSEn on CRAN.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 22

page 24

page 26

page 27

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.