Ziheng Chen

Prof. Ziheng Chen

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 July 2023
Verified
Conference Paper
Open access
ZCZiheng Chen
Ziheng Chen
FSFabrizio Silvestri
Fabrizio Silvestri
JWJia Wang
Jia Wang
ZYZhang Yongfeng
Zhang Yongfeng
GTGabriele Tolomei
Gabriele Tolomei

9 September 2020 in International Journal of Automation and Computing
Verified
Journal Article
Closed access
PDF file
ZCZiheng Chen
Ziheng Chen
Hongshik AhnHongshik Ahn
Hongshik Ahn

23 November 2022 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Open access
ZCZiheng Chen
Ziheng Chen
FSFabrizio Silvestri
Fabrizio Silvestri
GTGabriele Tolomei
Gabriele Tolomei
JWJia Wang
Jia Wang
HZHe Zhu
He Zhu
HAHongshik Ahn
Hongshik Ahn
Counterfactual examples (CFs) are one of the most popular methods for attaching post-hoc explanations to machine learning (ML) models. However, existing CF generation methods either exploit the internals of specific models or depend on each sample's neighborhood; thus, they are hard to generalize for complex models and inefficient for large datasets. This work aims to overcome these limitations and introduces RELAX, a model-agnostic algorithm to generate optimal counterfactual explanations. Specifically, we formulate the problem of crafting CFs as a sequential decision-making task. We then find the optimal CFs via deep reinforcement learning (DRL) with discretecontinuous hybrid action space. In addition, we develop a distillation algorithm to extract decision rules from the DRL agent's policy in the form of a decision tree to make the process of generating CFs itself interpretable. Extensive experiments conducted on six tabular datasets have shown that RELAX outperforms existing CF generation baselines, as it produces sparser counterfactuals, is more scalable to complex target models to explain, and generalizes to both classification and regression tasks. Finally, we show the ability of our method to provide actionable recommendations and distill interpretable policy explanations in two practical, real-world use cases.

23 March 2020 in IEEE Access
Verified
Journal Article
Open access
Xin NingXin Ning
Xin Ning
WTWeijuan Tian
Weijuan Tian
WLWeijun Li
Weijun Li
YLYueyue Lu
Yueyue Lu
SNShuai Nie
Shuai Nie
ZCZiheng Chen
Ziheng Chen
In order to improve the accuracy of capsule network in disentangled representation, and further expand its application in computer vision, a novel BDARS_CapsNet (bi-directional attention routing sausage capsule network) architecture is proposed in this paper. Firstly, the bi-directional routing, namely bottom-up and top-down attention is used to achieve information feed-forward and feedback mechanism, which contributes to describing the attributes of object entity more accurately and completely. Secondly, inspired by the concept of covering learning, the sausage measure model is introduced into the network. The sausage model measures both the similarities and differences of the capsules and projects them into a more complex curved surface, which makes it possible to approximate any nonlinear function with arbitrary precision and preserving the local responsiveness of capsule entity to the maximum. Finally, the BDARS_CapsNet combines the CNN (Convolutional Neural Network), bi-directional attention routing, and sausage measure into capsule network modeling, and makes full use of high-level category information and low-level vision information; as a result, the reconstruction and classification accuracy is accordingly improved. Experiments demonstrate the effectiveness of proposed information routing, sausage measure, and new framework. Furthermore, the proposed BDARS_CapsNet provides a foundation for future research on disentangled representation learning.

10 November 2025
Verified
Conference Paper
Open access
ZCZiheng Chen
Ziheng Chen
JCJiali Cheng
Jiali Cheng
HAHadi Amiri
Hadi Amiri
KNKaushiki Nag
Kaushiki Nag
LLLu Lin
Lu Lin
Xiangguo SunXiangguo Sun
Xiangguo Sun

22 November 2025 in ACM Transactions on Recommender Systems
Verified
Journal Article
Open access
ZCZiheng Chen
Ziheng Chen
JHJin Huang
Jin Huang
FSFabrizio Silvestri
Fabrizio Silvestri
Yongfeng ZhangYongfeng Zhang
Yongfeng Zhang
HAHongshik Ahn
Hongshik Ahn
GTGabriele Tolomei
Gabriele Tolomei
Recently, graph neural networks (GNNs) have become the new state-of-the-art approach to developing powerful recommender systems. However, it is hard for GNN-based recommender systems to attach tangible explanations of why a specific item ends up in the list of top- k suggestions for a given user. Indeed, explaining GNN-based recommendations is unique, and existing GNN explanation methods are inappropriate since they are designed to explain node, edge, or graph classification rather than ranking. In this work, we propose GREASE, a novel method for explaining the list of top- k suggested items to a given user provided by any black-box GNN-based recommender system. Specifically, for each recommended item, GREASE first trains a surrogate GNN model on the subgraph obtained as the union of the target user-item pair and its l -hop neighborhood. Then, it jointly generates factual and counterfactual explanations by finding optimal adjacency matrix perturbations to capture the sufficient and necessary conditions for the item to be recommended. Experiments on real-world datasets show that GREASE can generate concise and compelling explanations for popular GNN-based recommender models.