Non-euclidean genetic FCM clustering algorithm

Authors:
Sergio López García;Luis Magdalena;Juan R. Velasco
Affiliations:
Lince Telecomunicaciones S.A. C/ Ortega y Gasset, 100. 28006 Madrid;ETSI Telecomunicación, UPM. Ciudad Universitaria s/n. 28080 Madrid;ETSI Telecomunicación, UPM. Ciudad Universitaria s/n. 28080 Madrid
Venue:
Technologies for constructing intelligent systems
Year:
2002

Citing 5
Cited 1

Unsupervised Optimal Fuzzy Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Validity Measure for Fuzzy Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fuzzy sets and fuzzy logic: theory and applications

Fuzzy sets and fuzzy logic: theory and applications
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
On cluster validity for the fuzzy c-means model

IEEE Transactions on Fuzzy Systems

Short communication: Psychology with soft computing: An integrated approach and its applications

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The standard FCM clustering algorithm is a powerful mathematical tool widely used in many practical problems. Nevertheless, it is dependent on initial conditions and either the number of clusters and the distance definition must be predefined. In [15,11] the authors presented the Genetic FCM clustering, that improves the first and second drawbacks, but not the third one. This article shows how the definition of the distance can be included in the genetic structure. Several results applied to the Iris data set are also shown.