Frequent itemset-driven search for finding minimal node separators and its application to air transportation network analysis

Y Zhou, X Zhang, N Geng, Z Jiang… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
The-separator problem (-SP) consists of finding the minimum set of vertices whose removal
separates the network into multiple different connected components with fewer than a limited …

Lo-Hi: Practical ML Drug Discovery Benchmark

S Steshin - Advances in Neural Information Processing …, 2024 - proceedings.neurips.cc
Finding new drugs is getting harder and harder. One of the hopes of drug discovery is to use
machine learning models to predict molecular properties. That is why models for molecular …

Using tabu search to avoid concave obstacles for source location

J Zhang, H Liu, P Zu, M Zhao, C Wang… - IEEE Transactions …, 2023 - ieeexplore.ieee.org
Recently, using a particle swarm optimizer (PSO) to guide robots in a source location
problem has attracted widespread interest. While being navigated by PSO, robots are easily …

Community-based dandelion algorithm-enabled feature selection and broad learning system for traffic flow prediction

X Liu, X Qin, MC Zhou, H Sun… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
In an intelligent transportation system, accurate traffic flow prediction can provide significant
help for travel planning. Even though some methods are proposed to do so, they focus on …

Scheduling Single-Arm Multicluster Tools for Two-Type Wafers With Lower-Bound Cycle Time

QH Zhu, GH Wang, NQ Wu, Y Qiao… - … on Systems, Man …, 2023 - ieeexplore.ieee.org
In today's semiconductor manufacturing industry, wafer foundries often face the challenge of
producing a variety of integrated circuit chip products using a single manufacturing line. To …

Learning to Detect Critical Nodes in Sparse Graphs via Feature Importance Awareness

X Tan, Y Zhou, MC Zhou, ZH Fu - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Detecting critical nodes in sparse graphs is important in a variety of application domains,
such as network vulnerability assessment, epidemic control, and drug design. The critical …

An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes

R Wang, M Zhou, J Wang, K Gao - Processes, 2023 - mdpi.com
Shortest path problems are encountered in many engineering applications, eg, intelligent
transportation, robot path planning, and smart logistics. The environmental changes as …

Network Disruption via Continuous Batch Removal: The Case of Sicilian Mafia

M Jia, P De Meo, B Gabrys, K Musial - arXiv preprint arXiv:2310.09987, 2023 - arxiv.org
Network disruption is pivotal in understanding the robustness and vulnerability of complex
networks, which is instrumental in devising strategies for infrastructure protection, epidemic …

Autoencoder and Teaching-learning-based Optimizer for Mobile Edge Computing System Optimization Problems

D Xu, M Zhou, H Yuan - 2023 IEEE International Conference on …, 2023 - ieeexplore.ieee.org
By using an autoencoder as a dimension reduction tool, an Autoencoder-embedded
Teaching-Learning Based Optimization (ATLBO) has been proved to be effective in solving …