Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Kwangeun Yeo

dblp:376/0911 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0009-0005-8206-364XORCID · corroborated

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

Databases, data management, data science and information retrieval · 3 · 3 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.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems › cold-start recommendation
cold-start item recommendation
0.812024
Content-based Graph Reconstruction for Cold-start Item Recommendation · SIGIR 2024
Recommender systems
cold-start recommendation
0.812024
Content-based Graph Reconstruction for Cold-start Item Recommendation · SIGIR 2024
Recommender systems
graph-based recommendation
0.812024
Content-based Graph Reconstruction for Cold-start Item Recommendation · SIGIR 2024

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

graph convolution · 0.8content-based graph reconstruction · 0.8
YearPublicationVenuePosition
2025 ReducedGCN: Learning to Adapt Graph Convolution for Top-N Recommendation
Eungi Kim, Kwangeun Yeo, Jinri Kim, Yujin Jeon, Sewon Lee, Joonseok Lee
PAKDD (3)3
2025 Mixture of Conditional Attention for Multimodal Fusion in Sequential Recommendation
Sewon Lee, Kwangeun Yeo, Eungi Kim, Jinri Kim, Yujin Jeon, Joonseok Lee
PAKDD (3)2
2024 Content-based Graph Reconstruction for Cold-start Item Recommendation
abstract
Graph convolutions have been successfully applied to recommendation systems, utilizing high-order collaborative signals present in the user-item interaction graph. This idea, however, has not been applicable to the cold-start items, since cold nodes are isolated in the graph and thus do not take advantage of information exchange from neighboring nodes. Recently, there have been a few attempts to utilize graph convolutions on item-item or user-user attribute graphs to capture high-order collaborative signals for cold-start cases, but these approaches are still limited in that the item-item or user-user graph falls short in capturing the dynamics of user-item interactions, as their edges are constructed based on arbitrary and heuristic attribute similarity.
Jinri Kim, Eungi Kim, Kwangeun Yeo, Yujin Jeon, Sewon Lee, Joonseok Lee
SIGIR3