4.7 Article

Topology selection for particle swarm optimization

Journal

INFORMATION SCIENCES
Volume 363, Issue -, Pages 154-173

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2016.04.050

Keywords

Particle swarm optimization; Topology selection; Data profile; Algorithm design

Funding

  1. National Natural Science Foundation of China [11271069, 61402545, 61309003]
  2. Natural Science Foundation of Guangdong Province, China [2015A030313648]
  3. Natural Science Foundations of Guangdong Province for Distinguished Young Scholars [2014A030306038]
  4. Project for Pearl River New Star in Science and Technology [201506010047]

Ask authors/readers for more resources

Particle swarm optimization (PSO) uses a social topology for particles to share information among neighbors during optimization. A large number of existing literatures have shown that the topology affects the performance of PSO and an optimal topology is problem dependent, but currently there is a lack of study on this issue. In this paper, we first analyze a class of deterministic regular topologies with regard to what affect the optimality of algorithmic parameters (e.g., the number of particles and the topological degree), so as to provide a guide to topology selections for PSO. Both theoretical analysis and numerical experiments are performed and reported in detail. The theoretical analysis reveals that the optimality of algorithmic parameters is dependent on the computational budget available. In particular, the optimal number of particles increases unstrictly as the computational budget increases, while for any fixed number of particles the optimal degree decreases unstrictly as computational budget increases. The only condition is that the computational budget cannot exceed a constant measuring the hardness of the benchmark function set With a total of 198 regular topologies and 9 different numbers of particles tested on 90 benchmark functions using a recently reported data profiling technique, numerical experiments verify the theoretical derivations. Based on these results, two formulas are developed to help choose optimal topology parameters for increased ease and applicability of PSO to real-world problems. (C) 2016 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Computer Science, Artificial Intelligence

Fitness and Distance Based Local Search With Adaptive Differential Evolution for Multimodal Optimization Problems

Zi-Jia Wang, Zhi-Hui Zhan, Yun Li, Sam Kwong, Sang-Woon Jeon, Jun Zhang

Summary: This paper proposes a novel local search technique, named FDLS, based on individual information including fitness and distance, to execute precise local search operations on global optima in multimodal algorithms, avoiding meaningless local search operations on local optima or similar areas. The proposed FDLS technique is integrated with an adaptive differential evolution algorithm called ADE, and the experiments on the CEC2015 multimodal competition demonstrate its effectiveness and superiority compared to other multimodal algorithms.

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE (2023)

Article Automation & Control Systems

Distributed Differential Evolution With Adaptive Resource Allocation

Jian-Yu Li, Ke-Jing Du, Zhi-Hui Zhan, Hua Wang, Jun Zhang

Summary: This article proposes a novel three-layer DDE framework, along with three novel methods, for solving the resource allocation and search efficiency problems in distributed differential evolution. The effectiveness and efficiency of the framework and methods are demonstrated through theoretical analysis and extensive experiments.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Automation & Control Systems

Graph-Based Deep Decomposition for Overlapping Large-Scale Optimization Problems

Xin Zhang, Bo-Wen Ding, Xin-Xin Xu, Jian-Yu Li, Zhi-Hui Zhan, Pengjiang Qian, Wei Fang, Kuei-Kuei Lai, Jun Zhang

Summary: Decomposition methods are important in CCEAs for solving large-scale optimization problems. The proposed GDD method improves the grouping accuracy by mining interactions among variables and dealing with computational roundoff errors. GDD shows better performance in grouping and fault tolerance, especially for overlapping problems.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2023)

Article Computer Science, Information Systems

Community Detection Based on Multiobjective Particle Swarm Optimization and Graph Attention Variational Autoencoder

Kun Guo, Zhanhong Chen, Xu Lin, Ling Wu, Zhi-Hui Zhan, Yuzhong Chen, Wenzhong Guo

Summary: In this paper, a novel algorithm is proposed that combines label propagation, multi-objective particle swarm optimization, and graph attention variational autoencoder to achieve community detection. The label propagation strategy is used to speed up the evolution process of the swarm, and the optimal solutions found by the optimization algorithm are embedded into the objective of the autoencoder to improve the quality of embedding vectors. Experimental results show the feasibility and effectiveness of our algorithm compared to state-of-the-art algorithms.

IEEE TRANSACTIONS ON BIG DATA (2023)

Article Computer Science, Information Systems

