Combinatorial particle swarm optimization (CPSO) for partitional clustering problem


This paper presents a new clustering approach based on the combinatorial particle swarm optimization (CPSO) algorithm. Each particle is represented as a string of length n (where n is the number of data points) the ith element of the string denotes the group number assigned to object i. An integer vector corresponds to a candidate solution to the clustering… (More)
DOI: 10.1016/j.amc.2007.03.010


5 Figures and Tables


Citations per Year

70 Citations

Semantic Scholar estimates that this publication has 70 citations based on the available data.

See our FAQ for additional information.