Doyun Choi

dblp:420/2238 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0007-7913-0308ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 87% Efficient and distributed learning · 13%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › collaborative filtering
graph collaborative filtering
1.012026
PULSE: Socially-Aware User Representation Modeling Toward Parameter-Efficient Graph Collaborative Filtering · WWW 2026
Machine learning › Graph learning › graph neural network › node classification
few-shot node classification
0.912025
Parameter-Free Hypergraph Neural Network for Few-Shot Node Classification · NeurIPS 2025
Machine learning › Graph learning › hypergraph learning
hypergraph neural network
0.912025
Parameter-Free Hypergraph Neural Network for Few-Shot Node Classification · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

social network · 1.0graph neural network · 1.0redundancy-aware propagation · 0.9closed-form solution · 0.9
YearPublicationVenuePosition
2026 PULSE: Socially-Aware User Representation Modeling Toward Parameter-Efficient Graph Collaborative Filtering
abstract
Graph-based social recommendation (SocialRec) has emerged as a powerful extension of graph collaborative filtering (GCF), which leverages graph neural networks (GNNs) to capture multi-hop collaborative signals from user-item interactions. These methods enrich user representations by incorporating social network information into GCF, thereby integrating additional collaborative signals from social relations. However, existing GCF and graph-based SocialRec approaches face significant challenges: they incur high computational costs and suffer from limited scalability due to the large number of parameters required to assign explicit embeddings to all users and items. In this work, we propose PULSE (Parameter-efficient User representation Learning with Social Knowledge), a framework that addresses this limitation by constructing user representations from socially meaningful signals without creating an explicit learnable embedding for each user. PULSE reduces the parameter size by up to 50% compared to the most lightweight GCF baseline. Beyond parameter efficiency, our method achieves state-of-the-art performance, outperforming 13 GCF and graph-based social recommendation baselines across varying levels of interaction sparsity, from cold-start to highly active users, through a time- and memory-efficient modeling process.
Doyun Choi, Cheonwoo Lee, Biniyam Aschalew Tolera, Taewook Ham, Chanyoung Park 0001, Jaemin Yoo
WWW1
2025 Simple and Behavior-Driven Augmentation for Recommendation with Rich Collaborative Signals
Doyun Choi, Cheonwoo Lee, Jaemin Yoo
IEEE Big Data1
2025 Parameter-Free Hypergraph Neural Network for Few-Shot Node Classification
abstract
Few-shot node classification on hypergraphs requires models that generalize from scarce labels while capturing high-order structures. Existing hypergraph neural networks (HNNs) effectively encode such structures but often suffer from overfitting and scalability issues due to complex, black-box architectures. In this work, we propose ZEN (Zero-Parameter Hypergraph Neural Network), a fully linear and parameter-free model that achieves both expressiveness and efficiency. Built upon a unified formulation of linearized HNNs, ZEN introduces a tractable closed-form solution for the weight matrix and a redundancy-aware propagation scheme to avoid iterative training and to eliminate redundant self-information. On 11 real-world hypergraph benchmarks, ZEN consistently outperforms eight baseline models in classification accuracy while achieving up to 696x speedups over the fastest competitor. Moreover, the decision process of ZEN is fully interpretable, providing insights into the characteristic of a dataset. Our code and datasets are fully available at https://github.com/chaewoonbae/ZEN.
Chaewoon Bae, Doyun Choi, Jaemin Yoo
NeurIPS2