Continuous space pattern reduction for genetic clustering algorithm

Authors:
Chun-Wei Tsai;Tzu-Yuan Lin;Ming-Chao Chiang;Chu-Sing Yang;Tzung-Pei Hong
Affiliations:
Chia Nan University of Phamacy & Science, Tainan, Taiwan Roc;National Sun Yat-sen University, Kaohsiung, Taiwan Roc;National Sun Yat-sen University, Kaohsiung, Taiwan Roc;National Cheng Kung Univ, Tainan, Taiwan Roc;National University of Kaohsiung, Kaohsiung, Taiwan Roc
Venue:
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Year:
2012

Citing 5
Cited 0

An evolutionary technique based on K-means algorithm for optimal clustering in RN

Information Sciences—Applications: An International Journal
A framework for accelerating metaheuristics via pattern reduction

Proceedings of the 12th annual conference on Genetic and evolutionary computation
A time-efficient pattern reduction algorithm for k-means clustering

Information Sciences: an International Journal
Genetic K-means algorithm

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A fast exact GLA based on code vector activity detection

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have recently proposed a highly effective method for speeding up metaheuristics in solving combinatorial optimization problems called pattern reduction (PR). It is, however, limited to problems with solutions that are either binary or integer encoded. In this paper, we proposed a new pattern reduction algorithm named continuous space pattern reduction (CSPR) to overcome this limitation. Simulations show that the proposed algorithm can significantly reduce the computation time of k-means with genetic algorithm (KGA) for solving the data clustering problem using continuous encoding.