Sang-Min Choi

Prof. Sang-Min Choi


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 January 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
Sang-Min ChoiSang-Min Choi
Sang-Min Choi
DLDongwoo Lee
Dongwoo Lee
KJKiyoung Jang
Kiyoung Jang
CPChihyun Park
Chihyun Park
Suwon LeeSuwon Lee
Suwon Lee
With the development of the Web, users spend more time accessing information that they seek. As a result, recommendation systems have emerged to provide users with preferred contents by filtering abundant information, along with providing means of exposing search results to users more effectively. These recommendation systems operate based on the user reactions to items or on the various user or item features. It is known that recommendation results based on sparse datasets are less reliable because recommender systems operate according to user responses. Thus, we propose a method to improve the dataset sparsity and increase the accuracy of the prediction results by using item features with user responses. A method based on the content-based filtering concept is proposed to extract category rates from the user–item matrix according to the user preferences and to organize these into vectors. Thereafter, we present a method to filter the user–item matrix using the extracted vectors and to regenerate the input matrix for collaborative filtering (CF). We compare the prediction results of our approach and conventional CF using the mean absolute error and root mean square error. Moreover, we calculate the sparsity of the regenerated matrix and the existing input matrix, and demonstrate that the regenerated matrix is more dense than the existing one. By computing the Jaccard similarity between the item sets in the regenerated and existing matrices, we verify the matrix distinctions. The results of the proposed methods confirm that if the regenerated matrix is used as the CF input, a denser matrix with higher predictive accuracy can be constructed than when using conventional methods. The validity of the proposed method was verified by analyzing the effect of the input matrix composed of high average ratings on the CF prediction performance. The low sparsity and high prediction accuracy of the proposed method are verified by comparisons with the results by conventional methods. Improvements of approximately 16% based on K-nearest neighbor and 15% based on singular value decomposition, and a three times improvement in the sparsity based on regenerated and original matrices are obtained. We propose a matrix reconstruction method that can improve the performance of recommendations.

26 August 2020 in IEEE Access
Verified
Journal Article
Open access
Sang-Min ChoiSang-Min Choi
Sang-Min Choi
KJKiyoung Jang
Kiyoung Jang
TLTae-Dong Lee
Tae-Dong Lee
AKAbdallah Khreishah
Abdallah Khreishah
WNWonjong Noh
Wonjong Noh
Recently, recommender systems have been used in various fields. However, they are still plagued by many issues, including cold-start and sparsity problems. The cold-start problem occurs when users are unable to make recommendations to other users owing to a complete lack of information about certain items. This problem can exist both at the user side and the item side. User-side cold-start problems occur when new users access the systems; item-side cold-start problems occur when new items are added to databases. In this study, we addressed the item-side cold-start problem using the concept of weak supervision. First, a new process for identifying feature based representative reviewers in a rater group was designed. Then, we developed a method to predict the expected preferences for new items by combining content-based filtering and the preferences of representative users. Through extensive experiments, we first confirmed that in comparison to existing methods, the proposed approach provided enhanced accuracy, which was evaluated by determining a mean absolute error for the average ratings. Then, we compared the proposed scheme with the collaborative filtering (CF) and neural CF approaches (NCF). The estimation by the proposed approach was 21% and 38% more accurate than CF and NCF in terms of mean absolute error (MAE), respectively. In future, the proposed framework can be applied in various recommender systems as a core function.

30 April 2024 in Sensors
Verified
Journal Article
Open access
PDF file
RSRawoo Shin
Rawoo Shin
BCBogyu Choi
Bogyu Choi
Sang-Min ChoiSang-Min Choi
Sang-Min Choi
Suwon LeeSuwon Lee
Suwon Lee
Virtual reality (VR) is used in many fields, including entertainment, education, training, and healthcare, because it allows users to experience challenging and dangerous situations that may be impossible in real life. Advances in head-mounted display technology have enhanced visual immersion, offering content that closely resembles reality. However, several factors can reduce VR immersion, particularly issues with the interactions in the virtual world, such as locomotion. Additionally, the development of locomotion technology is occurring at a moderate pace. Continuous research is being conducted using hardware such as treadmills, and motion tracking using depth cameras, but they are costly and space-intensive. This paper presents a walk-in-place (WIP) algorithm that uses Mocopi, a low-cost motion-capture device, to track user movements in real time. Additionally, its feasibility for VR applications was evaluated by comparing its performance with that of a treadmill using the absolute trajectory error metric and survey data collected from human participants. The proposed WIP algorithm with low-cost Mocopi exhibited performance similar to that of the high-cost treadmill, with significantly positive results for spatial awareness. This study is expected to contribute to solving the issue of spatial constraints when experiencing infinite virtual spaces.

