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

Hansi Wu

dblp:371/9018 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
Recommender systems · 33% Data mining · 33% Graph data management · 33%

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

TopicWeightPapersLastEvidence papers
Graph data management
graph extraction
0.912025
GraphEx: A Graph-Based Extraction Method for Advertiser Keyphrase Recommendation · ICDE 2025
Data mining › structured data mining › graph mining
graph learning
0.912025
GraphEx: A Graph-Based Extraction Method for Advertiser Keyphrase Recommendation · ICDE 2025
Recommender systems
keyphrase recommendation
0.912025
GraphEx: A Graph-Based Extraction Method for Advertiser Keyphrase Recommendation · ICDE 2025

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

graph-based approach · 0.9extreme multi-label classification · 0.9
YearPublicationVenuePosition
2025 BroadGen: A Framework for Generating Effective and Efficient Advertiser Broad Match Keyphrase Recommendations
Ashirbad Mishra, Jinyu Zhao, Soumik Dey, Hansi Wu, Binbin Li 0009, Kamesh Madduri
IEEE Big Data4
2025 To Judge or Not to Judge: Using LLM Judgements for Advertiser Keyphrase Relevance at eBay
abstract
E-commerce sellers are recommended keyphrases based on their inventory on which they advertise to increase buyer engagement (clicks/sales). The relevance of advertiser keyphrases plays an important role in preventing the inundation of search systems with numerous irrelevant items that compete for attention in auctions, in addition to maintaining a healthy seller perception. In this work, we describe the shortcomings of training Advertiser keyphrase relevance filter models on click/sales/search relevance signals and the importance of aligning with human judgment, as sellers have the power to adopt or reject said keyphrase recommendations. In this study, we frame Advertiser keyphrase relevance as a complex interaction between 3 dynamical systems — seller judgment, which influences seller adoption of our product, Advertising, which provides the keyphrases to bid on, and Search, who holds the auctions for the same keyphrases. This study discusses the practicalities of using human judgment via a case study at eBay Advertising and demonstrates that using LLM-as-a-judge en-masse as a scalable proxy for seller judgment to train our relevance models achieves a better harmony across the three systems, provided that they are bound by a meticulous evaluation framework grounded in business metrics.
Soumik Dey, Hansi Wu, Binbin Li 0009
ECAI2
2025 GraphEx: A Graph-Based Extraction Method for Advertiser Keyphrase Recommendation
abstract
Online sellers and advertisers are recommended keyphrases for their listed products, which they bid on to enhance their sales. One popular paradigm that generates such recommendations is Extreme Multi-Label Classification (XMC), which involves tagging/mapping keyphrases to items. We outline the limitations of training XMC models on click data for keyphrase recommendations on E-Commerce platforms. We introduce GraphEx, an innovative graph-based approach that recommends keyphrases to sellers using extraction of token permutations from item titles. Additionally, we demonstrate traditional metrics such as precision/recall isn't reliable on click-based data in practical applications, thereby necessitating a robust framework to evaluate performance in real-world scenarios. Our evaluation is designed to assess the relevance of keyphrases to items and the potential for buyer outreach. GraphEx outperforms production models at eBay, achieving the objectives mentioned above. It supports near real-time inferencing in resource-constrained production environments and scales effectively for billions of items.
Ashirbad Mishra, Soumik Dey, Hansi Wu, Jinyu Zhao, Kaichen Ni, Binbin Li 0009, Kamesh Madduri
ICDE3