Le Cheng

Le Cheng

Auto-generated profile, based on publicly available information

Le Cheng

School of Computer Science, Northwestern Polytechnical University (NWPU), Xian, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
24 February 2022 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
Peican ZhuPeican Zhu
Peican Zhu
LCLe Cheng
Le Cheng
Chao GaoChao Gao
Chao Gao
ZWZhen Wang
Zhen Wang
XLXuelong Li
Xuelong Li
With the development of modern technology, numerous economic losses are incurred by various spreading phenomena. Thus, it is of great significance to identify the initial sources triggering such phenomena. The investigation of source localization in social networks has gained substantial attention and become a popular topic of study. For practical spreading phenomena on social networks, the infection rates are relatively low. Hence, a high uncertainty of spreading trace might be incurred, which further incurs the reduction of localization accuracy obtained through existed source localization methods, especially the observer-based ones. Aiming to solve the source localization problem with a low infection rate, we propose a novel localization algorithm, i.e., path-based source identification (PBSI). First, a small number of nodes are selected and designated as observers. After the propagation process triggered by sources, we can obtain a snapshot. Later, a label is assigned to represent whether a node is infected or not, and observers are supposed to record the paths through which nodes are successfully infected. Based on source centrality theory, observers make the labels flow in the direction recorded during the label iteration process, which ensures the labels of nodes in the direction of the source increase gradually. Extensive experiments indicate that the proposed PBSI can handle source localization problems for both single and multi-source scenarios with better performance than that of state-of-the-art algorithms under different propagation models.

5 September 2024 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
LCLe Cheng
Le Cheng
Peican ZhuPeican Zhu
Peican Zhu
Chao GaoChao Gao
Chao Gao
ZWZhen Wang
Zhen Wang
XLXuelong Li
Xuelong Li
The rapid development of social networks has given opportunities for rumors to disturb the order of society. However, due to the diversity and complexity of users and information dissemination dynamics, localizing the rumor sources in social networks is still a critical and crucial problem yet to be well solved. Recent years, although several methods have been proposed to attempt to solve this problem, they suffer from the contradiction between accuracy and model complexity. To detect information sources efficiently, this article propose a heuristic framework for sources detection (HFSD) in social networks via graph convolutional networks which handles three major challenges, including: 1) the diversity and complexity of users and information dissemination dynamics; 2) difficulty to detect multiple sources, especially without knowing the number of sources; and 3) the class imbalance problem caused by the large differences in sample size of sources and nonsources. Specifically, first, to counteract the diversity and complexity of users and information, different kinds of features of users and information are encoded in the raw feature vectors; second, to address multisource detection, we adopt a binary classification in the last layer of model, which is different from the n-classification methods that are always applied to single-source scenario; finally, to solve the class imbalance problem, we design a balance mechanism which offsets the differences in sample size between the sets of sources and nonsources. Extensive experiments conducted on 12 real-world datasets demonstrate that HFSD can handle problems mentioned above and outperforms than state-of-the-art algorithms significantly.

28 June 2023 in Physica A: Statistical Mechanics and its Applications
Verified
Journal Article
Closed access
LCLe Cheng
Le Cheng
PZPeican Zhu
Peican Zhu
WSWu Sun
Wu Sun
ZHZhen Han
Zhen Han
KTKeke Tang
Keke Tang
XCXiaodong Cui
Xiaodong Cui

11 March 2025 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
LCLe Cheng
Le Cheng
Peican ZhuPeican Zhu
Peican Zhu
KTKeke Tang
Keke Tang
Chao GaoChao Gao
Chao Gao
ZWZhen Wang
Zhen Wang
Rumor source detection in structurally incomplete networks holds significant practical importance. Existing methods predominantly assume a complete network structure information; furthermore, they often neglect the issue of resource consumption, i.e., sensor deployment. In this paper, we propose an efficient source detection approach in incomplete networks via propagation-aware Sensor Deployment and time stamp-guided Source Approaching (SDSA) to tackle these challenges. Specifically, during the sensor deployment phase, we employ quality-guaranteed Monte Carlo propagation simulations coupled with a greedy strategy to achieve maximum coverage with minimal sensors. In the source detection phase, for the structurally incomplete network snapshots, we first attempt edge reconnection from the sensor with the earliest timestamp, followed by posterior maximization Bayesian estimation for source identification. Extensive experiments demonstrate the effectiveness of SDSA and its superiority over state-of-the-art methods. The code has been made publicly available at https://github.com/cheng-le/SDSA.

31 December 2024 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
LCLe Cheng
Le Cheng
Peican ZhuPeican Zhu
Peican Zhu
Chao GaoChao Gao
Chao Gao
ZWZhen Wang
Zhen Wang
XLXuelong Li
Xuelong Li
The dissemination of rumors imposes substantial hazards. Therefore, accurately identifying the source of rumor and promptly controlling information propagation hold paramount practical significance. Presently, prevailing sensor deployment methods solely focus on network structural information, disregarding the propagation process, thus incurring certain limitations. Additionally, source detection methods presuppose reliable assumptions, i.e., complete network structure and observational data. However, due to temporal constraints and cost considerations, the acquired network information is often structurally incomplete: partial edges missing. To address these issues, this paper introduces a novel approach, namely Source Detection in Structurally Incomplete social networks (SDSI). Firstly, to monitor the network efficiently, a certain number of sensors are deployed using quality-guaranteed Monte Carlo simulations to achieve maximum coverage. In the source detection phase, considering the acquired incomplete information, the source node is determined based on Bayesian posterior maximum estimation. Additionally, SDSI is enhanced through incorporating the sharing counts of the information in social networks. Extensive experiments in diverse scenarios demonstrate the superiority and robustness of the proposed SDSI.