Jiahui Jin

Jiahui Jin

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
30 April 2023
Verified
Conference Paper
Open access
YWYuchen Wang
Yuchen Wang
JZJinghui Zhang
Jinghui Zhang
ZHZhengjie Huang
Zhengjie Huang
WLWeibin Li
Weibin Li
SFShikun Feng
Shikun Feng
JLJunzhou Luo
Junzhou Luo
Node classification is a substantial problem in graph-based fraud detection. Many existing works adopt Graph Neural Networks (GNNs) to enhance fraud detectors. While promising, currently most GNN-based fraud detectors fail to generalize to the low homophily setting. Besides, label utilization has been proved to be significant factor for node classification problem. But we find they are less effective in fraud detection tasks due to the low homophily in graphs. In this work, we propose GAGA, a novel Group AGgregation enhanced TrAnsformer, to tackle the above challenges. Specifically, the group aggregation provides a portable method to cope with the low homophily issue. Such an aggregation explicitly integrates the label information to generate distinguishable neighborhood information. Along with group aggregation, an attempt towards end-to-end trainable group encoding is proposed which augments the original feature space with the class labels. Meanwhile, we devise two additional learnable encodings to recognize the structural and relational context. Then, we combine the group aggregation and the learnable encodings into a Transformer encoder to capture the semantic information. Experimental results clearly show that GAGA outperforms other competitive graph-based fraud detectors by up to 24.39% on two trending public datasets and a real-world industrial dataset from Baidu. Even more, the group aggregation is demonstrated to outperform other label utilization methods (e.g., C&S, BoT/UniMP) in the low homophily setting.

3 February 2022 in World Wide Web
Verified
Journal Article
Closed access
PDF file
JZJinghui Zhang
Jinghui Zhang
XCXinyu Cheng
Xinyu Cheng
CWCheng Wang
Cheng Wang
YWYuchen Wang
Yuchen Wang
ZSZhan Shi
Zhan Shi
TZTingting Zhang
Tingting Zhang

29 November 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
FSFeng Shan
Feng Shan
JLJunzhou Luo
Junzhou Luo
JJJiahui Jin
Jiahui Jin
WWWeiwei Wu
Weiwei Wu
Billions of lightweight Internet of Things (IoT) devices have been deployed for various applications nowadays. Most of them first collect interested data and then process them in some degree according to application requirements. Transparent Computing (TC) is a promising technique that makes such lightweight devices suitable to process even large-size applications. The advantage of TC is to separate code storage from its execution, allowing IoT devices to load code blocks from nearby TC storage server on demand. Distinct from existing work, this paper allows the TC IoT devices to offload some tasks to servers, since wireless IoT devices are usually powered by batteries, having limited energy resources. If a task is offloaded, a challenging problem is that its input data collected by the IoT device must be transferred as well, which incurs additional transmission time and energy. This paper proposes a two-step approach aiming at minimizing the energy consumption of the IoT device while satisfies the delay constraint. This approach first studies the offloading decision problem that determines for each task whether to offload task data or load task code blocks, while loading code indicates code receiving and executing energy cost. Second, the transmission power scheduling problem is investigated to further reduce offloading energy for a given delay constrained offloading task set. Heuristic decision making algorithms and optimal power scheduling algorithm are proposed respectively. Such two-step approach is shown by extensive simulation to be near optimal for the original problem thanks to the optimal design of the power scheduling algorithm.

24 March 2024 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
JZJinghui Zhang
Jinghui Zhang
ZXZhengjia Xu
Zhengjia Xu
DLDingyang Lv
Dingyang Lv
ZSZhan Shi
Zhan Shi
DSDian Shen
Dian Shen
FDFang Dong
Fang Dong
Fraud detection on multi-relation graphs aims to identify fraudsters in graphs. Graph Neural Network (GNN) models leverage graph structures to pass messages from neighbors to the target nodes, thereby enriching the representations of those target nodes. However, feature and structural inconsistency in the graph, owing to fraudsters' camouflage behaviors, diminish the suspiciousness of fraud nodes which hinders the effectiveness of GNN-based models. In this work, we propose DiG-In-GNN, Discriminative Feature Guided GNN against Inconsistency, to dig into graphs for fraudsters. Specifically, we use multi-scale contrastive learning from the perspective of the neighborhood subgraph where the target node is located to generate guidance nodes to cope with the feature inconsistency. Then, guided by the guidance nodes, we conduct fine-grained neighbor selection through reinforcement learning for each neighbor node to precisely filter nodes that can enhance the message passing and therefore alleviate structural inconsistency. Finally, the two modules are integrated together to obtain discriminable representations of the nodes. Experiments on three fraud detection datasets demonstrate the superiority of the proposed method DiG-In-GNN, which obtains up to 20.73% improvement over previous state-of-the-art methods. Our code can be found at https://github.com/GraphBerry/DiG-In-GNN.

16 February 2022 in Expert Systems with Applications
Verified
Journal Article
Closed access
YLYangyang Liu
Yangyang Liu
ASAibo Song
Aibo Song
XSXin Shan
Xin Shan
YXYingying Xue
Yingying Xue
JJJiahui Jin
Jiahui Jin

1 November 2021 in Security and Communication Networks
Verified
Journal Article
Open access
PDF file
RTRenjie Tang
Renjie Tang
JLJunzhou Luo
Junzhou Luo
JQJunbo Qian
Junbo Qian
JJJiahui Jin
Jiahui Jin
Electrocardiogram (ECG) data classification is a hot research area for its application in medical information processing. However, insufficient data, privacy preserve, and local deployment are still challenging difficulties. To address these problems, a novel personalized federated learning method for ECG classification is proposed in this paper. First, a global model is trained with federated learning framework on multiple local data clients. Then, we use the global model and private data to train the local model. To reduce the feature inconsistency between global and private local data and for better fitting the private local data, a novel ”feature alignment” module is devised to guarantee the uniformity, which contains two parts, global alignment and local alignment, respectively. For global alignment, the graph metric of batch data is used to constrain the dissimilarity between features generated by the global model and local model. For local alignment, triplet loss is adopted to increase discriminative ability for local private data. Comprehensive experiments on our collected dataset are evaluated. The results show that the proposed method can be better adapted to local data and exhibit superior ability of generalization.