IDEAS home Printed from https://ideas.repec.org/a/igg/jaec00/v5y2014i2p58-71.html
   My bibliography  Save this article

A PSO Based Incremental Hyper-Sphere Partitioning Approach to Classification

Author

Listed:
  • 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)

  • Jinghao Song

    (Department of Computer Science and Software Engineering, Liverpool University, Jiangsu, China)

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.

Suggested Citation

  • Binge Zheng & Sheng-Uei Guan & Jinghao Song, 2014. "A PSO Based Incremental Hyper-Sphere Partitioning Approach to Classification," International Journal of Applied Evolutionary Computation (IJAEC), IGI Global, vol. 5(2), pages 58-71, April.
    • Handle: RePEc:igg:jaec00:v:5:y:2014:i:2:p:58-71
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijaec.2014040104
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jaec00:v:5:y:2014:i:2:p:58-71. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.