Sung-Hwan Min
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sung-Hwan Min has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
Ingoo Han
6 shared publicationsHun-Woo Yoo
Yonsei University
1 shared publicationHyoung Yong Lee
Department of Management Engineering, Korea Advanced Institute of Science and Technology, Seoul 130-722, South Korea
1 shared publicationJumin Lee
1 shared publicationKwang-Kyu Seo
SangMyung University
1 shared publication- Kyong Joo Oh
Department of Industrial Engineering, Yonsei University, Seoul 03722, Korea
1 shared publication
Latest Publications
- Open Access
- 31 March 2016
- Published by Korea Intelligent Information System Society in Journal of Intelligence and Information Systems
- Vol. 22 (1) , 139-157
Investigating Dynamic Mutation Process of Issues Using Unstructured Text Analysis
Investigating Dynamic Mutation Process of Issues Using Unstructured Text Analysis Random Subspace;Bankruptcy Prediction;Ensemble;Genetic Algorithms; Bankruptcy involves considerable costs, so it can have significant effects on a country's economy. Thus, bankruptcy prediction is an important issue. Over the past several decades, many researchers have addressed topics associated with bankruptcy prediction. Early research on bankruptcy prediction employed conventional statistical methods such as univariate analysis, discriminant analysis, multiple regression, and logistic regression. Later on, many studies began utilizing artificial intelligence techniques such as inductive learning, neural networks, and case-based reasoning. Currently, ensemble models are being utilized to enhance the accuracy of bankruptcy prediction. Ensemble classification involves combining multiple classifiers to obtain more accurate predictions than those obtained using individual models. Ensemble learning techniques are known to be very useful for improving the generalization ability of the classifier. Base classifiers in the ensemble must be as accurate and diverse as possible in order to enhance the generalization ability of an ensemble model. Commonly used methods for constructing ensemble classifiers include bagging, boosting, and random subspace. The random subspace method selects a random feature subset for each classifier from the original feature space to diversify the base classifiers of an ensemble. Each ensemble member is trained by a randomly chosen feature subspace from the original feature set, and predictions from each ensemble member are combined by an aggregation method. The k-nearest neighbors (KNN) classifier is robust with respect to variations in the dataset but is very sensitive to changes in the feature space. For this reason, KNN is a good classifier for the random subspace method. The KNN random subspace ensemble model has been shown to be very effective for improving an individual KNN model. The k parameter of KNN base classifiers and selected feature subsets for base classifiers play an important role in determining the performance of the KNN ensemble model. However, few studies have focused on optimizing the k parameter and feature subsets of base classifiers in the ensemble. This study proposed a new ensemble method that improves upon the performance KNN ensemble model by optimizing both k parameters and feature subsets of base classifiers. A genetic algorithm was used to optimize the KNN ensemble model and improve the prediction accuracy of the ensemble model. The proposed model was applied to a bankruptcy prediction problem by using a real dataset from Korean companies. The research data included 1800 externally non-audited firms that filed for bankruptcy (900 cases) or non-bankruptcy (900 cases). Initially, the dataset consisted of 134 financial ratios. Prior to the experiments, 75 financial ratios were selected based on an independent sample t-test of each financial ratio as an input variable and bankruptcy or non-bankruptcy as an output variable. Of these, 24 financial ratios were selected by using a logistic regression backward feature selection method. The complete dataset was separated into two parts: training and validation. The training dataset was further divided into two portions: one for the training model and the other to avoid overfitting. The prediction accuracy against this dataset was used to determine the fitness value in order to avoid overfitting. The validation dataset was used to evaluate the effectiveness of the final model. A 10-fold cross-validation was implemented to compare the performances of the proposed model and other models. To evaluate the effectiveness of the proposed model, the classification accuracy of the proposed model was compared with that of other models. The Q-statistic values and average classification accuracies of base classifiers were investigated. The experimental results showed that the proposed model outperformed other models, such as the single model and random subspace ensemble model.
- 31 March 2016
- Published by Korea Intelligent Information System Society in Journal of Intelligence and Information Systems
- Vol. 22 (1) , 139-157
Open AccessInvestigating Dynamic Mutation Process of Issues Using Unstructured Text Analysis
Investigating Dynamic Mutation Process of Issues Using Unstructured Text Analysis Random Subspace;Bankruptcy Prediction;Ensemble;Genetic Algorithms; Bankruptcy involves considerable costs, so it can have significant effects on a country's economy. Thus, bankruptcy prediction is an important issue. Over the past several decades, many researchers have addressed topics associated with bankruptcy prediction. Early research on bankruptcy prediction employed conventional statistical methods such as univariate analysis, discriminant analysis, multiple regression, and logistic regression. Later on, many studies began utilizing artificial intelligence techniques such as inductive learning, neural networks, and case-based reasoning. Currently, ensemble models are being utilized to enhance the accuracy of bankruptcy prediction. Ensemble classification involves combining multiple classifiers to obtain more accurate predictions than those obtained using individual models. Ensemble learning techniques are known to be very useful for improving the generalization ability of the classifier. Base classifiers in the ensemble must be as accurate and diverse as possible in order to enhance the generalization ability of an ensemble model. Commonly used methods for constructing ensemble classifiers include bagging, boosting, and random subspace. The random subspace method selects a random feature subset for each classifier from the original feature space to diversify the base classifiers of an ensemble. Each ensemble member is trained by a randomly chosen feature subspace from the original feature set, and predictions from each ensemble member are combined by an aggregation method. The k-nearest neighbors (KNN) classifier is robust with respect to variations in the dataset but is very sensitive to changes in the feature space. For this reason, KNN is a good classifier for the random subspace method. The KNN random subspace ensemble model has been shown to be very effective for improving an individual KNN model. The k parameter of KNN base classifiers and selected feature subsets for base classifiers play an important role in determining the performance of the KNN ensemble model. However, few studies have focused on optimizing the k parameter and feature subsets of base classifiers in the ensemble. This study proposed a new ensemble method that improves upon the performance KNN ensemble model by optimizing both k parameters and feature subsets of base classifiers. A genetic algorithm was used to optimize the KNN ensemble model and improve the prediction accuracy of the ensemble model. The proposed model was applied to a bankruptcy prediction problem by using a real dataset from Korean companies. The research data included 1800 externally non-audited firms that filed for bankruptcy (900 cases) or non-bankruptcy (900 cases). Initially, the dataset consisted of 134 financial ratios. Prior to the experiments, 75 financial ratios were selected based on an independent sample t-test of each financial ratio as an input variable and bankruptcy or non-bankruptcy as an output variable. Of these, 24 financial ratios were selected by using a logistic regression backward feature selection method. The complete dataset was separated into two parts: training and validation. The training dataset was further divided into two portions: one for the training model and the other to avoid overfitting. The prediction accuracy against this dataset was used to determine the fitness value in order to avoid overfitting. The validation dataset was used to evaluate the effectiveness of the final model. A 10-fold cross-validation was implemented to compare the performances of the proposed model and other models. To evaluate the effectiveness of the proposed model, the classification accuracy of the proposed model was compared with that of other models. The Q-statistic values and average classification accuracies of base classifiers were investigated. The experimental results showed that the proposed model outperformed other models, such as the single model and random subspace ensemble model.
- 30 March 2016
- Published by The Society of Korea Industrial and Systems Engineering in Journal of Society of Korea Industrial and Systems Engineering
- Vol. 39 (1) , 105-115
Improving an Ensemble Model Using Instance Selection Method
- 30 March 2016
- Published by The Society of Korea Industrial and Systems Engineering in Journal of Society of Korea Industrial and Systems Engineering
- Vol. 39 (1) , 105-115
Improving an Ensemble Model Using Instance Selection Method
- 1 October 2006
- Published by Elsevier in Expert Systems with Applications
- Vol. 31 (3) , 652-660
Hybrid genetic algorithms and support vector machines for bankruptcy prediction
- 1 October 2006
- Published by Elsevier in Expert Systems with Applications
- Vol. 31 (3) , 652-660
Hybrid genetic algorithms and support vector machines for bankruptcy prediction
- 1 August 2006
- Published by Elsevier in Expert Systems with Applications
- Vol. 31 (2) , 241-247
An evolutionary approach to the combination of multiple classifiers to predict a stock price index
- 1 August 2006
- Published by Elsevier in Expert Systems with Applications
- Vol. 31 (2) , 241-247
An evolutionary approach to the combination of multiple classifiers to predict a stock price index
- 30 April 2006
- Published by Elsevier in Expert Systems with Applications
- Vol. 30 (3) , 527-534
Portfolio algorithm based on portfolio beta using genetic algorithm
- 30 April 2006
- Published by Elsevier in Expert Systems with Applications
- Vol. 30 (3) , 527-534
Portfolio algorithm based on portfolio beta using genetic algorithm
- 28 February 2005
- Published by Elsevier in Expert Systems with Applications
- Vol. 28 (2) , 189-199
Detection of the customer time-variant pattern for improving recommender systems
- 28 February 2005
- Published by Elsevier in Expert Systems with Applications
- Vol. 28 (2) , 189-199
Detection of the customer time-variant pattern for improving recommender systems
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 458-466
Artificial Neural Network Based Life Cycle Assessment Model for Product Concepts Using Product Classification Method
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 458-466
Artificial Neural Network Based Life Cycle Assessment Model for Product Concepts Using Product Classification Method
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 387-393
Recommender Systems Using Support Vector Machines
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 387-393
Recommender Systems Using Support Vector Machines
- 1 January 2005
- Published by Springer Nature
- p. 480-485
Dynamic Fuzzy Clustering for Recommender Systems
- 1 January 2005
- Published by Springer Nature
- p. 480-485
Dynamic Fuzzy Clustering for Recommender Systems
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 313-319
Optimizing Collaborative Filtering Recommender Systems
- 1 January 2005
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 313-319
Optimizing Collaborative Filtering Recommender Systems