VLDB 2026 Research / reviewers in the wild / expert
Kevin Kao
dblp:159/3723
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0009-1764-0067ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1
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 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › document retrieval › domain-specific retrieval
job search |
1.0 | 1 | 2026 | Policy-Grounded Dynamic Facet Suggestions for Job Search · SIGIR 2026 |
Information retrieval › query reformulation
query refinement |
1.0 | 1 | 2026 | Policy-Grounded Dynamic Facet Suggestions for Job Search · SIGIR 2026 |
Methods — techniques the papers use, named apart from their topics
small language model scoring · 1.0prefix caching · 1.0embedding-based retrieval · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Policy-Grounded Dynamic Facet Suggestions for Job SearchabstractJob seekers often initiate search with short, underspecified queries. At LinkedIn, over 80% of job-related queries contain three or fewer keywords, making accurate user intent inference and relevant job retrieval particularly challenging. We present dynamic facet suggestion (DFS), an interactive query-refinement mechanism that facilitates intent disambiguation by surfacing personalized semantic attributes conditioned on the joint user-query context in real time. We propose a policy-grounded, retrieval-augmented ranking framework for facet suggestion, comprising offline taxonomy curation, embedding-based retrieval of top-K candidates, and a distilled small language model (SLM) based candidate scoring. The system is optimized for real-time serving via point-wise single-token scoring and batching/prefix caching. Offline evaluation demonstrates high precision for generated suggestions, and online A/B tests show significant lifts in suggestion engagement and job search outcomes. Baofen Zheng, Qianqi Shen, Jianqiang Shen, Wenqiong Liu, Chunnan Yao, Ping Liu 0002, Rajat Arora 0002, Kevin Kao, Hsiang Lin, Wanjun Jiang, Yusuke Takebuchi, Jingwei Wu |
SIGIR | 9 |
| 2025 | Powering Job Search at Scale: LLM-Enhanced Query Understanding in Job Matching SystemsabstractQuery understanding is essential in modern relevance systems, where user queries are often short, ambiguous, and highly context-dependent. Traditional approaches often rely on multiple task-specific Named Entity Recognition models to extract structured facets as seen in job search applications. However, this fragmented architecture is brittle, expensive to maintain, and slow to adapt to evolving taxonomies and language patterns. In this paper, we introduce a unified query understanding framework powered by a Large Language Model (LLM), designed to address these limitations. Our approach jointly models the user query and contextual signals such as profile attributes to generate structured interpretations that drive more accurate and personalized recommendations. The framework improves relevance quality in online A/B testing while significantly reducing system complexity and operational overhead. The results demonstrate that our solution provides a scalable and adaptable foundation for query understanding in dynamic web applications. Ping Liu 0002, Jianqiang Shen, Qianqi Shen, Chunnan Yao, Kevin Kao, Rajat Arora 0002, Baofen Zheng, Caleb Johnson, Liangjie Hong, Jingwei Wu |
CIKM | 5 |
| 2015 | moocRP: An Open-source Analytics PlatformabstractIn this paper, we address issues of transparency, modularity, and privacy with the introduction of an open source, web-based data repository and analysis tool tailored to the Massive Open Online Course community. The tool integrates data request/authorization and distribution workflows as well as a simple analytics module upload format to enable reuse and replication of analytics results among instructors and researchers. We survey the evolving landscape of competing data models, all of which can be accommodated in the platform. Data model descriptions are provided to analytics authors who choose, much like with smartphone app stores, to write for any number of data models depending on their needs and the proliferation of the particular data model. Two case study examples of analytics and interactive visualizations are described in the paper. The result is a simple but effective approach to learning analytics immediately applicable to X consortium institutions and beyond. Zachary A. Pardos, Kevin Kao |
L@S | 2 |