Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Korkmaz, Emin Erkana | Du, Junb | Alhajj, Redab; c; * | Barker, Kenb
Affiliations: [a] Department of Computer Engineering, Yeditepe University, Kadikoy, Istanbul, Turkey. E-mail: ekorkmaz@cse.yeditepe.edu.tr | [b] Department of Computer Science, University of Calgary, Calgary, Alberta, Canada. E-mail: jundu@cpsc.ucalgary.ca, alhajj@cpsc.ucalgary.ca, barker@cpsc.ucalgary.ca | [c] Department of Computer Science, Global University, Beirut, Lebanon
Correspondence: [*] Corresponding author. Tel.: +1 403 210 9453; Fax: +1 403 284 4707; E-mail: alhajj@cpsc.ucalgary.ca.
Abstract: Various methods have been proposed to utilize Genetic Algorithms (GA) in handling the clustering problem. GA work on encoded strings, namely chromosomes, and the representation of different clusters as a linear structure is an important issue about the usage of GA in this domain. In this paper, we present a novel encoding scheme that uses links to identify clusters in a partition. Particularly, we restrict the links so that objects to be clustered form a linear pseudo-graph. A one-to-one mapping is thus achieved between the genotype and phenotype spaces. The other feature of the proposed approach is the use of multiple objectives in the process. One of the two objectives we use is to minimize the Total Within Cluster Variation (TWCV), identical to the one used by other k-means clustering approaches. However, unlike other k-means methods, number of clusters is not required specified in advance. Combined with a second objective, minimizing the number of clusters in a partition, our approach obtains the optimal partitions for all the possible numbers of clusters in the Pareto Optimal set returned by a single GA run. The performance of the proposed approach has been tested using two well-known data sets, namely Iris Data and Ruspini Data. The obtained results are compared with the output of the classical Group Number Encoding and it has been observed that a clear improvement has been achieved with the new representation.
Keywords: Clustering, genetic algorithms, linkage-encoding, k-means, multi-objective
DOI: 10.3233/IDA-2006-10205
Journal: Intelligent Data Analysis, vol. 10, no. 2, pp. 163-182, 2006
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl