Comparison of swarm intelligence algorithms for high dimensional optimization problems

High dimensional optimization considers being one of the most challenges that face the algorithms for finding an optimal solution for real-world problems. These problems have been appeared in diverse practical fields including business and industries. Within a huge number of algorithms, selecting one algorithm among others for solving the high dimensional optimization problem is not an easily accomplished task. This paper presents a comprehensive study of two swarm intelligence based algorithms: 1- particle swarm optimization (PSO), 2-cuckoo search (CS).The two algorithms are analyzed and compared for problems consisting of high dimensions in respect of solution accuracy, and runtime performance by various classes of benchmark functions

An Improved particle swarm optimization based on lévy flight and simulated annealing for high dimensional optimization problem

Particle swarm optimization (PSO) is a simple metaheuristic method to implement with robust performance. PSO is regarded as one of the numerous researchers' most well-studied algorithms. However, two of its most fundamental problems remain unresolved. PSO converges onto the local optimum for high-dimensional optimization problems, and it has slow convergence speeds. This paper introduces a new variant of a particle swarm optimization algorithm utilizing Lévy flight-McCulloch, and fast simulated annealing (PSOLFS). The proposed algorithm uses two strategies to address high-dimensional problems: hybrid PSO to define the global search area and fast simulated annealing to refine the visited search region. In this paper, PSOLFS is designed based on a balance between exploration and exploitation. We evaluated the algorithm on 16 benchmark functions for 500 and 1,000 dimension experiments. On 500 dimensions, the algorithm obtains the optimal value on 14 out of 16 functions. On 1,000 dimensions, the algorithm obtains the optimal value on eight benchmark functions and is close to optimal on four others. We also compared PSOLFS with another five PSO variants regarding convergence accuracy and speed. The results demonstrated higher accuracy and faster convergence speed than other PSO variants. Moreover, the results of the Wilcoxon test show a significant difference between PSOLFS and the other PSO variants. Our experiments' findings show that the proposed method enhances the standard PSO by avoiding the local optimum and improving the convergence speed

A particle swarm optimization levy flight algorithm for imputation of missing creatinine dataset

Clinicians could intervene during what may be a crucial stage for preventing permanent kidney injury if patients with incipient Acute Kidney Injury (AKI) and those at high risk of developing AKI could be identified. This paper proposes an improved mechanism to machine learning imputation algorithms by introducing the Particle Swarm Levy Flight algorithm. We improve the algorithms by modifying the Particle Swarm Optimization Algorithm (PSO), by enhancing the algorithm with levy flight (PSOLF). The creatinine dataset that we collected, including AKI diagnosis and staging, mortality at hospital discharge, and renal recovery, are tested and compared with other machine learning algorithms such as Genetic Algorithm and traditional PSO. The proposed algorithms' performances are validated with a statistical significance test. The results show that SVMPSOLF has better performance than the other method. This research could be useful as an important tool of prognostic capabilities for determining which patients are likely to suffer from AKI, potentially allowing clinicians to intervene before kidney damage manifests

Analyzing and visualizing Thoracic Surgery Data Set

Recently, the need for machine learning for prediction process is increasing. Creating model for a high number of variables could produce overfitting which affects the accuracy of prediction. For that, this paper focus on analyzing the data before creating models using various statistical test between variables

Improved particle swarm optimization by fast annealing algorithm

This paper proposes a hybrid particle swarm optimization with the fast-simulated annealing (PSO-FSA). The proposed algorithm is meant to solve high dimensional optimization problems based on two strategies, which are utilizing the particle swarm optimization to define the global search area and utilizing the fast-simulated annealing to refine the visited search area. To evaluate its performance, we examined the algorithm on 14 benchmark functions. Based on the results, PSO-FSA has higher accuracy result compared with particle swarm, simulated annealing. We also apply the algorithm in clustering problem, and the results shows that the proposed method has better accuracy than the optimization methods

A data-centric review of deep transfer learning with applications to text data

In recent years, many applications are using various forms of deep learning models. Such methods are usually based on traditional learning paradigms requiring the consistency of properties among the feature spaces of the training and test data and also the availability of large amounts of training data, e.g., for performing supervised learning tasks. However, many real-world data do not adhere to such assumptions. In such situations transfer learning can provide feasible solutions, e.g., by simultaneously learning from data-rich source data and data-sparse target data to transfer information for learning a target task. In this paper, we survey deep transfer learning models with a focus on applications to text data. First, we review the terminology used in the literature and introduce a new nomenclature allowing the unequivocal description of a transfer learning model. Second, we introduce a visual taxonomy of deep learning approaches that provides a systematic structure to the many diverse models introduced until now. Furthermore, we provide comprehensive information about text data that have been used for studying such models because only by the application of methods to data, performance measures can be estimated and models assessed.publishedVersionPeer reviewe