Yingjie Xie

Ms. Yingjie Xie


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
1 February 2023 in Information Sciences
Verified
Journal Article
Closed access
YXYingjie Xie
Yingjie Xie
WWWenjun Wang
Wenjun Wang
MSMinglai Shao
Minglai Shao
TLTianpeng Li
Tianpeng Li
YYYandong Yu
Yandong Yu

22 November 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
PJPengfei Jiao
Pengfei Jiao
TLTianpeng Li
Tianpeng Li
YXYingjie Xie
Yingjie Xie
YWYinghui Wang
Yinghui Wang
WWWenjun Wang
Wenjun Wang
Huaming WuHuaming Wu
Huaming Wu
Anomaly detection in dynamic networks aims to find network elements with significantly different behaviors from the vast majority. Most existing methods focus on one specific task, that is, only detect anomalies of one type of element isolated, so they lose the ability to model the correlation and driving mechanism between different abnormal behavior. Considering that the anomaly detection of one type of element is helpful to other types of elements. In this paper, we propose a unified Generation model to analyze the dynamic network for Exploring the Abnormal Behaviors of different Scales (GEABS). It can model the relation and catch different levels of anomaly with a joint statistical network model and detect the community structure and its evolution. Specifically, we denote the parameters of node popularity, community membership to generate the dynamic network, we also describe the varying of node and community by dynamic process. It can detect the change point on network, temporal evolution on community and abnormal behavior on node level synchronously, besides, it also detects the community structure effectively. We also propose an effective optimization algorithm with variational inference. Experimental results show that the GEABS achieves better performance on abnormal behavior and community structure compared with baselines.

29 August 2020 in Complexity
Verified
Journal Article
Open access
PDF file
QTQiang Tian
Qiang Tian
WWWenjun Wang
Wenjun Wang
YXYingjie Xie
Yingjie Xie
Huaming WuHuaming Wu
Huaming Wu
PJPengfei Jiao
Pengfei Jiao
LPLin Pan
Lin Pan
Identification of community structures and the underlying semantic characteristics of communities are essential tasks in complex network analysis. However, most methods proposed so far are typically only applicable to assortative community structures, that is, more links within communities and fewer links between different communities, which ignore the rich diversity of community regularities in real networks. In addition, the node attributes that provide rich semantics information of communities and networks can facilitate in-depth community detection of structural information. In this paper, we propose a novel unified Bayesian generative model to detect generalized communities and provide semantic descriptions simultaneously by combining network topology and node attributes. The proposed model is composed of two closely correlated parts by a transition matrix; we first apply the concept of a mixture model to describe network regularities and then adjust the classic Latent Dirichlet Allocation (LDA) topic model to identify community semantically. Thus, the model can detect broad types of network structure regularities, including assortative structures, disassortative structures, and mixture structures and provide multiple semantic descriptions for the communities. To optimize the objective function of the model, we use an effective Gibbs sampling algorithm. Experiments on a number of synthetic and real networks show that our model has superior performance compared with some baselines on community detection.

7 January 2026 in International Journal of Modern Physics C
Verified
Journal Article
Closed access
YXYingjie Xie
Yingjie Xie
WWWenjun Wang
Wenjun Wang
YLYanfei Liu
Yanfei Liu
WSWei Sun
Wei Sun
HXHuitong Xu
Huitong Xu

16 October 2026 in Expert Systems
Verified
Journal Article
Closed access
YXYingjie Xie
Yingjie Xie
WWWenjun Wang
Wenjun Wang
TLTianpeng Li
Tianpeng Li
LXLi XiaoMing
Li XiaoMing
LWLin Yuanbo Wu
Lin Yuanbo Wu

2 July 2026 in Algorithms
Verified
Journal Article
Open access
PDF file
YXYingjie Xie
Yingjie Xie
YLYinbo Liu
Yinbo Liu
YLYanfei Liu
Yanfei Liu
JLJunfang Li
Junfang Li
WWWenjun Wang
Wenjun Wang
Change point detection in dynamic social graphs aims to identify significant transitions in evolving interaction patterns. The task is particularly challenging due to sparse and noisy interactions and frequent user turnover, while the existing methods largely overlook the semantic and emotional signals in user-generated content by focusing primarily on structural changes. To address these limitations, this paper proposes ECPD-SG, an emotion-aware contrastive prototype learning algorithm for unsupervised change point detection in dynamic social graphs. ECPD-SG constructs emotion-aware graph snapshots by integrating textual and affective features into node representations and recalibrating interaction weights through emotion-aware attention. It then summarizes temporal node representations into adaptive prototypes and models their evolution using optimal-transport-based alignment and contrastive learning. Change points are detected from prototype-level shift scores with an adaptive CUSUM decision rule. Experiments on real-world dynamic social graph datasets show that ECPD-SG achieves competitive or superior performance over representative baselines, while ablation and sensitivity analyses verify the effectiveness of its key components.