Multi-label Random Subspace Ensemble Classification

In this work, we develop a new ensemble learning framework, <i>multi-label Random Subspace Ensemble</i> (mRaSE), for multi-label classification. Given a base classifier (e.g., multinomial logistic regression, classification tree, <i>K</i>-nearest neighbors), mRaSE works by first randomly sampling a collection of subspaces, then choosing the best ones that achieve the minimum cross-validation errors and, finally, aggregating the chosen weak learners. In addition to its superior prediction performance, mRaSE also provides a model-free feature ranking depending on the given base classifier. An iterative version of mRaSE is also developed to further improve the performance. A model-free extension is pursued on the iterative version, leading to the so-called <i>Super mRaSE</i>, which accepts a collection of base classifiers as input to the algorithm. We show the proposed algorithms compared favorably with the state-of-the-art classification algorithm including random forest and deep neural network, via extensive simulation studies and two real data applications. The new algorithms are implemented in an updated version of the R package RaSEn.

Authors

Institutions

Publication Details

Journal
Journal of Computational and Graphical Statistics
Published
2024-10-28
DOI
https://doi.org/10.1080/10618600.2024.2421248
Primary Topic
Text and Document Classification Technologies
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-label Random Subspace Ensemble Classification

Yang Feng, Jianan Zhu, Bi Fan
Journal of Computational and Graphical Statistics
Text and Document Classification Technologies
article

Multi-label Random Subspace Ensemble Classification

Yang Feng, Jianan Zhu, Bi Fan
article en

Abstract

In this work, we develop a new ensemble learning framework, <i>multi-label Random Subspace Ensemble</i> (mRaSE), for multi-label classification. Given a base classifier (e.g., multinomial logistic regression, classification tree, <i>K</i>-nearest neighbors), mRaSE works by first randomly sampling a collection of subspaces, then choosing the best ones that achieve the minimum cross-validation errors and, finally, aggregating the chosen weak learners. In addition to its superior prediction performance, mRaSE also provides a model-free feature ranking depending on the given base classifier. An iterative version of mRaSE is also developed to further improve the performance. A model-free extension is pursued on the iterative version, leading to the so-called <i>Super mRaSE</i>, which accepts a collection of base classifiers as input to the algorithm. We show the proposed algorithms compared favorably with the state-of-the-art classification algorithm including random forest and deep neural network, via extensive simulation studies and two real data applications. The new algorithms are implemented in an updated version of the R package RaSEn.

Journal of Computational and Graphical StatisticsVol. 34(3)
New York University (US)
National Science Foundation, York University, National Institutes of Health
Openalex Percentile: Top 83%
Text and Document Classification Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Multi-label Random Subspace Ensemble Classification — Yang Feng, Jianan Zhu, et al. · Journal of Computational and Graphical Statistics (2024) | TGRS Research Map | TGRS