4.4 Article

Training feedforward neural networks with dynamic particle swarm optimisation

期刊

SWARM INTELLIGENCE
卷 6, 期 3, 页码 233-270

出版社

SPRINGER
DOI: 10.1007/s11721-012-0071-6

关键词

Swarm intelligence; Particle swarm optimisation; Neural networks; Dynamic environments; Classification; Concept drift

向作者/读者索取更多资源

Particle swarm optimisation has been successfully applied to train feedforward neural networks in static environments. Many real-world problems to which neural networks are applied are dynamic in the sense that the underlying data distribution changes over time. In the context of classification problems, this leads to concept drift where decision boundaries may change over time. This article investigates the applicability of dynamic particle swarm optimisation algorithms as neural network training algorithms under the presence of concept drift.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Nuclear Science & Technology

X-Ray and Neutron Radiography System Optimization by Means of a Multiobjective Approach and a Simplified Ray-Tracing Method

Robert Nshimirimana, Ajith Abraham, Gawie Nothnagel, Andries Engelbrecht

Summary: This paper describes a simplified approach to optimizing the radiography process using a virtual environment, utilizing ray tracing technique and particle swarm optimization routine to calculate and optimize the design parameters of the radiography system. The method provides a straightforward virtual environment for basic radiography training and experimental planning.

NUCLEAR TECHNOLOGY (2021)

Article Computer Science, Artificial Intelligence

The influence of fitness landscape characteristics on particle swarm optimisers

A. P. Engelbrecht, P. Bosman, K. M. Malan

Summary: This study explores the correlations between the characteristics of optimization problems and the behaviors of swarm-based algorithms, revealing links between specific problem features and algorithm behaviors. The research uses fitness landscapes characteristics and diversity rate-of-change to quantify the features of problems and algorithms.

NATURAL COMPUTING (2022)

Article Computer Science, Information Systems

Characterisation of environment type and difficulty for streamed data classification problems

Mathys Ellis, Anna S. Bosman, Andries P. Engelbrecht

Summary: The article discusses the challenges faced by streamed data classifiers and proposes methods for analyzing the environment and difficulty of SDCP.

INFORMATION SCIENCES (2021)

Article Computer Science, Artificial Intelligence

Multi-guide particle swarm optimisation archive management strategies for dynamic optimisation problems

Pawel Jocko, Beatrice M. Ombuki-Berman, Andries P. Engelbrecht

Summary: This study introduces archive management approaches for dynamic multi-objective optimisation problems using the multi-guide particle swarm optimisation (MGPSO) algorithm, which achieves efficient tracking of the changing Pareto-optimal front by proposing alternative archive update strategies.

SWARM INTELLIGENCE (2022)

Article Computer Science, Artificial Intelligence

Multi-Guide Set-Based Particle Swarm Optimization for Multi-Objective Portfolio Optimization

Kyle Erwin, Andries Engelbrecht

Summary: Portfolio optimization is a multi-objective optimization problem that involves balancing risk and profit. Single-objective optimization methods, such as set-based particle swarm optimization (SBPSO), have been proposed to address this problem. This paper introduces the first multi-objective approach to SBPSO and compares its performance with other multi-objective algorithms. The results show that SBPSO is competitive with multiple runs, and the proposed multi-objective SBPSO achieves a more diverse set of optimal solutions.

ALGORITHMS (2023)

Article Computer Science, Artificial Intelligence

Meta-heuristics for portfolio optimization

Kyle Erwin, Andries Engelbrecht

Summary: This paper provides a comprehensive review of over 140 papers that have applied evolutionary and swarm intelligence algorithms to the portfolio optimization problem. The papers are categorized based on the type of portfolio optimization problem considered and further classified into single-objective and multi-objective approaches. The various portfolio models used, as well as the constraints, objectives, and differences between them, are also discussed in detail. Based on the findings, guidance for future research in portfolio optimization is provided.

SOFT COMPUTING (2023)

Article Computer Science, Artificial Intelligence

The Porcupine Measure for Comparing the Performance of Multi-Objective Optimization Algorithms

Christiaan Scheepers, Andries Engelbrecht

