Performance analysis for clustering algorithms
by Yu Xue; Binping Zhao; Tinghuai Ma
International Journal of Computing Science and Mathematics (IJCSM), Vol. 7, No. 5, 2016

Abstract: There are lots of algorithms for optimal clustering. The main part of clustering algorithms includes the K-means, fuzzy c-means (FCM) and evolution algorithm. The main purpose of this paper was to research the performance and characteristics of these three types of algorithms. One criteria (clustering validity index), namely TRW, was used in the optimisation of classification and eight real-world datasets (glass, wine, ionosphere, biodegradation, connectionist bench, hill-valley, musk, madelon datasets), whose dimension became higher, were applied. We made a performance analysis and concluded that it was easy of the K-means and FCM to fall into a local minimum, and the hybrid algorithm was found more reliable and more efficient, especially on difficult tasks with high dimension.

Online publication date: Tue, 01-Nov-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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