2009
DOI: 10.1109/tsmcb.2008.2011816
|View full text |Cite
|
Sign up to set email alerts
|

AMPSO: A New Particle Swarm Method for Nearest Neighborhood Classification

Abstract: Abstract-Nearest prototype methods can be quite successful on many pattern classification problems. In these methods, a collection of prototypes has to be found that accurately represents the input patterns. The classifier then assigns classes based on the nearest prototype in this collection. In this paper, we first use the standard particle swarm optimizer (PSO) algorithm to find those prototypes. Second, we present a new algorithm, called adaptive Michigan PSO (AMPSO) in order to reduce the dimension of the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
44
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 99 publications
(45 citation statements)
references
References 24 publications
1
44
0
Order By: Relevance
“…The numbers of research papers and results of experiments show the PSO is competitive to the standard classification algorithms[9]- [14].…”
Section: Pso For Classificationmentioning
confidence: 99%
“…The numbers of research papers and results of experiments show the PSO is competitive to the standard classification algorithms[9]- [14].…”
Section: Pso For Classificationmentioning
confidence: 99%
“…Among the studies that have approached the PG problem, those based on bioinspired optimization have gained popularity in recent years [1][2][3][4]6,[8][9][10]. These generally seek at optimizing a criterion related to the classification performance of the generated prototypes.…”
Section: Introductionmentioning
confidence: 99%
“…Evolutionary algorithms (EAs) [34] have been successfully used in different data mining problems [35,36]. Given that PS and PG problems could be seen as combinatorial and optimization problems, EAs have been used to solve them with excellent results [37][38][39][40]. PS can be expressed as a binary space search problem and, as far as we know, the best evolutionary model proposed for PS is based on memetic algorithms [41] and is called SSMA [38].…”
Section: Introductionmentioning
confidence: 99%
“…In fact, PSO has been satisfactorily used for prototype adjustment [39,40]. The first attempts at using DE for PG can be found in [48].…”
Section: Introductionmentioning
confidence: 99%