A Memetic algorithm for determining robust and influential seeds against structural perturbances in competitive networks

S Wang, X Tan - Information Sciences, 2023 - Elsevier
The influence maximization problem has attracted increasing attention in previous studies.
Recent years have witnessed an enormous interest in the modeling, performance …

An edge-aware graph autoencoder trained on scale-imbalanced data for traveling salesman problems

S Liu, X Yan, Y Jin - Knowledge-Based Systems, 2024 - Elsevier
In recent years, there has been a notable surge in research on machine learning techniques
for combinatorial optimization. It has been shown that learning-based methods outperform …

Enhancing the robustness of influential seeds towards structural failures on competitive networks via a memetic algorithm

S Wang, W Liu - Knowledge-Based Systems, 2023 - Elsevier
Networked systems present the correlative relation between entities, and the related
knowledge excavation problem has been greatly emphasized in the last decade. The …

Finding robust and influential nodes on directed networks using a memetic algorithm

Z Ou, S Wang - Swarm and Evolutionary Computation, 2024 - Elsevier
The influence maximization problem is a research hotspot on social networks, which
involves selecting a set of nodes as seeds to maximize the influence spread. The robust …

[HTML][HTML] A new technique for influence maximization on social networks using a moth-flame optimization algorithm

Q Cui, F Liu - Heliyon, 2023 - cell.com
In our modern digital era, social networks have seamlessly integrated into the fabric of our
daily lives. These digital platforms serve as vital channels for communication, exchanging …

A multi-factorial evolutionary algorithm concerning diversity information for solving the multitasking Robust Influence Maximization Problem on networks

M Chen, S Wang, J Zhang - Connection Science, 2023 - Taylor & Francis
In recent years, one of the prominent research areas in the complex network field has been
the Influence Maximization Problem. This problem focuses on selecting seed sets to achieve …

IS-GNN: Graph neural network enhanced by aggregating influential and structurally similar nodes

W Yang, L Li, S Bai, Z Ma - Knowledge-Based Systems, 2024 - Elsevier
Nowadays, it has been demonstrated that graph neural networks (GNNs) are a powerful tool
for graph representation learning. However, most GNN models are shallow ones because …

A multi-factor evolutionary algorithm for solving the multi-tasking robust optimization problem on networked systems

M Chen, S Wang, J Zhang - Applied Soft Computing, 2024 - Elsevier
Realistic networks constantly face complex environments and are vulnerable to external
disturbances that can damage their structure and disrupt information flow. These challenges …

On Optimization of Short Video Data Dissemination in Edge Networks

Z Li, Z Li, X Chen - IEEE Internet of Things Journal, 2023 - ieeexplore.ieee.org
To optimize short video data dissemination in edge networks, we propose a novel 3-layered
network model. Based on the model, we investigate the optimal edge caching node …

Seed Selection Algorithm using Centrality based Entropy

KJ Rabadiya, R Patel - International Journal of Computing and …, 2023 - journals.uob.edu.bh
In the field of research in social networks, the influence maximization problem has captured
an abundance of attention. Mostly, influence maximization is performed by selecting the best …