Bi-Directional Feature Fixation-Based Particle Swarm Optimization for Large-Scale Feature Selection

Jia-Quan Yang, Qi-Te Yang, Ke-Jing Du, Chun-Hua Chen, Hua Wang, Sang-Woon Jeon, Jun Zhang, Zhi-Hui Zhan

Summary: This article proposes a bi-directional feature fixation (BDFF) framework for particle swarm optimization (PSO) to reduce the search space in large-scale feature selection. BDFF uses two opposite search directions to guide particles to adequately search for feature subsets with different sizes. It can fix the selection states of some features and focus on the others when updating particles, thus narrowing the large search space.

IEEE TRANSACTIONS ON BIG DATA (2023)

Article Computer Science, Artificial Intelligence

Gene Targeting Differential Evolution: A Simple and Efficient Method for Large-Scale Optimization

Zi-Jia Wang, Jun-Rong Jian, Zhi-Hui Zhan, Yun Li, Sam Kwong, Jun Zhang

Summary: This article proposes a method called GT-based DE to solve large-scale optimization problems by targeting and modifying certain values in bottleneck dimensions. Experimental results show that GTDE is efficient and performs better or at least comparable to other state-of-the-art algorithms in solving LSOPs.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2023)

Article Computer Science, Artificial Intelligence

Enhanced Multi-Task Learning and Knowledge Graph-Based Recommender System

Min Gao, Jian-Yu Li, Chun-Hua Chen, Yun Li, Jun Zhang, Zhi-Hui Zhan

Summary: In this study, an enhanced MKR (EMKR) approach is proposed to address the two difficult issues in knowledge graph-based recommender systems. The attention mechanism and relation-aware graph convolutional neural network are utilized to capture users' historical behavior patterns and deep multi-relation semantic information. Additionally, a two-part modeling strategy is introduced for better representation of users in datasets with different sparsity. Experimental results show that EMKR outperforms state-of-the-art approaches, especially in sparse user-item interactions.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2023)

Article Automation & Control Systems

Transferable Adaptive Differential Evolution for Many-Task Optimization

Sheng-Hao Wu, Zhi-Hui Zhan, Kay Chen Tan, Jun Zhang

Summary: This article proposes a new evolutionary multitask optimization algorithm (EMTO) to address the similarity measurement and knowledge transfer issues. By considering the shift invariance between tasks, the proposed algorithm clusters similar tasks and transfers successful parameters among them. Experimental results demonstrate the superiority of the proposed algorithm in solving many-task optimization problems (MaTOPs).

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Automation & Control Systems

Strength Learning Particle Swarm Optimization for Multiobjective Multirobot Task Scheduling

Xiao-Fang Liu, Yongchun Fang, Zhi-Hui Zhan, Jun Zhang

Summary: Cooperative heterogeneous multirobot systems have been gaining attention recently for executing complex tasks using multiple heterogeneous robots. Allocating these robots to cooperative tasks is a significant optimization problem, and existing methods are not sufficient to address it. This study proposes a multiobjective model and a strength learning particle swarm optimization (SLPSO) to optimize multiple objectives. Experimental results demonstrate that SLPSO outperforms existing algorithms in terms of inverted generational distance and hypervolume metrics.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2023)

Article Automation & Control Systems

Block-Level Knowledge Transfer for Evolutionary Multitask Optimization

Yi Jiang, Zhi-Hui Zhan, Kay Chen Tan, Jun Zhang

Summary: This article proposes a block-level knowledge transfer (BLKT) framework to overcome the limitations of knowledge transfer in multitask optimization problems. BLKT divides individuals into blocks and transfers knowledge at the block-level, enabling transfer between similar dimensions belonging to the same or different tasks. Extensive experiments show that BLKT-based differential evolution outperforms state-of-the-art algorithms in multitask optimization and also achieves competitive performance in single-task global optimization.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Review Environmental Sciences

Knowledge graph of wastewater-based epidemiology development: A data-driven analysis based on research topics and trends

Zhihan Gao, Min Gao, Chun-Hua Chen, Yifan Zhou, Zhi-Hui Zhan, Yuan Ren

