Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Byong Su Choi

dblp:172/6557 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › predictive modeling
classification
0.212016
Booster in High Dimensional Data Classification · IEEE Trans. Knowl. Data Eng. 2016
Data mining › dimensionality reduction
feature selection
0.212016
Booster in High Dimensional Data Classification · IEEE Trans. Knowl. Data Eng. 2016
Data mining › predictive modeling › classification › pattern classification
high-dimensional classification
0.212016
Booster in High Dimensional Data Classification · IEEE Trans. Knowl. Data Eng. 2016
Data mining › dimensionality reduction › feature selection
stable feature selection
0.212016
Booster in High Dimensional Data Classification · IEEE Trans. Knowl. Data Eng. 2016

Methods — techniques the papers use, named apart from their topics

q-statistic · 0.2feature selection · 0.2boosting · 0.2
YearPublicationVenuePosition
2016 Booster in High Dimensional Data Classification
abstract
Classification problems in high dimensional data with a small number of observations are becoming more common especially in microarray data. During the last two decades, lots of efficient classification models and feature selection (FS) algorithms have been proposed for higher prediction accuracies. However, the result of an FS algorithm based on the prediction accuracy will be unstable over the variations in the training set, especially in high dimensional data. This paper proposes a new evaluation measure Q-statistic that incorporates the stability of the selected feature subset in addition to the prediction accuracy. Then, we propose the Booster of an FS algorithm that boosts the value of the Q-statistic of the algorithm applied. Empirical studies based on synthetic data and 14 microarray data sets show that Booster boosts not only the value of the Q-statistic but also the prediction accuracy of the algorithm applied unless the data set is intrinsically difficult to predict with the given algorithm.
Byong Su Choi, Moon Yul Huh
IEEE Trans. Knowl. Data Eng.2