Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jianhui Ji
dblp:234/6905
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-1344-145XORCID · corroborated
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 · 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
2 papers |
Information retrieval · 80% Query processing and optimization · 20% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › query understanding
query classification |
0.5 | 1 | 2021 | Modeling Across-Context Attention For Long-Tail Query Classification in E-commerce · WSDM 2021 |
Information retrieval
query understanding |
0.5 | 1 | 2021 | Modeling Across-Context Attention For Long-Tail Query Classification in E-commerce · WSDM 2021 |
Query processing and optimization
query rewriting |
0.4 | 1 | 2019 | Weakly Supervised Co-Training of Query Rewriting andSemantic Matching for e-Commerce · WSDM 2019 |
Information retrieval
semantic matching |
0.4 | 1 | 2019 | Weakly Supervised Co-Training of Query Rewriting andSemantic Matching for e-Commerce · WSDM 2019 |
Information retrieval
e-commerce search |
0.1 | 1 | 2021 | Modeling Across-Context Attention For Long-Tail Query Classification in E-commerce · WSDM 2021 |
Methods — techniques the papers use, named apart from their topics
attention mechanism · 0.5weakly supervised learning · 0.4deep neural network · 0.4co-training · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Modeling Across-Context Attention For Long-Tail Query Classification in E-commerceabstractProduct query classification is the basic component for query understanding, which aims to classify the user queries into multiple categories under a predefined product category taxonomy for the E-commerce search engine. It is a challenging task due to the tremendous amount of product categories. And a slight modification to a query will change its corresponding categories entirely, e.g., appending the "button" to the query "shirt". The problem is more severe for the tail queries which lack enough supervision information from customers. Motivated by this phenomenon, this paper proposes to model the contrasting/similar relationships between such similar queries. Our framework is composed of a base model and an across-context attention module. The across-context attention module plays the role of deriving and extracting external information from these variant queries by predicting their categories. We conduct both offline and online experiments on the real-world E-commerce search engine. Experimental results demonstrate the effectiveness of our across-context attention module. Junhao Zhang 0006, Weidi Xu, Jianhui Ji, Hongbo Deng, Keping Yang |
WSDM | 3 |
| 2019 | Weakly Supervised Co-Training of Query Rewriting andSemantic Matching for e-CommerceabstractRelevance is the core problem of a search engine, and one of the main challenges is the vocabulary gap between user queries and documents. This problem is more serious in e-commerce, because language in product titles is more professional. Query rewriting and semantic matching are two key techniques to bridge the semantic gap between them to improve relevance. Recently, deep neural networks have been successfully applied to the two tasks and enhanced the relevance performance. However, such approaches suffer from the sparseness of training data in e-commerce scenario. In this study, we investigate the instinctive connection between query rewriting and semantic matching tasks, and propose a co-training framework to address the data sparseness problem when training deep neural networks. We first build a huge unlabeled dataset from search logs, on which the two tasks can be considered as two different views of the relevance problem. Then we iteratively co-train them via labeled data generated from this unlabeled set to boost their performance simultaneously. We conduct a series of offline and online experiments on a real-world e-commerce search engine, and the results demonstrate that the proposed method improves relevance significantly. Rong Xiao 0005, Jianhui Ji, Baoliang Cui, Haihong Tang, Wenwu Ou, Yanghua Xiao, Jiwei Tan, Xuan Ju |
WSDM | 2 |