Haemin Jung

Dr. Haemin Jung

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
8 January 2020 in Journal of Intelligent Information Systems
Verified
Journal Article
Closed access
PDF file
HJHaemin Jung
Haemin Jung
WKWooju Kim
Wooju Kim

8 August 2022 in Sustainability
Verified
Journal Article
Open access
PDF file
JKJungHee Kim
JungHee Kim
HJHaemin Jung
Haemin Jung
WKWooju Kim
Wooju Kim
Financial institutions face challenges of fraud due to an increased number of online transactions and sophisticated fraud techniques. Although fraud detection systems have been implemented to detect fraudulent transactions in online banking, many systems just use conventional rule-based approaches. Rule-based detection systems have a difficulty in updating and managing their rules and conditions manually. Additionally, generated from the few fraud cases, the rules are general rather than specific to each user. In this paper, we propose a personalized alarm model to detect frauds in online banking transactions using sequence pattern mining on each user’s normal transaction log. We assumed that a personalized fraud detection model is more effective in responding to the rapid increase in online banking users and diversified fraud patterns. Moreover, we focused on the fact that fraudulent transactions are very different from each user’s usual transactions. Our proposed model divides each user’s log into transactions, extracts a set of sequence patterns, and uses it to determine whether a new incoming transaction is fraudulent. The incoming transaction is divided into multiple windows, and if the normal patterns are not found in the consecutive windows, an alarm is sounded. We applied the model to a real-world dataset and showed that our model outperforms the rule-based model and the Markov chain model. Although more experiments on additional datasets are needed, our personalized alarm model can be applied to real-world systems.

6 September 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
HJHaemin Jung
Haemin Jung
HPHeesung Park
Heesung Park
KLKwangyon Lee
Kwangyon Lee
Recommender systems play a crucial role in personalizing online user experiences by creating user profiles based on user–item interactions and preferences. Knowledge graphs (KGs) are intricate data structures that encapsulate semantic information, expressing users and items in a meaningful way. Although recent deep learning-based recommendation algorithms that embed KGs have demonstrated impressive performance, the richness of semantics and explainability embedded in the KGs are often lost due to the opaque nature of vector representations in deep neural networks. To address this issue, we propose a novel user profiling method for recommender systems that can encapsulate user preferences while preserving the original semantics of the KGs, using frequent subgraph mining. Our approach involves creating user profile vectors from a set of frequent subgraphs that contain information about user preferences and the strength of those preferences, measured by frequency. Subsequently, we trained a deep neural network model to learn the relationship between users and items, thereby facilitating effective recommendations using the neural network’s approximation ability. We evaluated our user profiling methodology on movie data and found that it demonstrated competitive performance, indicating that our approach can accurately represent user preferences while maintaining the semantics of the KGs. This work, therefore, presents a significant step towards creating more transparent and effective recommender systems that can be beneficial for a wide range of applications and readers interested in this field.

20 January 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
KLKwangyon Lee
Kwangyon Lee
HJHaemin Jung
Haemin Jung
JHJune Hong
June Hong
WKWooju Kim
Wooju Kim
In many areas, vast amounts of information are rapidly accumulating in the form of ontology-based knowledge graphs, and the use of information in these forms of knowledge graphs is becoming increasingly important. This study proposes a novel method for efficiently learning frequent subgraphs (i.e., knowledge) from ontology-based graph data. An ontology-based large-scale graph is decomposed into small unit subgraphs, which are used as the unit to calculate the frequency of the subgraph. The frequent subgraphs are extracted through candidate generation and chunking processes. To verify the usefulness of the extracted frequent subgraphs, the methodology was applied to movie rating prediction. Using the frequent subgraphs as user profiles, the graph similarity between the rating graph and new item graph was calculated to predict the rating. The MovieLens dataset was used for the experiment, and a comparison showed that the proposed method outperformed other widely used recommendation methods. This study is meaningful in that it proposed an efficient method for extracting frequent subgraphs while maintaining semantic information and considering scalability in large-scale graphs. Furthermore, the proposed method can provide results that include semantic information to serve as a logical basis for rating prediction or recommendation, which existing methods are unable to provide.

31 December 2024 in PLOS ONE
Verified
Journal Article
Open access
PDF file
SHSeongil Han
Seongil Han
HJHaemin Jung
Haemin Jung
Credit scoring models play a crucial role for financial institutions in evaluating borrower risk and sustaining profitability. Logistic regression is widely used in credit scoring due to its robustness, interpretability, and computational efficiency; however, its predictive power decreases when applied to complex or non-linear datasets, resulting in reduced accuracy. In contrast, tree-based machine learning models often provide enhanced predictive performance but struggle with interpretability. Furthermore, imbalanced class distributions, which are prevalent in credit scoring, can adversely impact model accuracy and robustness, as the majority class tends to dominate. Despite these challenges, research that comprehensively addresses both the predictive performance and explainability aspects within the credit scoring domain remains limited. This paper introduces the Non-pArameTric oversampling approach for Explainable credit scoring (NATE), a framework designed to address these challenges by combining oversampling techniques with tree-based classifiers to enhance model performance and interpretability. NATE incorporates class balancing methods to mitigate the impact of imbalanced data distributions and integrates interpretability features to elucidate the model’s decision-making process. Experimental results show that NATE substantially outperforms traditional logistic regression in credit risk classification, with improvements of 19.33% in AUC, 71.56% in MCC, and 85.33% in F1 Score. Oversampling approaches, particularly when used with gradient boosting, demonstrated superior effectiveness compared to undersampling, achieving optimal metrics of AUC: 0.9649, MCC: 0.8104, and F1 Score: 0.9072. Moreover, NATE enhances interpretability by providing detailed insights into feature contributions, aiding in understanding individual predictions. These findings highlight NATE’s capability in managing class imbalance, improving predictive performance, and enhancing model interpretability, demonstrating its potential as a reliable and transparent tool for credit scoring applications.

27 December 2024 in IEEE Access
Verified
Journal Article
Open access
WKWooyoung Kim
Wooyoung Kim
HJHaemin Jung
Haemin Jung
WKWooju Kim
Wooju Kim
Large language models have demonstrated exceptional performance across various natural language processing tasks. However, their reliance on unstructured text corpora for pre-training limits their effectiveness in tasks requiring structured reasoning such as multi-hop question-answering. Knowledge Graphs provide a rich, structured source of relational data, offering an opportunity to enhance the reasoning capabilities of Large language models. In this paper, we propose a novel framework, Knowledge Graph as Pre-training Corpus (KGPC), which transforms knowledge graphs into text using a multi-hop linearization process. Unlike existing approaches that linearize singular triples, our method captures the interconnected nature of knowledge graphs by linking multiple triples across multiple hops, preserving their relational structure during the pre-training phase. This structured knowledge injection improves language models’ abilities to perform complex reasoning tasks.We evaluate our approach on multi-hop reasoning benchmarks, demonstrating significant performance gains over existing models, particularly in question-answering tasks. Our results highlight the potential of multi-hop linearization in enhancing the structural reasoning capacity of language models, reducing error propagation, and improving the integration of structured knowledge into language models.