Summary: In this study, a self-developed text extraction tool called LitStraw was used to extract, analyze, and construct knowledge graphs from nearly 900 PDF research papers collected from Web of Science from 2000 to 2021. The results showed a growing number of interdisciplinary collaborations in wastewater-based epidemiology (WBE), with close collaboration between the USA, Australia, China, and European countries. While illicit drugs and pharmaceuticals remain hot research topics, specific research focuses have changed significantly, including new psychoactive substances, biomarkers, and stability. Additionally, the detection of SARS-CoV-2 RNA in sewage has become a major research focus since 2020. This work provides insights into the development of WBE and offers new ideas for paper mining analysis methods in different fields.

ENVIRONMENTAL SCIENCE AND POLLUTION RESEARCH (2023)

Article Computer Science, Artificial Intelligence

Scale adaptive fitness evaluation-based particle swarm optimisation for hyperparameter and architecture optimisation in neural networks and deep learning

Ye-Qun Wang, Jian-Yu Li, Chun-Hua Chen, Jun Zhang, Zhi-Hui Zhan

Summary: This research proposes a particle swarm optimization approach called SAFE-PSO that tackles the optimization problem of neural networks. Experimental results show that SAFE-PSO is effective and efficient on widely used datasets.

CAAI TRANSACTIONS ON INTELLIGENCE TECHNOLOGY (2023)

Article Computer Science, Information Systems

A consensus model considers managing manipulative and overconfident behaviours in large-scale group decision-making

Xia Liang, Jie Guo, Peide Liu

Summary: This paper investigates a novel consensus model based on social networks to manage manipulative and overconfident behaviors in large-scale group decision-making. By proposing a novel clustering model and improved methods, the consensus reaching is effectively facilitated. The feedback mechanism and management approach are employed to handle decision makers' behaviors. Simulation experiments and comparative analysis demonstrate the effectiveness of the model.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

CGN: Class gradient network for the construction of adversarial samples

Xiang Li, Haiwang Guo, Xinyang Deng, Wen Jiang

Summary: This paper proposes a method based on class gradient networks for generating high-quality adversarial samples. By introducing a high-level class gradient matrix and combining classification loss and perturbation loss, the method demonstrates superiority in the transferability of adversarial samples on targeted attacks.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Distinguishing latent interaction types from implicit feedbacks for recommendation

Lingyun Lu, Bang Wang, Zizhuo Zhang, Shenghao Liu

Summary: Many recommendation algorithms only rely on implicit feedbacks due to privacy concerns. However, the encoding of interaction types is often ignored. This paper proposes a relation-aware neural model that classifies implicit feedbacks by encoding edges, thereby enhancing recommendation performance.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Proximity-based density description with regularized reconstruction algorithm for anomaly detection

Jaehong Yu, Hyungrok Do

Summary: This study discusses unsupervised anomaly detection using one-class classification, which determines whether a new instance belongs to the target class by constructing a decision boundary. The proposed method uses a proximity-based density description and a regularized reconstruction algorithm to overcome the limitations of existing one-class classification methods. Experimental results demonstrate the superior performance of the proposed algorithm.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Non-iterative border-peeling clustering algorithm based on swap strategy

Hui Tu, Shifei Ding, Xiao Xu, Haiwei Hou, Chao Li, Ling Ding

Summary: Border-Peeling algorithm is a density-based clustering algorithm, but its complexity and issues on unbalanced datasets restrict its application. This paper proposes a non-iterative border-peeling clustering algorithm, which improves the clustering performance by distinguishing and associating core points and border points.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

A two-stage denoising framework for zero-shot learning with noisy labels

Long Tang, Pan Zhao, Zhigeng Pan, Xingxing Duan, Panos M. Pardalos

Summary: In this work, a two-stage denoising framework (TSDF) is proposed for zero-shot learning (ZSL) to address the issue of noisy labels. The framework includes a tailored loss function to remove suspected noisy-label instances and a ramp-style loss function to reduce the negative impact of remaining noisy labels. In addition, a dynamic screening strategy (DSS) is developed to efficiently handle the nonconvexity of the ramp-style loss.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Selection of a viable blockchain service provider for data management within the internet of medical things: An MCDM approach to Indian healthcare

Raghunathan Krishankumar, Sundararajan Dhruva, Kattur S. Ravichandran, Samarjit Kar

Summary: Health 4.0 is gaining global attention for better healthcare through digital technologies. This study proposes a new decision-making framework for selecting viable blockchain service providers in the Internet of Medical Things (IoMT). The framework addresses the limitations in previous studies and demonstrates its applicability in the Indian healthcare sector. The results show the top ranking BSPs, the importance of various criteria, and the effectiveness of the developed model.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Q-learning with heterogeneous update strategy

