Multi-criterion Pareto based particle swarm optimized polynomial neural network for classification: A review and state-of-the-art

S. Dehuri, S. B. Cho

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

In this paper, we proposed a multi-objective Pareto based particle swarm optimization (MOPPSO) to minimize the architectural complexity and maximize the classification accuracy of a polynomial neural network (PNN). To support this, we provide an extensive review of the literature on multi-objective particle swarm optimization and PNN. Classification using PNN can be considered as a multi-objective problem rather than as a single objective one. Measures like classification accuracy and architectural complexity used for evaluating PNN based classification can be thought of as two different conflicting criterions. Using these two metrics as the criteria of classification problem, the proposed MOPPSO technique attempts to find out a set of non-dominated solutions with less complex PNN architecture and high classification accuracy. An extensive experimental study has been carried out to compare the importance and effectiveness of the proposed method with the chosen state-of-the-art multi-objective particle swarm optimization (MOPSO) algorithm using several benchmark datasets. A comprehensive bibliography is included for further enhancement of this area.

Original languageEnglish
Pages (from-to)19-40
Number of pages22
JournalComputer Science Review
Volume3
Issue number1
DOIs
Publication statusPublished - 2009 Feb 1

Fingerprint

Particle Swarm
Multi-criteria
Pareto
Polynomials
Neural Networks
Neural networks
Particle swarm optimization (PSO)
Polynomial
Particle Swarm Optimization
Multi-objective Optimization
Complex Polynomials
Nondominated Solutions
Network Architecture
Particle Swarm Optimization Algorithm
Classification Problems
Optimization Techniques
Bibliographies
Experimental Study
Network architecture
Enhancement

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{8c26b9587844457688c8c6108669e77e,
title = "Multi-criterion Pareto based particle swarm optimized polynomial neural network for classification: A review and state-of-the-art",
abstract = "In this paper, we proposed a multi-objective Pareto based particle swarm optimization (MOPPSO) to minimize the architectural complexity and maximize the classification accuracy of a polynomial neural network (PNN). To support this, we provide an extensive review of the literature on multi-objective particle swarm optimization and PNN. Classification using PNN can be considered as a multi-objective problem rather than as a single objective one. Measures like classification accuracy and architectural complexity used for evaluating PNN based classification can be thought of as two different conflicting criterions. Using these two metrics as the criteria of classification problem, the proposed MOPPSO technique attempts to find out a set of non-dominated solutions with less complex PNN architecture and high classification accuracy. An extensive experimental study has been carried out to compare the importance and effectiveness of the proposed method with the chosen state-of-the-art multi-objective particle swarm optimization (MOPSO) algorithm using several benchmark datasets. A comprehensive bibliography is included for further enhancement of this area.",
author = "S. Dehuri and Cho, {S. B.}",
year = "2009",
month = "2",
day = "1",
doi = "10.1016/j.cosrev.2008.11.002",
language = "English",
volume = "3",
pages = "19--40",
journal = "Computer Science Review",
issn = "1574-0137",
publisher = "Elsevier Ireland Ltd",
number = "1",

}

TY - JOUR

T1 - Multi-criterion Pareto based particle swarm optimized polynomial neural network for classification

T2 - A review and state-of-the-art

AU - Dehuri, S.

AU - Cho, S. B.

PY - 2009/2/1

Y1 - 2009/2/1

N2 - In this paper, we proposed a multi-objective Pareto based particle swarm optimization (MOPPSO) to minimize the architectural complexity and maximize the classification accuracy of a polynomial neural network (PNN). To support this, we provide an extensive review of the literature on multi-objective particle swarm optimization and PNN. Classification using PNN can be considered as a multi-objective problem rather than as a single objective one. Measures like classification accuracy and architectural complexity used for evaluating PNN based classification can be thought of as two different conflicting criterions. Using these two metrics as the criteria of classification problem, the proposed MOPPSO technique attempts to find out a set of non-dominated solutions with less complex PNN architecture and high classification accuracy. An extensive experimental study has been carried out to compare the importance and effectiveness of the proposed method with the chosen state-of-the-art multi-objective particle swarm optimization (MOPSO) algorithm using several benchmark datasets. A comprehensive bibliography is included for further enhancement of this area.

AB - In this paper, we proposed a multi-objective Pareto based particle swarm optimization (MOPPSO) to minimize the architectural complexity and maximize the classification accuracy of a polynomial neural network (PNN). To support this, we provide an extensive review of the literature on multi-objective particle swarm optimization and PNN. Classification using PNN can be considered as a multi-objective problem rather than as a single objective one. Measures like classification accuracy and architectural complexity used for evaluating PNN based classification can be thought of as two different conflicting criterions. Using these two metrics as the criteria of classification problem, the proposed MOPPSO technique attempts to find out a set of non-dominated solutions with less complex PNN architecture and high classification accuracy. An extensive experimental study has been carried out to compare the importance and effectiveness of the proposed method with the chosen state-of-the-art multi-objective particle swarm optimization (MOPSO) algorithm using several benchmark datasets. A comprehensive bibliography is included for further enhancement of this area.

UR - http://www.scopus.com/inward/record.url?scp=60449120121&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=60449120121&partnerID=8YFLogxK

U2 - 10.1016/j.cosrev.2008.11.002

DO - 10.1016/j.cosrev.2008.11.002

M3 - Article

AN - SCOPUS:60449120121

VL - 3

SP - 19

EP - 40

JO - Computer Science Review

JF - Computer Science Review

SN - 1574-0137

IS - 1

ER -