Xuelong Yu

Xuelong Yu

Auto-generated profile, based on publicly available information

Xuelong Yu

Northeastern University

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
1 January 2023 in Evidence-Based Complementary and Alternative Medicine
Verified
Journal Article
Open access
PDF file
XYXuelong Yu
Xuelong Yu
XLXiao Liu
Xiao Liu
LLLi Luo
Li Luo
HZHai Zhao
Hai Zhao
Existing research combines acupuncture theory with network science and proposes a new paradigm for the study of acupoint selection patterns—a key acupoint mining algorithm based on acupoint networks. However, the basic idea of this study for finding key acupoints is based on binary acupoint synergy relationships, which ignores the higher‐order synergy among multiple acupoints and does not truly reflect the implicit patterns of each acupoint among meridian systems. Moreover, the mining results assessment method, which this new paradigm involves, does not have wide applicability and universality. In this paper, with the introduction of higher‐order interactions between multiple acupoints, a high‐specificity key acupoint mining algorithm based on 3‐node motif is proposed in the acupoint‐disease network (ADN). In response to the narrow applicability of the new research paradigm involving the evaluation of algorithms’ measures, new and widely applicable and universal evaluation criteria are introduced in terms of resolution, network loss, and accuracy, respectively. Based on the principles of acupoint selection involved in acupuncture clinics in Chinese medicine, the acupoints involved in the data were divided into a total of 19 regions according to their distribution characteristics. From these 19 regions, we selected the key acupoints that have a large impact on the global network. Finally, we compared this algorithm with five other acupoint importance assessment algorithms in terms of resolution, network loss, and accuracy, respectively. The comprehensive results show that the algorithm identifies key acupoints with an accuracy of 63%, which is 14% to 21% higher than other existing methods. The key acupoints identified by the algorithm have a significant disruptive effect on the connectivity of the network, indicating that the key acupoints are at the core of the acupoint‐disease network topology. They have a significant propagation influence on other acupoints, which means that the key acupoints have high‐synergistic cooperation with other acupoints. Meanwhile, the stability and specificity of the algorithm ensure the reliability of the key acupoints. We believe that the key acupoints identified by the algorithm can be used as core acupoints from the perspective of network topology and high synergy of other acupoints, respectively, and help researchers explore targeted and high‐impact combinations of acupoints to optimize existing acupuncture prescriptions under condition constraints.

16 September 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XYXuelong Yu
Xuelong Yu
SYShukun Yang
Shukun Yang
WCWenpeng Chen
Wenpeng Chen
HZHai Zhao
Hai Zhao
KZKuan Zhang
Kuan Zhang
XLXiao Liu
Xiao Liu
Identifying influential spreaders in a temporal social network (TSN), which has potential applications, including network immunization, epidemic control, and viral marketing, is a fundamental class of problems. In this context, various centrality algorithms have been introduced to quantify influential spreaders, focusing on three categories: 1) topology-based methods; 2) dynamics-based methods; and 3) machine learning-based methods. However, topology-based methods tend to consider single temporal features, while the consideration of multitemporal features is subject to the same challenges of high-temporal complexity as dynamics-based methods, and machine learning-based methods face challenges related to dependency on the training dataset. In this article, we propose a novel centrality algorithm based on multiple diffusion information (RPT: Multidiffusion information centrality based on R-path trees) to identify the influential node in a TSN. This algorithm considers three different temporal features and has lower temporal complexity using a newly proposed representation structure known as an R-path tree (a distinctive inverted tree that encompasses the earliest arrival paths from other nodes to the root node). Through experiments carried out on 12 empirical social networks, the results show that the effectiveness of RPT in identifying influential spreaders generally exceeds that of other baseline measures.

21 November 2026 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
WCWenpeng Chen
Wenpeng Chen
KZKuan Zhang
Kuan Zhang
XYXuelong Yu
Xuelong Yu
HZHai Zhao
Hai Zhao
CYChong Yu
Chong Yu