Tao Tan, Hong Xie, Liang Feng

Summary: This paper proposes a heterogeneous update idea and designs HetUp Q-learning algorithm to enlarge the normalized gap by overestimating the Q-value corresponding to the optimal action and underestimating the Q-value corresponding to the other actions. To address the limitation, a softmax strategy is applied to estimate the optimal action, resulting in HetUpSoft Q-learning and HetUpSoft DQN. Extensive experimental results show significant improvements over SOTA baselines.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Dyformer: A dynamic transformer-based architecture for multivariate time series classification

Chao Yang, Xianzhi Wang, Lina Yao, Guodong Long, Guandong Xu

Summary: This paper proposes a dynamic transformer-based architecture called Dyformer for multivariate time series classification. Dyformer captures multi-scale features through hierarchical pooling and adaptive learning strategies, and improves model performance by introducing feature-map-wise attention mechanisms and a joint loss function.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

ESSENT: an arithmetic optimization algorithm with enhanced scatter search strategy for automated test case generation

Xiguang Li, Baolu Feng, Yunhe Sun, Ammar Hawbani, Saeed Hammod Alsamhi, Liang Zhao

Summary: This paper proposes an enhanced scatter search strategy, using opposition-based learning, to solve the problem of automated test case generation based on path coverage (ATCG-PC). The proposed ESSENT algorithm selects the path with the lowest path entropy among the uncovered paths as the target path and generates new test cases to cover the target path by modifying the dimensions of existing test cases. Experimental results show that the ESSENT algorithm outperforms other state-of-the-art algorithms, achieving maximum path coverage with fewer test cases.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

An attention based approach for automated account linkage in federated identity management

Shirin Dabbaghi Varnosfaderani, Piotr Kasprzak, Aytaj Badirova, Ralph Krimmel, Christof Pohl, Ramin Yahyapour

Summary: Linking digital accounts belonging to the same user is crucial for security, user satisfaction, and next-generation service development. However, research on account linkage is mainly focused on social networks, and there is a lack of studies in other domains. To address this, we propose SmartSSO, a framework that automates the account linkage process by analyzing user routines and behavior during login processes. Our experiments on a large dataset show that SmartSSO achieves over 98% accuracy in hit-precision.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

A memetic algorithm with fuzzy-based population control for the joint order batching and picker routing problem

Renchao Wu, Jianjun He, Xin Li, Zuguo Chen

Summary: This paper proposes a memetic algorithm with fuzzy-based population control (MA-FPC) to solve the joint order batching and picker routing problem (JOBPRP). The algorithm incorporates batch exchange crossover and a two-level local improvement procedure. Experimental results show that MA-FPC outperforms existing algorithms in terms of solution quality.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

Refining one-class representation: A unified transformer for unsupervised time-series anomaly detection

Guoxiang Zhong, Fagui Liu, Jun Jiang, Bin Wang, C. L. Philip Chen

Summary: In this study, we propose the AMFormer framework to address the problem of mixed normal and anomaly samples in deep unsupervised time-series anomaly detection. By refining the one-class representation and introducing the masked operation mechanism and cost sensitive learning theory, our approach significantly improves anomaly detection performance.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

A data-driven optimisation method for a class of problems with redundant variables and indefinite objective functions

Jin Zhou, Kang Zhou, Gexiang Zhang, Ferrante Neri, Wangyang Shen, Weiping Jin

Summary: In this paper, the authors focus on the issue of multi-objective optimisation problems with redundant variables and indefinite objective functions (MOPRVIF) in practical problem-solving. They propose a dual data-driven method for solving this problem, which consists of eliminating redundant variables, constructing objective functions, selecting evolution operators, and using a multi-objective evolutionary algorithm. The experiments conducted on two different problem domains demonstrate the effectiveness, practicality, and scalability of the proposed method.

INFORMATION SCIENCES (2024)

Article Computer Science, Information Systems

A Monte Carlo fuzzy logistic regression framework against imbalance and separation

Georgios Charizanos, Haydar Demirhan, Duygu Icen

Summary: This article proposes a new fuzzy logistic regression framework that addresses the problems of separation and imbalance while maintaining the interpretability of classical logistic regression. By fuzzifying binary variables and classifying subjects based on a fuzzy threshold, the framework demonstrates superior performance on imbalanced datasets.

INFORMATION SCIENCES (2024)