A clustering algorithm using an evolutionary programming-based approach

被引：84

作者：

Sarkar, M ^{[1
]}

Yegnanarayana, B ^{[1
]}

Khemani, D ^{[1
]}

机构：

[1] Indian Inst Technol, Dept Comp Sci & Engn, Madras 600036, Tamil Nadu, India

来源：

PATTERN RECOGNITION LETTERS | 1997年 / 18卷 / 10期

关键词：

clustering; K-means; optimization; evolutionary programming;

D O I：

10.1016/S0167-8655(97)00122-0

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper, an evolutionary programming-based clustering algorithm is proposed. The algorithm effectively groups a given set of data into an optimum number of clusters. The proposed method is applicable for clustering tasks where clusters are crisp and spherical. This algorithm determines the number of clusters and the cluster centers in such a way that locally optimal solutions are avoided. The result of the algorithm does not depend critically on the choice of the initial cluster centers. (C) 1997 Published by Elsevier Science B.V.

引用

页码：975 / 986

页数：12

共 18 条

[11]

PAO YH, 1996, P IEEE INT C NEUR NE, P181

[12]

PORTO W, 1995, IEEE EXPERT, P16

[13] Hybrid methods using genetic algorithms for global optimization [J].

Renders, JM ;

Flasse, SP .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (02) :243-258

[14] EVOLVING NEURAL CONTROL-SYSTEMS [J].

SARAVANAN, N ;

FOGEL, DB .

IEEE EXPERT-INTELLIGENT SYSTEMS & THEIR APPLICATIONS, 1995, 10 (03) :23-27

[15] A SIMULATED ANNEALING ALGORITHM FOR THE CLUSTERING PROBLEM [J].

SELIM, SZ ;

ALSULTAN, K .

PATTERN RECOGNITION, 1991, 24 (10) :1003-1008

[16] ADAPTIVE PROBABILITIES OF CROSSOVER AND MUTATION IN GENETIC ALGORITHMS [J].

SRINIVAS, M ;

PATNAIK, LM .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1994, 24 (04) :656-667

[17]

Tou T., 1974, PATTERN RECOGN, DOI DOI 10.1002/ZAMM.19770570626

[18]

Yao X, 1993, Int J Neural Syst, V4, P203, DOI 10.1142/S0129065793000171

← 1 2 →