6 July 2025 in Nature Communications
Discovering governing equations of complex network dynamics is a fundamental challenge in contemporary science with rich data, which can uncover the hidden patterns and mechanisms of the formation and evolution of complex phenomena in various fields and assist in decision-making. In this work, we develop a universal computational tool that can automatically, efficiently, and accurately learn the symbolic patterns of changes in complex system states by combining the excellent fitting capability of deep learning with the equation inference ability of pre-trained symbolic regression. We perform extensive and intensive experimental verifications on more than ten representative scenarios from fields such as physics, biochemistry, ecology, and epidemiology. The results demonstrate the remarkable effectiveness and efficiency of our tool compared to state-of-the-art symbolic regression techniques for network dynamics. The application to real-world systems including global epidemic transmission and pedestrian movements has verified its practical applicability. We believe that our tool can serve as a universal solution to dispel the fog of hidden mechanisms of changes in complex phenomena, advance toward interpretability, and inspire further scientific discoveries.
1 May 2023 in IEEE Transactions on Mobile Computing
Fault Scenario Identification (FSI) is a challenging task that aims to automatically identify the fault types in communication networks from massive alarms to guarantee effective fault recoveries. Existing methods are developed based on rules, which are not accurate enough due to the mismatching issue. In this paper, we propose an effective method named Knowledge-Enhanced Graph Neural Network (KE-GNN), the main idea of which is to integrate the advantages of both the rules and GNN. This work is the first work that employs GNN and rules to tackle the FSI task. Specifically, we encode knowledge using propositional logic and map them into a knowledge space. Then, we elaborately design a teacher-student scheme to minimize the distance between the knowledge embedding and the prediction of GNN, integrating knowledge and enhancing the GNN. To validate the performance of the proposed method, we collected and labeled three real-world 5G fault scenario datasets. Extensive evaluation conducted on these datasets indicates that our method achieves the best performance compared with other representative methods, improving the accuracy by up to 8.10%. Furthermore, the proposed method achieves the best performance against a small dataset setting and can be effectively applied to a new carrier site with a different topology structure.
6 July 2022 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
With the rapid development of mobile networks and the ubiquity of mobile devices, spatial crowdsourcing (SC), which refers to assigning spatial–temporal tasks to moving workers, has drawn increasing attention. Thus, many researchers aim at various task assignment methods in SC. However, existing works generally consider workers’ location and preference categories separately. Ignorance of the correlation between them can often lead to poor assignment results. In this article, we propose a location-and-preference joint prediction model (JPM) to predict workers’ locations and preference categories jointly at each sample timestamp. Based on the predictive location probability distribution and preference probability distribution, we elaborately design a greedy multiattribute joint task assignment algorithm (MAJA) to maximize the average number of completed tasks under constraints. Then, an overall procedure incorporating the JPM and MAJA, called the location-and-preference joint prediction-based task assignment (LPJTA), is implemented to focus on assigning tasks to workers who are near the task location and willing to perform the task based on predicting locations and preference categories. We theoretically analyze the time complexity and approximation ratio of the proposed methods and construct extensive experiments on three real datasets to empirically verify their effectiveness, comparing with the state-of-the-art baselines.
5 August 2022 in Applied Intelligence
13 October 2020 in IEEE Transactions on Neural Networks and Learning Systems
We propose a general and scalable global optimization framework directly operating on annotated graph data by introducing a Bayesian graph neural network to approximate the expensive-to-evaluate objectives. It prevents the cubical complexity of Gaussian processes and can scale linearly with the number of observations. Its parallelized variant makes it scalable. We provide strict theoretical support on its convergence. Intensive experiments conducted on both artificial and real-world problems, including molecular discovery and urban road network design, demonstrate the effectiveness of the proposed methods compared with the current state of the art.