Harmony Search PSO Clustering for Tumor and Cancer Gene Expression Dataset

2014 ◽  
Vol 5 (3) ◽  
pp. 1-21 ◽  
Author(s):  
P. K. Nizar Banu ◽  
S. Andrews
Keyword(s):  
Gene Expression ◽  
Particle Swarm Optimization ◽  
Clustering Algorithm ◽  
Expression Patterns ◽  
Harmony Search ◽  
Particle Swarm ◽  
Solution Space ◽  
Disease Diagnosis ◽  
Cancer Gene ◽  
Swarm Optimization

Enormous quantity of gene expression data from diverse data sources are accumulated due to the modern advancement in microarray technology that leads to major computational challenges. The foremost step towards addressing this challenge is to cluster genes which reveal hidden gene expression patterns and natural structures to find the interesting patterns from the underlying data that in turn helps in disease diagnosis and drug development. Particle Swarm Optimization (PSO) technique is extensively used for many practical applications but fails in finding the initial seeds to generate clusters and thus reduces the clustering accuracy. One of the meta-heuristic optimization algorithms called Harmony Search is free from divergence and helps to find out the near-global optimal solutions by searching the entire solution space. This paper proposes a novel Harmony Search Particle Swarm Optimization (HSPSO) clustering algorithm and is applied for Brain Tumor, Colon Cancer, Leukemia Cancer and Lung Cancer gene expression datasets for clustering. Experimental results show that the proposed algorithm produces clusters with better compactness and accuracy, in comparison with K-means clustering, PSO clustering (swarm clustering) and Fuzzy PSO clustering.

Fuzzy Clustering Algorithm Based on Improved Particle Swarm Optimization and its Application

2010 ◽  
Vol 44-47 ◽  
pp. 4067-4071 ◽  
Author(s):  
Xue Yong Li ◽  
Jia Xia Sun ◽  
Jun Hui Fu ◽  
Guo Hong Gao
Keyword(s):  
Particle Swarm Optimization ◽  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
Dimensional Space ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Solution Space ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization ◽  
Fuzzy Clustering Algorithm

A fuzzy clustering algorithm based on improved particle swarm optimization was proposed in this paper. First reduce dimension of solution space, separate it into smaller solution space. In separated solution space, use of improved particle swarm optimization algorithm to search the sub-optimal solution as a chromosome of whole particle,use improved PSO to search global optimal solution. The particle solve the problem that swarm algorithm easy to fall into local optimal solution in high dimensional space, and the problem that the fuzzy clustering algorithm is sensitive to initial value problems. Simulation results show the effectiveness of this algorithm.

scholarly journals Directionally-Enhanced Binary Multi-Objective Particle Swarm Optimisation for Load Balancing in Software Defined Networks

Sensors ◽  
2021 ◽  
Vol 21 (10) ◽  
pp. 3356
Author(s):  
Mustafa Hasan Albowarab ◽  
Nurul Azma Zakaria ◽  
Zaheera Zainal Abidin
Keyword(s):  
Particle Swarm Optimization ◽  
Load Balancing ◽  
Mathematical Formulation ◽  
Particle Swarm ◽  
Solution Space ◽  
Particle Swarm Optimisation ◽  
Swarm Optimization ◽  
Multi Objective ◽  
Crowding Distance ◽  
Standard Models

Various aspects of task execution load balancing of Internet of Things (IoTs) networks can be optimised using intelligent algorithms provided by software-defined networking (SDN). These load balancing aspects include makespan, energy consumption, and execution cost. While past studies have evaluated load balancing from one or two aspects, none has explored the possibility of simultaneously optimising all aspects, namely, reliability, energy, cost, and execution time. For the purposes of load balancing, implementing multi-objective optimisation (MOO) based on meta-heuristic searching algorithms requires assurances that the solution space will be thoroughly explored. Optimising load balancing provides not only decision makers with optimised solutions but a rich set of candidate solutions to choose from. Therefore, the purposes of this study were (1) to propose a joint mathematical formulation to solve load balancing challenges in cloud computing and (2) to propose two multi-objective particle swarm optimisation (MP) models; distance angle multi-objective particle swarm optimization (DAMP) and angle multi-objective particle swarm optimization (AMP). Unlike existing models that only use crowding distance as a criterion for solution selection, our MP models probabilistically combine both crowding distance and crowding angle. More specifically, we only selected solutions that had more than a 0.5 probability of higher crowding distance and higher angular distribution. In addition, binary variants of the approaches were generated based on transfer function, and they were denoted by binary DAMP (BDAMP) and binary AMP (BAMP). After using MOO mathematical functions to compare our models, BDAMP and BAMP, with state of the standard models, BMP, BDMP and BPSO, they were tested using the proposed load balancing model. Both tests proved that our DAMP and AMP models were far superior to the state of the art standard models, MP, crowding distance multi-objective particle swarm optimisation (DMP), and PSO. Therefore, this study enables the incorporation of meta-heuristic in the management layer of cloud networks.

Particle Swarm Optimization Algorithms Inspired by Immunity-Clonal Mechanism and Their Applications to Spam Detection

2012 ◽  
pp. 182-205 ◽  
Author(s):  
Ying Tan
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithms ◽  
Particle Swarm ◽  
Solution Space ◽  
Pso Algorithm ◽  
Spam Detection ◽  
Swarm Optimization ◽  
Hole Model ◽  
Successive Generations ◽  
Benchmark Test Functions

Compared to conventional PSO algorithm, particle swarm optimization algorithms inspired by immunity-clonal strategies are presented for their rapid convergence, easy implementation and ability of optimization. A novel PSO algorithm, clonal particle swarm optimization (CPSO) algorithm, is proposed based on clonal principle in natural immune system. By cloning the best individual of successive generations, the CPSO enlarges the area near the promising candidate solution and accelerates the evolution of the swarm, leading to better optimization capability and faster convergence performance than conventional PSO. As a variant, an advance-and-retreat strategy is incorporated to find the nearby minima in an enlarged solution space for greatly accelerating the CPSO before the next clonal operation. A black hole model is also established for easy implementation and good performance. Detailed descriptions of the CPSO algorithm and its variants are elaborated. Extensive experiments on 15 benchmark test functions demonstrate that the proposed CPSO algorithms speedup the evolution procedure and improve the global optimization performance. Finally, an application of the proposed PSO algorithms to spam detection is provided in comparison with the other three methods.

Sign in / Sign up

Export Citation Format

Share Document