Kyoungok Kim
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
Kyoungok Kim has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Jaewook Lee
Seoul National University
5 shared publications Cheong Rok Lee
Department of Data Science, Seoul National University of Science & Technology (SeoulTech), 232 Gongreungno, Nowon-gu, Seoul, 01811, Republic of Korea
2 shared publicationsChi-Hyuck Jun
Department of Industrial & Management Engineering, Pohang University of Science and Technology, San 31 Hyojadong, Pohang 790-784, Korea
1 shared publicationChi-Hyuk Jun
1 shared publicationDaewon Lee
1 shared publication- Dain Lee
Seoul National University of Science and Technology
1 shared publication
Latest Publications
- 28 July 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 332
Recommendation diversification via user-centric subprofiles and global item clusters
- 28 July 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 332
Recommendation diversification via user-centric subprofiles and global item clusters
- 11 July 2026
- Published by SAGE Publications in Intelligent Data Analysis: An International Journal
A new user similarity model using item genre information for collaborative filtering
Collaborative filtering is one of the most widely used approaches in recommendation systems. To enhance the performance of collaborative filtering, it is important to accurately identify similar users or items using a user-item rating matrix. Most similarity measures used in user-based collaborative filtering calculate similarity using the co-rated items between users. However, they suffer from the cold-start problem, because the user-item rating matrix is generally very sparse. To address this issue, this study proposes new similarity measures that exploit item genre information. The proposed similarity measures utilize either the number of rated items per genre or the average rating of genres and they were evaluated by different rating prediction methods including methods to aggregate the predicted ratings for multiple genres to which the item belongs. In addition, this study also proposed an approach to hybridize the proposed similarity measure with conventional similarity measures that do not exploit item genre information. The performance of the proposed similarity measures and the hybrid similarity measures was evaluated using three metrics such as MAE, F1, and NDCG and the empirical results revealed which proposed measures were superior to the others and confirmed the effectiveness and usefulness of the hybrid similarity measures.
- 11 July 2026
- Published by SAGE Publications in Intelligent Data Analysis: An International Journal
A new user similarity model using item genre information for collaborative filtering
Collaborative filtering is one of the most widely used approaches in recommendation systems. To enhance the performance of collaborative filtering, it is important to accurately identify similar users or items using a user-item rating matrix. Most similarity measures used in user-based collaborative filtering calculate similarity using the co-rated items between users. However, they suffer from the cold-start problem, because the user-item rating matrix is generally very sparse. To address this issue, this study proposes new similarity measures that exploit item genre information. The proposed similarity measures utilize either the number of rated items per genre or the average rating of genres and they were evaluated by different rating prediction methods including methods to aggregate the predicted ratings for multiple genres to which the item belongs. In addition, this study also proposed an approach to hybridize the proposed similarity measure with conventional similarity measures that do not exploit item genre information. The performance of the proposed similarity measures and the hybrid similarity measures was evaluated using three metrics such as MAE, F1, and NDCG and the empirical results revealed which proposed measures were superior to the others and confirmed the effectiveness and usefulness of the hybrid similarity measures.
- 16 February 2026
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 17 (3) , 122
Robust isolation forest using soft sparse random projection and valley emphasis method
- 16 February 2026
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 17 (3) , 122
Robust isolation forest using soft sparse random projection and valley emphasis method
- Open Access
- 15 July 2025
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 179
Enhancing spatiotemporal demand prediction in transportation systems through region generation using soft clustering
- 15 July 2025
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 179
Open AccessEnhancing spatiotemporal demand prediction in transportation systems through region generation using soft clustering
- Open Access
Robust Isolation Forest using Soft Sparse Random Projection and Valley Emphasis Method
Isolation Forest (iForest) is an unsupervised anomaly detection algorithm designed to effectively detect anomalies under the assumption that anomalies are ``few and different." Various studies have aimed to enhance iForest, but the resulting algorithms often exhibited significant performance disparities across datasets. Additionally, the challenge of isolating rare and widely distributed anomalies persisted in research focused on improving splits. To address these challenges, we introduce Robust iForest (RiForest). RiForest leverages both existing features and random hyperplanes obtained through soft sparse random projection to identify superior split features for anomaly detection, independent of datasets. It utilizes the underutilized valley emphasis method for optimal split point determination and incorporates sparsity randomization in soft sparse random projection for enhanced anomaly detection robustness. Across 24 benchmark datasets, experiments demonstrate RiForest's consistent outperformance of existing algorithms in anomaly detection, emphasizing stability and robustness to noise variables.
Open AccessRobust Isolation Forest using Soft Sparse Random Projection and Valley Emphasis Method
Isolation Forest (iForest) is an unsupervised anomaly detection algorithm designed to effectively detect anomalies under the assumption that anomalies are ``few and different." Various studies have aimed to enhance iForest, but the resulting algorithms often exhibited significant performance disparities across datasets. Additionally, the challenge of isolating rare and widely distributed anomalies persisted in research focused on improving splits. To address these challenges, we introduce Robust iForest (RiForest). RiForest leverages both existing features and random hyperplanes obtained through soft sparse random projection to identify superior split features for anomaly detection, independent of datasets. It utilizes the underutilized valley emphasis method for optimal split point determination and incorporates sparsity randomization in soft sparse random projection for enhanced anomaly detection robustness. Across 24 benchmark datasets, experiments demonstrate RiForest's consistent outperformance of existing algorithms in anomaly detection, emphasizing stability and robustness to noise variables.
- Open Access
- 3 December 2024
- Published by Institution of Engineering and Technology (IET) in IET Intelligent Transport Systems
- Vol. 18 (S1) , 2869-2883
Development of an enhanced base unit generation framework for predicting demand in free‐floating micro‐mobility
Accurate demand forecasting has become increasingly necessary in the burgeoning field of free‐floating micro‐mobility systems. However, for model training, the service area must be divided into specific areal units, which often involves grid‐based methods. Although these methods are feasible and provide a uniform area division, they are highly susceptible to the Modifiable Areal Unit Problem (MAUP), which is a critical issue in spatial data analysis. Although MAUP can adversely affect predictive model learning, studies addressing this issue are scarce. Therefore, a novel base areal unit generation algorithm is proposed that employs a clustering approach to enhance the prediction accuracy in free‐floating micro‐mobility system demand. The method identifies suitable base areal units by merging smaller ones while considering the similarities in temporal usage patterns and distances between different areas, mitigating the impact of MAUP during model learning. The approach was evaluated using shared e‐scooter data from two cities, Kansas City and Minneapolis, and it was compared to the traditional grid method. The findings indicate that the proposed framework generally improves prediction performance within the newly defined areal units.
- 3 December 2024
- Published by Institution of Engineering and Technology (IET) in IET Intelligent Transport Systems
- Vol. 18 (S1) , 2869-2883
Open AccessDevelopment of an enhanced base unit generation framework for predicting demand in free‐floating micro‐mobility
Accurate demand forecasting has become increasingly necessary in the burgeoning field of free‐floating micro‐mobility systems. However, for model training, the service area must be divided into specific areal units, which often involves grid‐based methods. Although these methods are feasible and provide a uniform area division, they are highly susceptible to the Modifiable Areal Unit Problem (MAUP), which is a critical issue in spatial data analysis. Although MAUP can adversely affect predictive model learning, studies addressing this issue are scarce. Therefore, a novel base areal unit generation algorithm is proposed that employs a clustering approach to enhance the prediction accuracy in free‐floating micro‐mobility system demand. The method identifies suitable base areal units by merging smaller ones while considering the similarities in temporal usage patterns and distances between different areas, mitigating the impact of MAUP during model learning. The approach was evaluated using shared e‐scooter data from two cities, Kansas City and Minneapolis, and it was compared to the traditional grid method. The findings indicate that the proposed framework generally improves prediction performance within the newly defined areal units.
- Open Access
- 4 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 144316-144336
AdaBoost.RDT: AdaBoost Integrated With Residual-Based Decision Tree for Demand Prediction of Bike Sharing Systems Under Extreme Demands
Boosting algorithms are widely used for predicting demand in bike-sharing systems (BSSs). However, these systems often encounter sudden spikes in demand (extreme demand). Ordinary boosting algorithms tend to be biased toward extreme demands, leading to increased prediction errors in other scenarios. Noise-robust boosting algorithms perform well with normal samples; however, for normal samples in datasets containing extreme demands, their accuracy remains poor for extreme demand samples. To address these limitations, we propose a novel boosting algorithm, AdaBoost.RDT, which integrates adaptive boosting with a residual-based decision tree. Our approach aims to enhance prediction accuracy for extreme demand scenarios without compromising performance in normal situations. By incorporating a decision tree (DT) model at each boosting iteration to predict residuals from the base model, we effectively identify and improve predictions for underestimated extreme demands. AdaBoost.RDT was compared with six boosting algorithms, including noise-robust variants, using Seoul Bike and Daejeon Bike data. Experimental results demonstrated that the DT model within AdaBoost.RDT effectively distinguished between over- and underestimated samples, significantly reducing prediction errors for extreme demand scenarios with compromised accuracy for very low demands. On the stance in operating a shared bicycle service, it is important to alleviate the customer dissatisfaction caused by not being able to rent bicycle encouraged by extreme events. Therefore, it should be achieved even if it requires compromised accuracy for very low demands.
- 4 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 144316-144336
Open AccessAdaBoost.RDT: AdaBoost Integrated With Residual-Based Decision Tree for Demand Prediction of Bike Sharing Systems Under Extreme Demands
Boosting algorithms are widely used for predicting demand in bike-sharing systems (BSSs). However, these systems often encounter sudden spikes in demand (extreme demand). Ordinary boosting algorithms tend to be biased toward extreme demands, leading to increased prediction errors in other scenarios. Noise-robust boosting algorithms perform well with normal samples; however, for normal samples in datasets containing extreme demands, their accuracy remains poor for extreme demand samples. To address these limitations, we propose a novel boosting algorithm, AdaBoost.RDT, which integrates adaptive boosting with a residual-based decision tree. Our approach aims to enhance prediction accuracy for extreme demand scenarios without compromising performance in normal situations. By incorporating a decision tree (DT) model at each boosting iteration to predict residuals from the base model, we effectively identify and improve predictions for underestimated extreme demands. AdaBoost.RDT was compared with six boosting algorithms, including noise-robust variants, using Seoul Bike and Daejeon Bike data. Experimental results demonstrated that the DT model within AdaBoost.RDT effectively distinguished between over- and underestimated samples, significantly reducing prediction errors for extreme demand scenarios with compromised accuracy for very low demands. On the stance in operating a shared bicycle service, it is important to alleviate the customer dissatisfaction caused by not being able to rent bicycle encouraged by extreme events. Therefore, it should be achieved even if it requires compromised accuracy for very low demands.
- 6 September 2024
- Published by Springer Nature
- p. 217-237
Fully Homomorphic Training and Inference on Binary Decision Tree and Random Forest
- 6 September 2024
- Published by Springer Nature
- p. 217-237
Fully Homomorphic Training and Inference on Binary Decision Tree and Random Forest
- 3 September 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 166
Fuzzy anomaly scores for Isolation Forest
- 3 September 2024
- Published by Elsevier in Applied Soft Computing
- Vol. 166
Fuzzy anomaly scores for Isolation Forest
- 14 March 2024
- Published by SAGE Publications in International Journal of Knowledge-based and Intelligent Engineering Systems
- Vol. 28 (1) , 133-147
Two-step model based on XGBoost for predicting artwork prices in auction markets
Art markets globally have grown, making artwork an investment of note. Precise valuation is pivotal for optimal returns. We introduce a two-step model with a two-level regressor, utilizing extreme gradient boosting (XGBoost) for accurate artwork price prediction. The model encompasses a price-class classifier and regressors for individual categories. This captures diverse factor influences, combining predictions to reduce misclassification risks. Visual features further enhance accuracy through the second-step two-level regressor. Experiments on Korean art auction data demonstrate the superiority of our two-step model with the two-level regressor over one-step and two-step alternatives, as well as the hedonic pricing model. While visual features affected one- and two-step models’ training, they boosted performance when integrated into the second-level decision tree, reducing first-level residuals. This emphasizes the two-level regressor’s efficacy in incorporating visual elements for artwork valuation. Our study highlights the potential of our approach in the field of artwork valuation.
- 14 March 2024
- Published by SAGE Publications in International Journal of Knowledge-based and Intelligent Engineering Systems
- Vol. 28 (1) , 133-147
Two-step model based on XGBoost for predicting artwork prices in auction markets
Art markets globally have grown, making artwork an investment of note. Precise valuation is pivotal for optimal returns. We introduce a two-step model with a two-level regressor, utilizing extreme gradient boosting (XGBoost) for accurate artwork price prediction. The model encompasses a price-class classifier and regressors for individual categories. This captures diverse factor influences, combining predictions to reduce misclassification risks. Visual features further enhance accuracy through the second-step two-level regressor. Experiments on Korean art auction data demonstrate the superiority of our two-step model with the two-level regressor over one-step and two-step alternatives, as well as the hedonic pricing model. While visual features affected one- and two-step models’ training, they boosted performance when integrated into the second-level decision tree, reducing first-level residuals. This emphasizes the two-level regressor’s efficacy in incorporating visual elements for artwork valuation. Our study highlights the potential of our approach in the field of artwork valuation.