Xiaqing Xie

Mrs. Xiaqing Xie

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
11 December 2024 in Electronics
Verified
Journal Article
Open access
PDF file
MDMei jun Ding
Mei jun Ding
PQPeng Qian
Peng Qian
JMJing MA
Jing MA
ZWZhiqiang Wang
Zhiqiang Wang
YLYueMing Lu
YueMing Lu
XXXiaqing Xie
Xiaqing Xie
Insider threats pose significant risks to organizational security, often leading to severe data breaches and operational disruptions. While foundational, traditional detection methods suffer from limitations such as labor-intensive rule creation, lack of scalability, and vulnerability to evasion by sophisticated attackers. Recent advancements in graph-based approaches have shown promise by leveraging behavior analysis for threat detection. However, existing methods frequently oversimplify session behaviors and fail to extract fine-grained features, which are critical for identifying subtle malicious activities. In this paper, we propose a novel approach that integrates session graphs to capture multi-level fine-grained behavioral features. First, seven heuristic rules are defined to transform user activities across different hosts and sessions into an associated session graph while extracting features at both the activity and session levels. Furthermore, to highlight critical nodes in the associated session graph, we introduce a graph node elimination technique to normalize the graph. Finally, a graph convolutional network is employed to extract features from the normalized graph and generate behavior detection results. Extensive experiments on the CERT insider threat dataset demonstrate the superiority of our approach, achieving an accuracy of 99% and an F1-score of 99%, significantly outperforming state-of-the-art models. The ASG method also reduces false positive rates and enhances the detection of subtle malicious behaviors, addressing key limitations of existing graph-based methods. These findings highlight the potential of ASG for real-world applications such as enterprise network monitoring and anomaly detection, and suggest avenues for future research into adaptive learning mechanisms and real-time detection capabilities.

16 June 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
XXXiaqing Xie
Xiaqing Xie
HGHangjiang Guo
Hangjiang Guo
YLYueMing Lu
YueMing Lu
TZTianle Zhang
Tianle Zhang
User Identity Linkage (UIL) has emerged as a focal point of research in the field of network analysis and plays a critical role in the governance of cyberspace; related technologies can also be extended for applications in traffic safety and traffic management. The traditional random walk-based UIL method has achieved a balance between performance and interpretability, but it still faces several challenges, such as low discriminability of nodes, instability of feature extraction, and missing features in matching scenarios. To address these challenges, this paper presents Adap-UIL, a multi-feature UIL framework based on an Adaptive Graph Walk. First, we design and implement an Adaptive Graph Walk method based on the Restarted Affinity Coefficient (RAC), which enhances both the neighborhood and higher-order features of nodes, and then we integrate cross-network features to form Adap-UIL with a more enriched node representation, facilitating user identity linkage. Experimental results on real datasets show that the Adap-UIL model outperforms the benchmark models, especially in the P@5 and P@10 metrics by 5 percentage points, and it captures key features more efficiently and effectively.

9 February 2024 in Electronics
Verified
Journal Article
Open access
PDF file
XXXiaqing Xie
Xiaqing Xie
WZWenyu Zang
Wenyu Zang
YHYanlin Hu
Yanlin Hu
JJJiangyu Ji
Jiangyu Ji
ZXZhihao Xiong
Zhihao Xiong
Random-walk-based graph representation methods have been widely applied in User Identity Linkage (UIL) tasks, which links overlapping users between two different social networks. It can help us to obtain more comprehensive portraits of criminals, which is helpful for improving cyberspace governance. Yet, random walk generates a large number of repeating sequences, causing unnecessary computation and storage overhead. This paper proposes a novel method called Edge-Removing Walk (ERW) that can replace random walk in random-walk-based models. It removes edges once they are walked in a walk round to capture the l−hop features without repetition, and it walks the whole graph for several rounds to capture the different kinds of paths starting from a specific node. Experiments proved that ERW can exponentially improve the efficiency for random-walk-based UIL models, even maintaining better performance. We finally generalize ERW into a general User Identity Linkage framework called ERW-UIL and verify its performance.



8 March 2019 in IOP Conference Series: Earth and Environmental Science
Verified
Conference Paper
Open access
PDF file
XWXu Wu
Xu Wu
YDYulun Dai
Yulun Dai
XXXiaqing Xie
Xiaqing Xie
For multi-dimensional feature of user data in network community, available methods mainly use Rank scoring algorithm or user classification algorithm for target user recognition. However, Rank method has a low performance, and the classification algorithm needs high construction cost. Therefore, this paper uses a target user recognition model integrating the user content analysis and the user behavior analysis to improve performance and speed of the target user recognition by a neural network content analysis model with a single-layer neural network and N-gram features for discovering automatically the user feature. The proposed method outperforms the current Rank scoring and classification methods in terms of performance, in which the F value reaches 0.89 and the accuracy reaches 0.91. Moreover, avoiding the cost of manual design dependent on specific tasks shortens the training time. Ten thousand data can be modeled in one minute.