Yingle Li

Mr. Yingle Li

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
3 February 2024 in Intelligent Data Analysis: An International Journal
Verified
Journal Article
Closed access
PDF file
YZYuhang Zhu
Yuhang Zhu
JGJing Guo
Jing Guo
HLHaitao Li
Haitao Li
SLShuxin Liu
Shuxin Liu
YLYingle Li
Yingle Li
Temporal link prediction based on graph neural networks has become a hot spot in the field of complex networks. To solve the problems of the existing temporal link prediction methods based on graph neural networks do not consider the future time-domain features and spatial-domain features are limited used, this paper proposes a novel temporal link prediction method based on two streams adaptive graph neural networks. Firstly, the network topology features are extracted from the micro, meso, and middle perspectives. Combined with the adaptive mechanism of convolution and self-attention, the preprocessing of the feature extraction is more effective; Secondly, an extended bi-directional long short-term memory network is proposed, which uses graph convolution to process topological features, and recursively learns the state vectors of the target snapshot by using the future time-domain information and the past historical information; Thirdly, the location coding is replaced by the time-coding for the transformer mechanism, so that past information and future information can be learned from each other, and the time-domain information of the network can be further mined; Finally, a novel two-stream network framework is proposed, which combines the processing results of point features and edge features. The experimental results on 9 data sets show that the proposed method has a better prediction effect and better robustness than the classical graph neural network methods.

7 June 2024 in Axioms
Verified
Journal Article
Open access
PDF file
YLYingle Li
Yingle Li
HYHongtao Yu
Hongtao Yu
LHLi Haitao
Li Haitao
FPFei Pan
Fei Pan
SLShu-Xin Liu
Shu-Xin Liu
Graph anomaly detection aims to identify unusual patterns or structures in graph-structured data. Most existing research focuses on anomalous nodes in ordinary graphs with pairwise relationships. However, complex real-world systems often involve relationships that go beyond pairwise relationships, and insufficient attention is paid to hypergraph anomaly detection, especially anomalous hyperedge detection. Some existing methods for researching hypergraphs involve transforming hypergraphs into ordinary graphs for learning, which can result in poor detection performance due to the loss of high-order information. We propose a new method for Anomalous Hyperedge Detection on Symmetric Line Expansion (AHD-SLE). The SLE of a hypergraph is an ordinary graph with pairwise relationships and can be backmapped to the hypergraph, so the SLE is able to preserve the higher-order information of the hypergraph. The AHD-SLE first maps the hypergraph to the SLE; then, the information is aggregated by Graph Convolutional Networks (GCNs) in the SLE. After that, the hyperedge embedding representation is obtained through a backmapping operation. Finally, an anomaly function is designed to detect anomalous hyperedges using the hyperedge embedding representation. Experiments on five different types of real hypergraph datasets show that AHD-SLE outperforms the baseline algorithm in terms of Area Under the receiver operating characteristic Curve(AUC) and Recall metrics.

14 November 2024 in Entropy
Verified
Journal Article
Open access
PDF file
LHLi Haitao
Li Haitao
LJLixin Ji
Lixin Ji
YLYingle Li
Yingle Li
SLShu-Xin Liu
Shu-Xin Liu
The growing importance of critical infrastructure systems (CIS) makes maintaining their normal operation against deliberate attacks such as terrorism a significant challenge. Combining game theory and complex network theory provides a framework for analyzing CIS robustness in adversarial scenarios. Most existing studies focus on single-layer networks, while CIS are better modeled as multilayer networks. Research on multilayer network games is limited, lacking methods for constructing incomplete information through link hiding and neglecting the impact of cascading failures. We propose a multilayer network Stackelberg game model with incomplete information considering cascading failures (MSGM-IICF). First, we describe the multilayer network model and define the multilayer node-weighted degree. Then, we present link hiding rules and a cascading failure model. Finally, we construct MSGM-IICF, providing methods for calculating payoff functions from the different perspectives of attackers and defenders. Experiments on synthetic and real-world networks demonstrate that link hiding improves network robustness without considering cascading failures. However, when cascading failures are considered, they become the primary factor determining network robustness. Dynamic capacity allocation enhances network robustness, while changes in dynamic costs make the network more vulnerable. The proposed method provides a new way of analyzing the robustness of diverse CIS, supporting resilient CIS design.

27 January 2026 in Information Processing & Management
Verified
Journal Article
Closed access
QOQi Ouyang
Qi Ouyang
HCHongchang Chen
Hongchang Chen
SLShu-Xin Liu
Shu-Xin Liu
RLRan Li
Ran Li
KWKai Wang
Kai Wang
YLYingle Li
Yingle Li

28 December 2017 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YWYiteng Wu
Yiteng Wu
HYHongtao Yu
Hongtao Yu
RHRuiyang Huang
Ruiyang Huang
YLYingle Li
Yingle Li
SLSenjie Lin
Senjie Lin
The theoretical limit of link prediction is a fundamental problem in this field. Taking the network structure as object to research this problem is the mainstream method. This paper proposes a new viewpoint that link prediction methods can be divided into single or combination methods, based on the way they derive the similarity matrix, and investigates whether there a theoretical limit exists for combination methods. We propose and prove necessary and sufficient conditions for the combination method to reach the theoretical limit. The limit theorem reveals the essence of combination method that is to estimate probability density functions of existing links and nonexistent links. Based on limit theorem, a new combination method, theoretical limit fusion (TLF) method, is proposed. Simulations and experiments on real networks demonstrated that TLF method can achieve higher prediction accuracy.

20 May 2026 in Physica A: Statistical Mechanics and its Applications
Verified
Journal Article
Closed access
YLYingle Li
Yingle Li
KWKai Wang
Kai Wang
ZHZanyuan He
Zanyuan He
XLXing Li
Xing Li
YZYuhang Zhu
Yuhang Zhu
SLShu-Xin Liu
Shu-Xin Liu