Abstract
A new dynamic clustering method using multi-objective evolutionary algorithm is proposed. As opposed to the traditional static clustering algorithms, our method implements variable length chromosome which allows the algorithm to search for both optimal cluster center positions and cluster number. Thus the cluster number is optimized during run time dynamically instead of being pre-specified as a parameter. We also introduce two complementary objective functions–compactness and connectedness instead of one single objective. To optimize the two measures simultaneously, the NSGA-II, a highly efficient multi-objective evolutionary algorithm, is adapted for the clustering problem. The simultaneous optimization of these objectives improves the quality of the resulting clustering of problems with different data properties. At last, we apply our algorithm on several real data sets from the UCI machine learning repository and obtain good results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Law, M.H.C.: Multi-objective data clustering. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Washington, DC, pp. 424–430 (2004)
Ghozeil, A., Fogel, D.B.: Discovering patterns in spatial data using evolutionary programming. In: Proceedings of the first annual conference on Genetic Programming 1996, Cambridge, MA, pp. 512–520 (1996)
Gorunescu, R., Dumitrescu, D.: Evolutionary clustering using an incremental technique. Studia Univ. Babes-Bolyai, Informatica, vol. XLVIII (2003)
Deb, K.: Multi-objective evolutionary algorithms: Introducing bias among Pareto-optimal solutions, pp. 263–292. Springer, London (2003)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE transactions on evolutionary computation 6(2), 182–197 (2002)
Falkenauer, E.: Genetic Algorithms and Grouping Problems. John Wiley & Son Ltd., New York (1998)
Lee, C.-Y., Antonsson, E.K.: Variable length genomes for evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, Las Vegas, NV, p. 806. Morgan Kaufmann, San Francisco (2000)
Ding, C., He, X.: K-nearest-neighbor consistency in data clustering: incorporating local information into global optimization. In: Proceedings of the 2004 ACM Symposium on Applied Computing, New York, NY, pp. 584–589 (2004)
Schwefel, H.-P.: Evolution and optimum seeking. John Wiley, New York (1995)
Blake, C., Merz, C.: UCI repository of machine learning database. Technical report, Department of Information and Computer Science, University of California, Irvine (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
van Rijsbergen, C.: Information Retrieval, 2nd edn., Butterworths, London, UK (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, E., Wang, F. (2005). Dynamic Clustering Using Multi-objective Evolutionary Algorithm. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_10
Download citation
DOI: https://doi.org/10.1007/11596448_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30818-8
Online ISBN: 978-3-540-31599-5
eBook Packages: Computer ScienceComputer Science (R0)