Susik Yoon
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
Susik Yoon has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Dongha Lee
Department of Artificial Intelligence, Yonsei University, Seoul, Republic of Korea
4 shared publications - Jiawei Han
University of Illinois Urbana-Champaign, Urbana, Illinois, USA
4 shared publications - SeongKu Kang
Korea University, Seoul, Republic of Korea
4 shared publications - Jae-Gil Lee
KAIST, Daejeon, Republic of Korea
3 shared publications - Byung Suk Lee
University of Vermont
2 shared publications - Hwanjun Song
Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea
2 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2503-2513
Beyond Observed Auxiliary Relations: Environment-Conditioned Modeling for Multi-Behavior Recommendation
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2503-2513
Open AccessBeyond Observed Auxiliary Relations: Environment-Conditioned Modeling for Multi-Behavior Recommendation
- Open Access
- 1 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
Improving Scientific Document Retrieval with Academic Concept Index
Adapting general-domain retrievers to scientific domains is challenging due to the scarcity of large-scale domain-specific relevance annotations and the substantial mismatch in vocabulary and information needs. Recent approaches address these issues through two independent directions that leverage large language models (LLMs): (1) generating synthetic queries for fine-tuning, and (2) generating auxiliary contexts to support relevance matching. However, both directions overlook the diverse academic concepts embedded within scientific documents, often producing redundant or conceptually narrow queries and contexts. To address this limitation, we introduce an academic concept index , which extracts key concepts from papers and organizes them guided by an academic taxonomy. This structured index serves as a foundation for improving both directions. First, we enhance the synthetic query generation with concept coverage-based generation ( CCQGen ), which adaptively conditions LLMs on uncovered concepts to generate complementary queries with broader concept coverage. Second, we strengthen the context augmentation with concept-focused auxiliary contexts ( CCExpand ), which leverages a set of document snippets that serve as concise responses to the concept-aware CCQGen queries. Extensive experiments show that incorporating the academic concept index into both query generation and context augmentation leads to higher-quality queries, better conceptual alignment, and improved retrieval performance.
- 1 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
Open AccessImproving Scientific Document Retrieval with Academic Concept Index
Adapting general-domain retrievers to scientific domains is challenging due to the scarcity of large-scale domain-specific relevance annotations and the substantial mismatch in vocabulary and information needs. Recent approaches address these issues through two independent directions that leverage large language models (LLMs): (1) generating synthetic queries for fine-tuning, and (2) generating auxiliary contexts to support relevance matching. However, both directions overlook the diverse academic concepts embedded within scientific documents, often producing redundant or conceptually narrow queries and contexts. To address this limitation, we introduce an academic concept index , which extracts key concepts from papers and organizes them guided by an academic taxonomy. This structured index serves as a foundation for improving both directions. First, we enhance the synthetic query generation with concept coverage-based generation ( CCQGen ), which adaptively conditions LLMs on uncovered concepts to generate complementary queries with broader concept coverage. Second, we strengthen the context augmentation with concept-focused auxiliary contexts ( CCExpand ), which leverages a set of document snippets that serve as concise responses to the concept-aware CCQGen queries. Extensive experiments show that incorporating the academic concept index into both query generation and context augmentation leads to higher-quality queries, better conceptual alignment, and improved retrieval performance.
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 2509-2520
Can Structural Cues Save LLMs? Evaluating Language Models in Massive Document Streams
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 2509-2520
Open AccessCan Structural Cues Save LLMs? Evaluating Language Models in Massive Document Streams
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 745-755
MUDY: Multi-Granular Dynamic Candidate Contextualization for Unsupervised Keyphrase Extraction
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 745-755
Open AccessMUDY: Multi-Granular Dynamic Candidate Contextualization for Unsupervised Keyphrase Extraction
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 902-912
SPRINT: Scalable and Predictive Intent Refinement for LLM-Enhanced Session-based Recommendation
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 902-912
Open AccessSPRINT: Scalable and Predictive Intent Refinement for LLM-Enhanced Session-based Recommendation
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1297-1308
CREAM: Continual Retrieval on Dynamic Streaming Corpora with Adaptive Soft Memory
Information retrieval (IR) in dynamic data streams is a crucial task, as shifts in data distribution degrade the performance of AI-powered IR systems. To mitigate this issue, memory-based continual learning has been widely adopted for IR. However, existing methods rely on a fixed set of queries with ground-truth documents, which limits generalization to unseen data, making them impractical for real-world applications. To enable more effective learning with unseen topics of a new corpus without ground-truth labels, we propose CREAM, a self-supervised framework for memory-based continual retrieval. CREAM captures the evolving semantics of streaming queries and documents into dynamically structured soft memory and leverages it to adapt to both seen and unseen topics in an unsupervised setting. We realize this through three key techniques: fine-grained similarity estimation, regularized cluster prototyping, and stratified coreset sampling. Experiments on two benchmark datasets demonstrate that CREAM exhibits superior adaptability and retrieval accuracy, outperforming the strongest method in a label-free setting by 27.79% in Success@5 and 44.5% in Recall@10 on average, and achieving performance comparable to or even exceeding that of supervised methods.
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1297-1308
Open AccessCREAM: Continual Retrieval on Dynamic Streaming Corpora with Adaptive Soft Memory
Information retrieval (IR) in dynamic data streams is a crucial task, as shifts in data distribution degrade the performance of AI-powered IR systems. To mitigate this issue, memory-based continual learning has been widely adopted for IR. However, existing methods rely on a fixed set of queries with ground-truth documents, which limits generalization to unseen data, making them impractical for real-world applications. To enable more effective learning with unseen topics of a new corpus without ground-truth labels, we propose CREAM, a self-supervised framework for memory-based continual retrieval. CREAM captures the evolving semantics of streaming queries and documents into dynamically structured soft memory and leverages it to adapt to both seen and unseen topics in an unsupervised setting. We realize this through three key techniques: fine-grained similarity estimation, regularized cluster prototyping, and stratified coreset sampling. Experiments on two benchmark datasets demonstrate that CREAM exhibits superior adaptability and retrieval accuracy, outperforming the strongest method in a label-free setting by 27.79% in Success@5 and 44.5% in Recall@10 on average, and achieving performance comparable to or even exceeding that of supervised methods.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 8581-8584
Back to the Future: Look-ahead Augmentation and Parallel Self-Refinement for Time Series Forecasting
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 8581-8584
Open AccessBack to the Future: Look-ahead Augmentation and Parallel Self-Refinement for Time Series Forecasting
- Open Access
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (1) , 1-26
LMSC: Local Sketch Modularity Optimisation for Size-Constrained Community Search in Networks
With the proliferation of social networks, identifying meaningful community structures efficiently is essential for analysing complex interactions. This paper introduces Local Sketch Modularity (LSM), a novel modularity that measures community quality without relying on the entire structural information of the network, enabling a more targeted and practical approach to find the query-centric community. We validate the efficacy of the proposed modularity LSM through theoretical analyses, showing robustness against the free-rider effect. We further formulate the Local Modularity Optimisation for Size-Constrained Community Search (LMSC) problem, which leverages LSM to identify the query-centric community without requiring knowledge of the entire graph. We prove that LMSC is NP-hard and propose two efficient and effective algorithms. Extensive experiments on real-world networks demonstrate both the effectiveness and efficiency of the proposed method, confirming its applicability for large-scale network analysis.
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (1) , 1-26
Open AccessLMSC: Local Sketch Modularity Optimisation for Size-Constrained Community Search in Networks
With the proliferation of social networks, identifying meaningful community structures efficiently is essential for analysing complex interactions. This paper introduces Local Sketch Modularity (LSM), a novel modularity that measures community quality without relying on the entire structural information of the network, enabling a more targeted and practical approach to find the query-centric community. We validate the efficacy of the proposed modularity LSM through theoretical analyses, showing robustness against the free-rider effect. We further formulate the Local Modularity Optimisation for Size-Constrained Community Search (LMSC) problem, which leverages LSM to identify the query-centric community without requiring knowledge of the entire graph. We prove that LMSC is NP-hard and propose two efficient and effective algorithms. Extensive experiments on real-world networks demonstrate both the effectiveness and efficiency of the proposed method, confirming its applicability for large-scale network analysis.
- Open Access
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1155-1159
Metadata Meets LLMs: Constructing Knowledge-Rich Citation Networks with CoT-Enhanced Representations
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1155-1159
Open AccessMetadata Meets LLMs: Constructing Knowledge-Rich Citation Networks with CoT-Enhanced Representations
- 24 September 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 330
Sequence-aware adaptive graph convolutional recurrent networks for traffic forecasting
- 24 September 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 330
Sequence-aware adaptive graph convolutional recurrent networks for traffic forecasting