A PSO Based Incremental Hyper-Sphere Partitioning Approach to Classification

A PSO Based Incremental Hyper-Sphere Partitioning Approach to Classification

Binge Zheng (Department of Computer Science and Software Engineering, Liverpool University, Jiangsu, China), Sheng-Uei Guan (Department of Computer Science and Software Engineering, Xian Jiaotong-Liverpool University, Jiangsu, China) and Jinghao Song (Department of Computer Science and Software Engineering, Liverpool University, Jiangsu, China)
Copyright: © 2014 |Pages: 14
DOI: 10.4018/ijaec.2014040104
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

This paper proposes an incremental hyper-sphere partitioning approach for classification problems. Hyper-spheres that are close to the classification boundaries of a given problem are searched using an incremental approach based upon Particle Swarm Optimization (PSO). This new algorithm is proposed to tackle the difficulty of classification problems caused by the complex pattern relationship with a simplified expert rule structure. We solve classification problems through a combination of hyper-sphere partitioning and a Euclidean-distance based partitioning approach. Moreover, an incremental approach combined with output partitioning and pattern reduction is applied to cope with the curse of dimensionality. The algorithm is tested with seven datasets. The experimental results show that this proposed algorithm outperforms ILEGA (our former research work) and normal GA significantly in the final classification accuracy. In terms of the time complexity, it also gains significant improvement in comparison with ILEGA.
Article Preview

Particle Swarm Optimization

This section gives a brief introduction to the original PSO.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 8: 4 Issues (2017): 3 Released, 1 Forthcoming
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing