Jinho Choi

Jinho Choi

Auto-generated profile, based on publicly available information

Jinho Choi

Department of Computer Science and Engineering, Konkuk University, Gwangjin-gu, Seoul, Republic of Korea

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
10 November 2025
Verified
Conference Paper
Open access
HBHye-Yoon Baek
Hye-Yoon Baek
JCJinho Choi
Jinho Choi
JSJimyeung Seo
Jimyeung Seo
XJXiongnan Jin
Xiongnan Jin
DLDongcheon Lee
Dongcheon Lee
BOByungkook Oh
Byungkook Oh

6 November 2026
Verified
Conference Paper
Open access
JCJinho Choi
Jinho Choi
HBHye-Yoon Baek
Hye-Yoon Baek
SPSang-Hyun Park
Sang-Hyun Park
SKSang-June Kim
Sang-June Kim
HYHyeongjun Yang
Hyeongjun Yang
BOByungkook Oh
Byungkook Oh
Knowledge graph question answering (KGQA) increasingly relies on graph-based retrieval-augmented generation (GraphRAG). However, graph retrievers are trained under path-level weak supervision, which treats every triple on an answer-reaching path as equally informative. Retrieved subgraphs thus contain spurious triples that reach the answer without causally supporting it, leaving noise filtering to the reasoner. We propose Ca usality-Guided S purious E vidence Pruning with G Flow Net (CaseFlow), which internalizes spurious-evidence pruning into the retriever by reformulating retrieval as a flow-guided pruning process. Repurposed from a candidate generator into a pruner, the GFlowNet removes spurious evidence while retaining answer-supporting causal structure. To make this pruning causally informed and tractable, a relation-conditioned disentanglement encoder supplies a causal-relevance proxy for the chunk-level pruning prior, and adaptive relation-coherent chunks bound the action space. CaseFlow outperforms strong GraphRAG retrievers on the WebQSP, CWQ, and MetaQA-3hop benchmarks, with the largest gains in complex multi-hop reasoning. Our code is available at https://github.com/ChoiPi2/CaseFlow

12 November 2025 in IEEE Access
Verified
Journal Article
Open access
WJWooseok Jeong
Wooseok Jeong
YKYoung-Jin Kim
Young-Jin Kim
HKHae-Yoon Koo
Hae-Yoon Koo
JSJimyeung Seo
Jimyeung Seo
JCJinho Choi
Jinho Choi
BOByungkook Oh
Byungkook Oh
Large language models (LLMs) have recently demonstrated remarkable potential for recommendation by reframing it as a text-generation task. Recent LLM-based approaches apply GNNs to capture higher-order collaborative patterns from interaction graphs but handle textual data separately, failing to extract higher-order semantic patterns from text. One potential solution is to construct semantic graphs to better capture such semantic relationships. However, naively selecting top-k connections by profile similarity introduces significant challenges: 1) preference gap between textual similarity and actual user behavior, and 2) semantic distortion where identical attributes carry different meanings for users versus items. To overcome these issues, we propose an Interaction-Grounded Semantic Recommender (IGSRec), which constructs an interaction-grounded semantic graph by aligning profile-based connections with observed interactions. IGSRec employs an LLM-based profile generator, constructs a top-k semantic graph, then refines it using a learnable scoring function that identifies relevant semantic neighborhoods conditioned on user-item interactions. Through dual-graph propagation over both the refined semantic and interaction graphs, IGSRec captures higher-order semantic and collaborative patterns. Experiments on Amazon Review benchmarks demonstrate state-of-the-art performance in both direct and sequential recommendation tasks. Our code and data are publicly available at https://github.com/oseoko/IGSRec/.