Chungang Yan

Chungang Yan

Auto-generated profile, based on publicly available information

Chungang Yan

Tongji University

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
5 October 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YXYu Xie
Yu Xie
GLGuanjun Liu
Guanjun Liu
CYChungang Yan
Chungang Yan
CJChangjun Jiang
Changjun Jiang
Mengchu ZhouMengchu Zhou
Mengchu Zhou
Maozhen LiMaozhen Li
Maozhen Li
Credit card fraud detection is a challenging task since fraudulent actions are hidden in massive legitimate behaviors. This work aims to learn a new representation for each transaction record based on the historical transactions of users in order to capture fraudulent patterns accurately and, thus, automatically detect a fraudulent transaction. We propose a novel model by improving long short-term memory with a time-aware gate that can capture the behavioral changes caused by consecutive transactions of users. A current-historical attention module is designed to build up connections between current and historical transactional behaviors, which enables the model to capture behavioral periodicity. An interaction module is designed to learn comprehensive and rational behavioral representations. To validate the effectiveness of the learned behavioral representations, experiments are conducted on a large real-world transaction dataset provided to us by a financial company in China, as well as a public dataset. Experimental results and the visualization of the learned representations illustrate that our method delivers a clear distinction between legitimate behaviors and fraudulent ones, and achieves better fraud detection performance compared with the state-of-the-art methods.

30 March 2022 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
YXYu Xie
Yu Xie
GLGuanjun Liu
Guanjun Liu
CYChungang Yan
Chungang Yan
CJChangjun Jiang
Changjun Jiang
Mengchu ZhouMengchu Zhou
Mengchu Zhou
With the popularity of credit cards worldwide, timely and accurate fraud detection has become critically important to ensure the safety of their user accounts. Existing models generally utilize original features or manually aggregated features as their transactional representations, while they fail to reveal the hidden fraudulent behaviors. In this work, we propose a novel model to extract transactional behaviors of users and learn new transactional behavioral representations for credit card fraud detection. Considering the characteristics of transactional behaviors, two time-aware gates are designed in a recurrent neural net unit to learn long- and short-term transactional habits of users, respectively, and to capture behavioral changes of users caused by different time intervals between their consecutive transactions. A time-aware-attention module is proposed and employed to extract the behavioral information from their consecutive historical transactions with time intervals, which enables the proposed model to capture behavioral motive and periodicity inside their historical transactional behaviors. An interaction module is designed to learn more comprehensive and rational representations. To prove the effectiveness of the learned transactional behavioral representations, experiments are conducted on a large real-world transaction dataset and a public one. The results show that the learned representation can well distinguish fraudulent behaviors from legitimate ones, and the proposed method can improve the performance of credit card fraud detection in terms of various evaluation criteria over the state-of-the-art methods.

19 April 2024 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
MGMingjian Guang
Mingjian Guang
CYChungang Yan
Chungang Yan
YXYuhua Xu
Yuhua Xu
JWJunli Wang
Junli Wang
CJChangjun Jiang
Changjun Jiang
Graph convolutional networks (GCNs) can quickly and accurately learn graph representations and have shown powerful performance in many graph learning domains. Despite their effectiveness, neighborhood awareness remains essential and challenging for GCNs. Existing methods usually perform neighborhood-aware steps only from the node or hop level, which leads to a lack of capability to learn the neighborhood information of nodes from both global and local perspectives. Moreover, most methods learn the nodes’ neighborhood information from a single view, ignoring the importance of multiple views. To address the above issues, we propose a multi-view adaptive neighborhood-aware approach to learn graph representations efficiently. Specifically, we propose three random feature masking variants to perturb some neighbors’ information to promote the robustness of graph convolution operators at node-level neighborhood awareness and exploit the attention mechanism to select important neighbors from the hop level adaptively. We also utilize the multi-channel technique and introduce a proposed multi-view loss to perceive neighborhood information from multiple perspectives. Extensive experiments show that our method can better obtain graph representation and has high accuracy.

