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

Xin Zhang 0091

dblp:76/1584-91 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
5since 2021 · last 2025
0000-0003-0591-2845ORCID · verified

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

Databases, data management, data science and information retrieval · 3 · 2 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 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
3 papers
Recommender systems · 63% Data mining · 37%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
multimodal recommendation
0.912025
Multi-Modal Correction Network for Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Recommender systems
click-through rate prediction
0.812024
Deep Session Heterogeneity-Aware Network for Click Through Rate Prediction · IEEE Trans. Knowl. Data Eng. 2024
Data mining › causal inference › treatment effect estimation
individual treatment effect estimation
0.812024
Temporal Uplift Modeling for Online Marketing · KDD 2024
Recommender systems
session-based recommendation
0.812024
Deep Session Heterogeneity-Aware Network for Click Through Rate Prediction · IEEE Trans. Knowl. Data Eng. 2024
Data mining › causal inference
treatment effect estimation
0.812024
Temporal Uplift Modeling for Online Marketing · KDD 2024
Machine learning › Representation and self-supervised learning
contrastive learning
0.312025
Multi-Modal Correction Network for Recommendation · IEEE Trans. Knowl. Data Eng. 2025

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

attention mechanism · 2.5residual structure · 1.7contrastive learning · 1.7temporal point process · 0.8counterfactual analysis · 0.8
YearPublicationVenuePosition
2025 Multi-Modal Correction Network for Recommendation
abstract
Multi-modal contents have proven to be the powerful knowledge for recommendation tasks. Most state-of-the-art multi-modal recommendation methods mainly focus on aligning the semantic spaces of different modalities to enhance the item representations and do not pay much attention on the relevant knowledge in the multi-modalities for recommendation, resulting in that the positive effects of the relevant knowledge is reduced and the improvement of recommendation performance is limited. In this paper, we propose a multi-modal correction network termed MMCN to enhance the item representation with the important semantic knowledge in each modality by a residual structure with attention mechanisms and a hierarchical contrastive learning framework. The residual information is obtained through self-attention and cross-attention, which can learn the relevant knowledge across different modalities effectively. While hierarchical contrastive learning further captures the relevant knowledge not only at the feature level but also at the element-wise level with a matrix. Extensive experiments on three large-scale real-world datasets show the superiority of MMCN over state-of-the-art multi-modal recommendation methods.
Zengmao Wang, Yunzhen Feng, Xin Zhang 0091, Renjie Yang, Bo Du 0001
IEEE Trans. Knowl. Data Eng.3
2024 Temporal Uplift Modeling for Online Marketing
abstract
In recent years, uplift modeling, also known as individual treatment effect (ITE) estimation, has seen wide applications in online marketing, such as delivering one-time issuance of coupons or discounts to motivate users' purchases. However, complex yet more realistic scenarios involving multiple interventions over time on users are still rarely explored. The challenges include handling the bias from time-varying confounders, determining optimal treatment timing, and selecting among numerous treatments. In this paper, to tackle the aforementioned challenges, we present a temporal point process-based uplift model (TPPUM) that utilizes users' temporal event sequences to estimate treatment effects via counterfactual analysis and temporal point processes. In this model, marketing actions are considered as treatments, user purchases as outcome events, and how treatments alter the future conditional intensity function of generating outcome events as the uplift. Empirical evaluations demonstrate that our method outperforms existing baselines on both real-world and synthetic datasets. In the online experiment conducted in a discounted bundle recommendation scenario involving an average of 3 to 4 interventions per day and hundreds of treatment candidates, we demonstrate how our model outperforms current state-of-the-art methods in selecting the appropriate treatment and timing of treatment, resulting in a 3.6% increase in application-level revenue.
Xin Zhang 0091, Kai Wang 0064, Zengmao Wang, Bo Du 0001, Runze Wu 0001, Tangjie Lv, Changjie Fan
KDD1
2024 Deep Session Heterogeneity-Aware Network for Click Through Rate Prediction
abstract
CTR (Click-Through Rate) prediction plays an essential role in online advertising systems. Most existing works attempt to capture users’ interests from sessions by assuming that behaviors within a session are homogeneous. However, user interest may change frequently. Thus it is hard to guarantee that behaviors in a session are homogeneous, resulting in users’ interests extracted from sessions being biased. In this paper, we propose a model named Deep Session Heterogeneity-aware Network (DSHN) by learning the relationships of behaviors within sessions and the relevance between the session and target item to alleviate the influence of irrelevant or heterogeneous sessions. We design a heterogeneity-aware mechanism to learn the heterogeneity of items within a session. Then we further design two modules: the Session Heterogeneity Learning module and the Relevance Inference module. The Session Heterogeneity Learning module weighs each session by summarizing the variation of session interest with and without any behavior. The relevance Inference module learns the relevance between the target item and each session in a similar way by learning session interest with and without the target item. Extensive experiments on four datasets demonstrate that our proposed DSHN achieves better results compared to the state-of-the-art.
Xin Zhang 0091, Zengmao Wang, Bo Du 0001, Jia Wu 0001, Erli Meng
IEEE Trans. Knowl. Data Eng.1
2023 Graph-aware collaborative reasoning for click-through rate prediction
Xin Zhang 0091, Zengmao Wang, Bo Du 0001
World Wide Web (WWW)1
2022 Deep Dynamic Interest Learning With Session Local and Global Consistency for Click-Through Rate Predictions
abstract
Click-through rate (CTR) prediction is the core task in an online advertising system. How to capture the users’ dynamic interests through the behavior sequences to predict CTR is a challenging problem in the real-world applications. To address this challenge, we propose a deep dynamic interest learning by learning the local sessions and global sessions within sequences for CTR prediction. The local sessions and global sessions are used to capture the short-term dynamic interests and the long-term interests of users, respectively. To explore the heterogeneous behaviors within the global session efficiently, the interests in global sessions are forced to be consistent with that in local sessions. Then, the bi-LSTM network is adopted to capture the dynamic interests with the behaviors across global sessions effectively. Experimental results on various datasets show that the proposed method outperforms several state-of-the-art CTR prediction methods.
Xin Zhang 0091, Zengmao Wang, Bo Du 0001
IEEE Trans. Ind. Informatics1