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

Zhidan Wang

dblp:75/1251 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0001-9550-5199ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Security and privacy · 1Applied, interdisciplinary, general and emerging computing · 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
2 papers
Recommender systems · 100%
Artificial intelligence
1 paper
Generative modeling · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
debiased recommendation
0.812024
Toward Bias-Agnostic Recommender Systems: A Universal Generative Framework · ACM Trans. Inf. Syst. 2024
Machine learning › Generative modeling › adversarial generative modeling
adversarial generation
0.612022
Generative Session-based Recommendation · WWW 2022
Machine learning › Generative modeling › generative adversarial network › GAN architecture
dual adversarial network
0.612022
Generative Session-based Recommendation · WWW 2022
Recommender systems
generative recommendation
0.612022
Generative Session-based Recommendation · WWW 2022
Recommender systems
session-based recommendation
0.612022
Generative Session-based Recommendation · WWW 2022

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

self-paced regularization · 1.1reinforcement learning · 1.1adversarial training · 1.1representation learning · 0.8generative framework · 0.8calibration perturbation · 0.8
YearPublicationVenuePosition
2024 Toward Bias-Agnostic Recommender Systems: A Universal Generative Framework
abstract
User behavior data, such as ratings and clicks, has been widely used to build personalizing models for recommender systems. However, many unflattering factors (e.g., popularity, ranking position, users’ selection) significantly affect the performance of the learned recommendation model. Most existing work on unbiased recommendation addressed these biases from sample granularity (e.g., sample reweighting, data augmentation) or from the perspective of representation learning (e.g., bias-modeling). However, these methods are usually designed for a specific bias, lacking the universal capability to handle complex situations where multiple biases co-exist. Besides, rare work frees itself from laborious and sophisticated debiasing configurations (e.g., propensity scores, imputed values, or user behavior-generating process). Towards this research gap, in this article, we propose a universal G enerative framework for B ias D isentanglement termed as GBD , constantly generating calibration perturbations for the intermediate representations during training to keep them from being affected by the bias. Specifically, a bias-identifier that tries to retrieve the bias-related information from the representations is first introduced. Subsequently, the calibration perturbations are generated to significantly deteriorate the bias-identifier’s performance, making the bias gradually disentangled from the calibrated representations. Therefore, without relying on notorious debiasing configurations, a bias-agnostic model is obtained under the guidance of the bias identifier. We further present its universality by subsuming the representative biases and their mixture under the proposed framework. Finally, extensive experiments on the real-world, synthetic, and semi-synthetic datasets have demonstrated the superiority of the proposed approach against a wide range of recommendation debiasing methods. The code is available at https://github.com/Zhidan-Wang/GBD .
Zhidan Wang, Lixin Zou, Chenliang Li 0005, Shuaiqiang Wang, Xu Chen 0017, Dawei Yin 0001, Weidong Liu 0001
ACM Trans. Inf. Syst.1
2022 Generative Session-based Recommendation
abstract
Session-based recommendation has recently attracted increasing attention from both industry and academic communities. Previous models mostly focus on designing different models to fit the observed data, which can be quite sparse in real-world scenarios. To alleviate this problem, in this paper, we propose a novel generative session-based recommendation framework. The main building block of our idea is to develop a generator to simulate user sequential behaviors, which are leveraged to train and improve the target sequential recommender model. In order to generate high quality samples, we consider two aspects: (1) the rationality as a sequence of user behaviors, and (2) the informativeness for training the target model. To satisfy these requirements, we design a doubly adversarial network. The first adversarial module aims to make the generated samples conform to the underlying patterns of the real user sequential preference (rationality requirement). The second adversarial module is targeted at widening the model experiences by generating samples which can induce larger model losses (informativeness requirement). In our model, the samples are generated based on a reinforcement learning strategy, where the reward is related with both of the above aspects. In order to stable the training process, we introduce a self-paced regularizer to learn the agent in an easy-to-hard manner. We conduct extensive experiments based on real-world datasets to demonstrate the effectiveness of our model.
Zhidan Wang, Wenwen Ye, Xu Chen 0017, Zhenlei Wang, Lixin Zou, Weidong Liu 0001
WWW1
2020 Fine-grained assured data deletion scheme based on attribute association
Zhidan Wang
Comput. Secur.2