A hybrid algorithm for fuzzy clustering Online publication date: Wed, 10-Sep-2014
by Z.H. Che
European J. of Industrial Engineering (EJIE), Vol. 6, No. 1, 2012
Abstract: The fuzzy C-means (FCM) algorithm is a commonly used fuzzy clustering method which conducts data clustering by randomly selecting initial centroids. With larger data size or attribute dimensions, clustering results may be affected and more repetitive computations are required. To compensate the effect of random initial centroids on results, this study proposed a hybrid algorithm immune genetic annealing fuzzy C-means algorithm (IGAFA). This algorithm obtains the proper initial cluster centroids to improve clustering efficiency and then tests them through three data sets: Hamberman's survival, iris, and liver disorders, and compares the results with the executed results of genetic fuzzy C-means algorithm (GFA), immune fuzzy C-means algorithm (IFA), and annealing fuzzy C-means algorithm (AFA). The results suggest that IGAFA could achieve better clustering results. [Received: November 18, 2009; Accepted: July 19, 2010]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com