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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Taekin Kim

dblp:401/6262 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0006-7812-5278ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 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
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval
query suggestion
0.912025
CATER: A Cluster-Based Alternative-Term Recommendation Framework for Large-Scale Web Search at NAVER · KDD (1) 2025
Information retrieval
search engines
0.912025
CATER: A Cluster-Based Alternative-Term Recommendation Framework for Large-Scale Web Search at NAVER · KDD (1) 2025
Information retrieval
query understanding
0.312025
CATER: A Cluster-Based Alternative-Term Recommendation Framework for Large-Scale Web Search at NAVER · KDD (1) 2025
Information retrieval › query understanding
search intent
0.312025
CATER: A Cluster-Based Alternative-Term Recommendation Framework for Large-Scale Web Search at NAVER · KDD (1) 2025

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

clustering · 0.9a/b testing · 0.9
YearPublicationVenuePosition
2025 CATER: A Cluster-Based Alternative-Term Recommendation Framework for Large-Scale Web Search at NAVER
abstract
Recently, searching for information by using search engines such as Google, Bing, and NAVER has become ubiquitous. While they attempt to provide information based on the search queries that users enter, it is not trivial to accurately capture the search intent of users. Motivated by this situation, NAVER Corp., the largest portal company in Korea, has developed a framework named as CATER (Cluster-based Alternative TErm Recommendation) framework that suggests alternative terms ("al-terms,'' in short) for better search outcomes relevant to a user's search intent. We introduce four design considerations (DCs) that were considered when designing and implementing CATER. Then, we describe how our CATER addresses the four DCs by using a clustering stage that dynamically maintains a pool of topic-oriented clusters containing terms, and a recommendation stage that identifies the top-k clusters (i.e., topics) and the top-k al-terms for each cluster. Furthermore, we present the scalable architecture adopted by CATER. Through various offline and online A/B tests using real-world datasets from NAVER, we validate that CATER successfully incorporates all DCs and that all design choices help improve the recommendation accuracy.
Jiwon Son 0001, Taekin Kim, Yeon-Chang Lee, Sang-Wook Kim
KDD (1)3