Summary: This article investigates the shortcomings of Fonseca and Fleming's attainment surfaces and analyzes the quantitative measure based on attainment surfaces introduced by Knowles and Corne. The analysis reveals that the results of the Knowles and Corne approach are biased by the shape of the attainment surface. The article proposes improvements for bi-objective Pareto-optimal front (POF) comparisons and introduces a multi-objective optimization algorithm performance measure called the porcupine measure based on attainment surfaces. A computationally optimized version of the porcupine measure is presented and empirically analyzed.

ALGORITHMS (2023)

Proceedings Paper Computer Science, Artificial Intelligence

Cauchy Loss Function: Robustness Under Gaussian and Cauchy Noise

Thamsanqa Mlotshwa, Heinrich van Deventer, Anna Sergeevna Bosman

Summary: This paper examines the impact of loss function selection on the performance of artificial neural networks in supervised machine learning, comparing the Cauchy loss function to the mean squared error loss function on various regression problems.

ARTIFICIAL INTELLIGENCE RESEARCH, SACAIR 2022 (2022)

Proceedings Paper Computer Science, Artificial Intelligence

A Local Optima Network Analysis of the Feedforward Neural Architecture Space

Isak Potgieter, Christopher W. Cleghorn, Anna S. Bosman

Summary: This study investigates the use of local optima network (LON) analysis to characterise and visualise the neural architecture space. The results indicate that LONs may provide a viable paradigm for analysing and optimising neural architectures.

2022 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN) (2022)

Proceedings Paper Computer Science, Artificial Intelligence

Genetic Micro-Programs for Automated Software Testing with Large Path Coverage

Jarrod Goschen, Anna S. Bosman, Stefan Gruner

Summary: The ongoing progress in computational intelligence has increased the desire to apply CI techniques for improving software engineering processes, particularly software testing. Existing automated software testing techniques focus on using search algorithms to discover input values that achieve high execution path coverage. This paper introduces a novel genetic programming framework that evolves micro-programs to efficiently explore the input parameter domain of software components, rather than just focusing on input values.

2022 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) (2022)

Proceedings Paper Computer Science, Artificial Intelligence

Learning to Trade from Zero-Knowledge Using Particle Swarm Optimization

Stefan van Deventer, Andries Engelbrecht

Summary: A dynamic optimization method for training neural networks to predict trading behavior in the financial stock market is proposed and shown to significantly outperform static methods on a selection of South African stocks.

ADVANCES IN COMPUTATIONAL INTELLIGENCE (IWANN 2021), PT II (2021)

Proceedings Paper Computer Science, Artificial Intelligence

Impacted Tooth Detection in Panoramic Radiographs

James Faure, Andries Engelbrecht

Summary: This paper proposes an approach to automate diagnosis of impacted teeth by analysing panoramic radiographs and training a convolutional neural network. Empirical results illustrate good performance in predicting impacted teeth.

ADVANCES IN COMPUTATIONAL INTELLIGENCE, IWANN 2021, PT I (2021)

Article Computer Science, Artificial Intelligence

A Feature Selection Algorithm Performance Metric for Comparative Analysis

Werner Mostert, Katherine M. Malan, Andries P. Engelbrecht

Summary: This study introduces a novel performance metric BFI for feature selection algorithms, which can be used for comparative analysis. The research found performance complementarity among a suite of feature selection algorithms on various real world datasets.

ALGORITHMS (2021)

Article Computer Science, Artificial Intelligence

An Exploratory Landscape Analysis-Based Benchmark Suite

Ryan Dieter Lang, Andries Petrus Engelbrecht

Summary: This study introduces a method to determine the minimum sample size required for robust exploratory landscape analysis measures, and utilizes self-organizing feature map to cluster a comprehensive set of benchmark functions, proposing a benchmark suite with improved coverage in single-objective, boundary-constrained problem spaces.

ALGORITHMS (2021)

Article Computer Science, Artificial Intelligence

Diversity Measures for Niching Algorithms

Jonathan Mwaura, Andries P. Engelbrecht, Filipe V. Nepomuceno

Summary: This paper discusses the concepts of multimodal problems, multimodal optimisation, niche algorithms, and how diversity measures can be used to evaluate the distribution of candidate solutions and solutions of niching algorithms.

ALGORITHMS (2021)

暂无数据