15 January 2025 in Electronics
Verified
Journal Article
Open access
PDF file
MJMyeong Jin
Myeong Jin
Sang-Min ChoiSang-Min Choi
Sang-Min Choi
Gun-Woo KimGun-Woo Kim
Gun-Woo Kim
The rapid expansion of medical information has resulted in named entity recognition (NER) and relation extraction (RE) essential for clinical decision support systems. Medical texts often contain specialized vocabulary, ambiguous abbreviations, synonyms, polysemous terms, and overlapping entities, which introduce significant challenges to the extraction process. Existing approaches, which typically rely on single models such as BiLSTM or BERT, often struggle with these complexities. Although large language models (LLMs) have shown promise in various NLP tasks, they still face limitations in handling token-level tasks critical for medical NER and RE. To address these challenges, we propose COMCARE, a collaborative ensemble framework for context-aware medical NER and RE that integrates multiple pre-trained language models through a collaborative decision strategy. For NER, we combined PubMedBERT and PubMed-T5, leveraging PubMedBERT’s contextual understanding and PubMed-T5’s generative capabilities to handle diverse forms of medical terminology, from standard domain-specific jargon to nonstandard representations, such as uncommon abbreviations and out-of-vocabulary (OOV) terms. For RE, we integrated general-domain BERT with biomedical-specific BERT and PubMed-T5, utilizing token-level information from the NER module to enhance the context-aware entity-based relation extraction. To effectively handle long-range dependencies and maintain consistent performance across diverse texts, we implemented a semantic chunking approach and combined the model outputs through a majority voting mechanism. We evaluated COMCARE on several biomedical datasets, including BioRED, ADE, RDD, and DIANN Corpus. For BioRED, COMCARE achieved F1 scores of 93.76% for NER and 68.73% for RE, outperforming BioBERT by 1.25% and 1.74%, respectively. On the RDD Corpus, COMCARE showed F1 scores of 77.86% for NER and 86.79% for RE while achieving 82.48% for NER on ADE and 99.36% for NER on DIANN. These results demonstrate the effectiveness of our approach in handling complex medical terminology and overlapping entities, highlighting its potential to improve clinical decision support systems.

10 January 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
WKWoo-Seok Kim
Woo-Seok Kim
SLSeongho Lim
Seongho Lim
Gun-Woo KimGun-Woo Kim
Gun-Woo Kim
Sang-Min ChoiSang-Min Choi
Sang-Min Choi
Conversational recommender systems (CRSs) have garnered increasing attention for their ability to provide personalized recommendations through natural language interactions. Although large language models (LLMs) have shown potential in recommendation systems owing to their superior language understanding and reasoning capabilities, extracting and utilizing implicit user preferences from conversations remains a formidable challenge. This paper proposes a method that leverages LLMs to extract implicit preferences and explicitly incorporate them into the recommendation process. Initially, LLMs identify implicit user preferences from conversations, which are then refined into fine-grained numerical values using a BERT-based multi-label classifier to enhance recommendation precision. The proposed approach is validated through experiments on three comprehensive datasets: the Reddit Movie Dataset (8413 dialogues), Inspired (825 dialogues), and ReDial (2311 dialogues). Results show that our approach considerably outperforms traditional CRS methods, achieving a 23.3% improvement in Recall@20 on the ReDial dataset and a 7.2% average improvement in recommendation accuracy across all datasets with GPT-3.5-turbo and GPT-4. These findings highlight the potential of using LLMs to extract and utilize implicit conversational information, effectively enhancing the quality of recommendations in CRSs.

9 October 2024 in IEEE Access
Verified
Journal Article
Open access
MKMinje Kim
Minje Kim
Suwon LeeSuwon Lee
Suwon Lee
Sang-Min ChoiSang-Min Choi
Sang-Min Choi
Deep learning models have significantly addressed the challenges of multivariate time series forecasting. Recently, Transformer-based models which have primarily focused on either temporal or inter-variate (spatial) dependencies have demonstrated exceptional performance. These models decide whether to embed multivariate time series data temporally or spatially. Hence, we propose the dual embedded transformer (DEformer) which simultaneously considers both temporal and spatial dependencies. Our model enables capturing these dependencies independently through two distinct encoders. The temporal encoder, which processes the entire time series of each variate, is designed to learn temporal dependency. Conversely, the spatial encoder, which processes the multivariate data at each time step, is optimized to capture spatial dependency. Both encoders share an identical architecture, comprising an attention mechanism to model correlations and a feed-forward network to enhance feature representation. Empirical evaluations conducted on complex real-world datasets, demonstrate that our method surpasses state-of-the-art approaches.