1 January 2021 in Mathematical Biosciences and Engineering
Verified
Journal Article
Open access
PDF file
KZKun Zhai
Kun Zhai
QRQiang Ren
Qiang Ren
JWJunli Wang
Junli Wang
CYChungang Yan
Chungang Yan
Federated learning is a novel framework that enables resource-constrained edge devices to jointly learn a model, which solves the problem of data protection and data islands. However, standard federated learning is vulnerable to Byzantine attacks, which will cause the global model to be manipulated by the attacker or fail to converge. On non-iid data, the current methods are not effective in defensing against Byzantine attacks. In this paper, we propose a Byzantine-robust framework for federated learning via credibility assessment on non-iid data (BRCA). Credibility assessment is designed to detect Byzantine attacks by combing adaptive anomaly detection model and data verification. Specially, an adaptive mechanism is incorporated into the anomaly detection model for the training and prediction of the model. Simultaneously, a unified update algorithm is given to guarantee that the global model has a consistent direction. On non-iid data, our experiments demonstrate that the BRCA is more robust to Byzantine attacks compared with conventional methods.

4 May 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
MGMingjian Guang
Mingjian Guang
CYChungang Yan
Chungang Yan
YXYuhua Xu
Yuhua Xu
JWJunli Wang
Junli Wang
CJChangjun Jiang
Changjun Jiang
Graph convolutional networks (GCNs) have shown superior performance on graph classification tasks, and their structure can be considered as an encoder–decoder pair. However, most existing methods lack the comprehensive consideration of global and local in decoding, resulting in the loss of global information or ignoring some local information of large graphs. And the commonly used cross-entropy loss is essentially an encoder–decoder global loss, which cannot supervise the training states of the two local components (encoder and decoder). We propose a multichannel convolutional decoding network (MCCD) to solve the above-mentioned problems. MCCD first adopts a multichannel GCN encoder, which has better generalization than a single-channel GCN encoder since different channels can extract graph information from different perspectives. Then, we propose a novel decoder with a global-to-local learning pattern to decode graph information, and this decoder can better extract global and local information. We also introduce a balanced regularization loss to supervise the training states of the encoder and decoder so that they are sufficiently trained. Experiments on standard datasets demonstrate the effectiveness of our MCCD in terms of accuracy, runtime, and computational complexity.

20 June 2023 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
JYJiamin Yao
Jiamin Yao
CYChungang Yan
Chungang Yan
JWJunli Wang
Junli Wang
CJChangjun Jiang
Changjun Jiang
The explosive development of the Internet of Things (IOT) has stimulated the sudden and dynamic demand pattern of potential Service Function Chain (SFC) traffic. The virtual network built based on the requirements of Multiple SFCs (Multi-SFCs), sharing the resource, should provide better Quality of Experience (QoE) for Multi-SFCs according to the real-time network status. However, simultaneous Multi-SFCs in the routing process compete for the VNF resources of the same node and preempt the same link. The instability of QoE caused by node invalidation and link faults is highlighted. Therefore, to provide a more efficient and stable service to Multi-SFCs, quantitative QoE utility and stability models and cooperative Multi-SFCs path allocation are needed. Considering the limited resources, this paper designs a stable QoE-aware Multi-SFCs Cooperative Routing Mechanism (CRM) based on Deep Reinforcement Learning (DRL). Firstly, we model the problem of Multi-SFCs cooperative routing aiming at optimizing diverse QoEs of utility, stability and delay, and formulate it as a multi-objective optimization problem. Moreover, the QoE stable queueing model based on node and link availability is formulated by Lyapunov drift, which can potentially mitigate the QoE fluctuations. Then we associate triple Dueling Deep Q-Networks (DDQNs) and propose a cooperative computing multi-task DRL to obtain the optimal path allocation policy. Experiments are conducted to verify the effectiveness and the results show that our method outperforms its peers on QoE, delay, throughput and stability.