Comparative study of a genetic fuzzy c-means algorithm and a validity guided fuzzy c-means algorithm for locating clusters in noisy data

被引：10

作者：

Egan, MA ^{[1
]}

Krishnamoorthy, M ^{[1
]}

Rajan, K ^{[1
]}

机构：

[1] Siena Coll, Dept Comp Sci, Loudonville, NY 12211 USA

来源：

1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS | 1998年

关键词：

D O I：

10.1109/ICEC.1998.699836

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The partitioning of data into clusters is an important problem with many applications. Typically, one locates partitions using an iterative fuzzy c-means algorithm of one form or another. Unfortunately, the results of these techniques depend on the cluster center initialization because their search is based on hill climbing methods. Recently, there has been much investigation into the use of genetic algorithms to partition data into fuzzy clusters. Genetic algorithms are less sensitive to initial conditions due to the stochastic nature of their search. In this paper we compare the two techniques when locating fuzzy clusters embedded in noisy data and discuss the advantages and disadvantages of both methods.

引用

页码：440 / 445

页数：6