Welcome to the InfoSci Platform
Reference Hub1
A PSO Based Incremental Hyper-Sphere Partitioning Approach to Classification

A PSO Based Incremental Hyper-Sphere Partitioning Approach to Classification

Binge Zheng, Sheng-Uei Guan, Jinghao Song
Copyright: © 2014 |Volume: 5 |Issue: 2 |Pages: 14
ISSN: 1942-3594|EISSN: 1942-3608|EISBN13: 9781466652408|DOI: 10.4018/ijaec.2014040104
Cite Article Cite Article

MLA

Zheng, Binge, et al. "A PSO Based Incremental Hyper-Sphere Partitioning Approach to Classification." IJAEC vol.5, no.2 2014: pp.58-71. http://doi.org/10.4018/ijaec.2014040104

APA

Zheng, B., Guan, S., & Song, J. (2014). A PSO Based Incremental Hyper-Sphere Partitioning Approach to Classification. International Journal of Applied Evolutionary Computation (IJAEC), 5(2), 58-71. http://doi.org/10.4018/ijaec.2014040104

Chicago

Zheng, Binge, Sheng-Uei Guan, and Jinghao Song. "A PSO Based Incremental Hyper-Sphere Partitioning Approach to Classification," International Journal of Applied Evolutionary Computation (IJAEC) 5, no.2: 58-71. http://doi.org/10.4018/ijaec.2014040104

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.