EDBT 2026 Demo / reviewers in the wild / expert
Hengzhu Tang
dblp:261/9705
· DBLP profile ↗
8ranked-venue papers in the field
2as first author
6since 2021 · last 2025
—ORCID · conflict
Domains — venue-derived; a paper can count in several
Data Mining & Knowledge Discovery · 7 (2 first)Information Retrieval & Web Search · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Leveraging Generative Models for Real-Time Query-Driven Text Summarization in Large-Scale Web SearchabstractIn the dynamic landscape of large-scale web search, Query-Driven Text Summarization (QDTS) aims to generate concise and informative summaries from textual documents based on a given query, which is essential for improving user engagement and facilitating rapid decision-making. Traditional extractive summarization models, based primarily on ranking candidate summary segments, have been the dominant approach in industrial applications. However, these approaches suffer from two key limitations: 1) The multi-stage pipeline often introduces cumulative information loss and architectural bottlenecks due to its weakest component; 2) Traditional models lack sufficient semantic understanding of both user queries and documents, particularly when dealing with complex search intents. In this study, we propose a novel framework to pioneer the application of generative models to address real-time QDTS in industrial web search. Our approach integrates large model distillation, supervised fine-tuning, direct preference optimization, and lookahead decoding to transform a lightweight model with only 0.1B parameters into a domain-specialized QDTS expert. Evaluated on multiple industry-relevant metrics, our model outperforms the production baseline and achieves a new state of the art. Furthermore, it demonstrates excellent deployment efficiency, requiring only 334 NVIDIA L20 GPUs to handle ~50,000 queries per second under 55~ms average latency per query. Zeyu Xiong, Yixuan Nan, Hengzhu Tang, Shuaiqiang Wang, Junfeng Wang 0009, Dawei Yin 0001 |
CIKM | 4 |
| 2025 | Exploring Preference-Guided Diffusion Model for Cross-Domain RecommendationabstractCross-domain recommendation (CDR) has been proven as a promising way to alleviate the cold-start issue, in which the most critical problem is how to draw an informative user representation in the target domain via the transfer of user preference existing in the source domain. Prior efforts mostly follow the embedding-and-mapping paradigm, which first integrate the preference into user representation in the source domain, and then perform a mapping function on this representation to the target domain. However, they focus on mapping features across domains, neglecting to explicitly model the preference integration process, which may lead to learning coarse user representation. Diffusion models (DMs), which contribute to more accurate user/item representations due to their explicit information injection capability, have achieved promising performance in recommendation systems. Nevertheless, these DMs-based methods cannot directly account for valuable user preference in other domains, leading to challenges in adapting to the transfer of preference for cold-start users. Consequently, the feasibility of DMs for CDR remains underexplored. To this end, we explore to utilize the explicit information injection capability of DMs for user preference integration and propose a Preference-Guided Diffusion Model for CDR to cold-start users, termed as DMCDR. Specifically, we leverage a preference encoder to establish the preference guidance signal with the user's interaction history in the source domain. Then, we explicitly inject the preference guidance signal into the user representation step by step to guide the reverse process, and ultimately generate the personalized user representation in the target domain, thus achieving the transfer of user preference across domains. Furthermore, we comprehensively explore the impact of six DMs-based variants on CDR. Extensive experiments on three real-world CDR scenarios demonstrate the superiority of our DMCDR over SOTA methods and six DMs-based variants. Xiaodong Li 0012, Hengzhu Tang, Jiawei Sheng, Xinghua Zhang 0001, Suqi Cheng, Dawei Yin 0001, Tingwen Liu |
KDD (1) | 2 |
| 2025 | Multi-Branch Collaborative Learning Network for Video Quality Assessment in Industrial Video SearchabstractVideo Quality Assessment (VQA) is a crucial component of broadscale video retrieval systems. Its goal is to accurately identify various quality issues in videos, thereby encouraging the video retrieval system to prioritize high-quality videos. In large-scale industrial video retrieval systems, we formulate the characteristics of low-quality videos into four categories: visual-related low-level quality problems such as mosaics and black boxes, textual-related low-level quality problems caused by video title and Optical Character Recognition (OCR) content, as well as semantic-level frame incoherence and frame-text mismatch caused by emerging AI-generated videos. These kinds of low-quality videos, which are widely present in industrial environments, have been overlooked in academic research before, and accurately identifying them is very challenging. In this paper, we introduce a Multi-Branch Collaborative learning Network (MBCN) to tackle the above issues. We carefully design four assessment branches for MBCN to adapt to the above four kinds of issues for industrial video retrieval systems. After obtaining independent scores for each branch, we perform a weighted aggregation of the various branches to dynamically address video quality issues in different scenarios with a squeeze-and-excitation mechanism. Finally, we integrate point-wise and pair-wise optimization objectives to ensure the predicted scores are stable and fall into a reasonable range. To demonstrate the effectiveness of our proposed MBCN, we conduct extensive offline and online experiments in a world-level video search engine. The experimental results show that due to the powerful ability of MBCN to identify video quality issues, the ranking ability of the video retrieval system has been significantly improved. We also conduct a series of detailed experimental analyses to verify that all four evaluation branches play a positive role. Besides that, for emerging low-quality AI-generated videos, the recognition accuracy of MBCN also improves significantly compared to the baseline. Hengzhu Tang, Zefeng Zhang 0001, Zhiping Li, Zhenyu Zhang 0006, Suqi Cheng, Dawei Yin 0001 |
KDD (1) | 1 |
| 2024 | Text-Video Retrieval via Multi-Modal Hypergraph NetworksabstractText-video retrieval is a challenging task that aims to identify relevant videos given textual queries. Compared to conventional textual retrieval, the main obstacle for text-video retrieval is the semantic gap between the textual nature of queries and the visual richness of video content. Previous works primarily focus on aligning the query and the video by finely aggregating word-frame matching signals. Inspired by the human cognitive process of modularly judging the relevance between text and video, the judgment needs high-order matching signal due to the consecutive and complex nature of video contents. In this paper, we propose chunk-level text-video matching, where the query chunks are extracted to describe a specific retrieval unit, and the video chunks are segmented into distinct clips from videos. We formulate the chunk-level matching as n-ary correlations modeling between words of the query and frames of the video and introduce a multi-modal hypergraph for n-ary correlation modeling. By representing textual units and video frames as nodes and using hyperedges to depict their relationships, a multi-modal hypergraph is constructed. In this way, the query and the video can be aligned in a high-order semantic space. In addition, to enhance the model's generalization ability, the extracted features are fed into a variational inference component for computation, obtaining the variational representation under the Gaussian distribution. The incorporation of hypergraphs and variational inference allows our model to capture complex, n-ary interactions among textual and visual contents. Experimental results demonstrate that our proposed method achieves state-of-the-art performance on the text-video retrieval task. Qian Li 0033, Lixin Su, Jiashu Zhao, Hengyi Cai, Suqi Cheng, Hengzhu Tang, Junfeng Wang 0009, Dawei Yin 0001 |
WSDM | 7 |
| 2021 | Fake News Detection with Heterogenous Deep Graph Convolutional Network
Zhezhou Kang, Yanan Cao 0001, Yanmin Shang, Hengzhu Tang, Lingling Tong |
PAKDD (1) | 5 |
| 2021 | Deep Structural Point Process for Learning Temporal Interaction Networks
Jiangxia Cao, Xixun Lin, Xin Cong, Hengzhu Tang, Tingwen Liu, Bin Wang 0004 |
ECML/PKDD (1) | 5 |
| 2020 | HIN: Hierarchical Inference Network for Document-Level Relation Extraction
Hengzhu Tang, Yanan Cao 0001, Zhenyu Zhang 0006, Jiangxia Cao, Fang Fang 0009, Shi Wang 0002, Pengfei Yin |
PAKDD (1) | 1 |
| 2020 | Inductive Unsupervised Domain Adaptation for Few-Shot Classification via Clustering
Xin Cong, Bowen Yu 0002, Tingwen Liu, Shiyao Cui, Hengzhu Tang, Bin Wang 0004 |
ECML/PKDD (2) | 5 |