An optimal rough fuzzy clustering algorithm using particle swarm optimisation Online publication date: Sun, 27-Dec-2015
by J. Anuradha; B.K. Tripathy
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 7, No. 4, 2015
Abstract: Rough fuzzy hybrid models are widely used for handling uncertain and vague data and are very efficient in handling real life applications. Particle swarm optimisation (PSO) has been found to be a useful tool to optimise and find the best out of a set of solutions. In this paper, we propose a computational algorithm by embedding PSO in rough fuzzy hybrid clustering, which forms overlapping clusters with optimised partition. The proposed algorithm uses rough fuzzy C-means to formulate fuzzy lower and fuzzy boundary region of the clusters based on membership of objects with respect to their prototypes. This method has been applied to a swarm of clusters to get the best partitions at local and global levels qualified by Davies Bouldin (DB) and Dunn (D) indexes as fitness measures. This algorithm generates clusters dynamically and its superiority over other existing clustering techniques is established experimentally by taking several real world datasets.
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 International Journal of Data Mining, Modelling and Management (IJDMMM):
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook