Clustering is a familiar concept in the realm of Data mining and has wide applications in areas like image processing, pattern recognition and rule generation. Uncertainty in present day databases is a common feature. In order to handle these datasets, several clustering algorithms have been formulated in the literature. The first one being the Fuzzy C-Means (FCM) algorithm and it was followed by the Rough C-Means (RCM) by Lingras. In the paper Lingras has refined his previous algorithm. We combine this algorithm with the fuzzy C-means algorithm to generate a rough fuzzy C-Means (RFCM) algorithm in this paper. Also, we provide a comparative analysis with earlier RFCM algorithm introduced by Mitra et al and establish that our algorithm performs better. We use both numeric as well as image datasets as input and use the performance indices DB and D for this purpose. © 2014 IEEE.

Balakrushna Tripathy

Department of Analytics

School of Computer Science and Engineering

Vellore Campus

Sobti S

Shah V

Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

A refined rough fuzzy clustering algorithm

2014 IEEE International Conference on Computational Intelligence and Computing Research

Purpose: The purpose of this paper is to provide a way to analyze satellite images using various clustering algorithms and refined bitplane methods with other supporting techniques to prove the superiority of RIFCM. Design/methodology/approach: A comparative study has been carried out using RIFCM with other related algorithms from their suitability in analysis of satellite images with other supporting techniques which segments the images for further process for the benefit of societal problems. Four images were selected dealing with hills, freshwater, freshwatervally and drought satellite images. Findings: The superiority of the proposed algorithm, RIFCM with refined bitplane towards other clustering techniques with other supporting methods clustering, has been found and as such the comparison, has been made by applying four metrics (Otsu (Max-Min), PSNR and RMSE (40%-60%-Min-Max), histogram analysis (Max-Max), DB index and D index (Max-Min)) and proved that the RIFCM algorithm with refined bitplane yielded robust results with efficient performance, reduction in the metrics and time complexity of depth computation of satellite images for further process of an image. Practical implications: For better clustering of satellite images like lands, hills, freshwater, freshwatervalley, drought, etc. of satellite images is an achievement. Originality/value: The existing system extends the novel framework to provide a more explicit way to analyze an image by removing distortions with refined bitplane slicing using the proposed algorithm of rough intuitionistic fuzzy c-means to show the superiority of RIFCM. © Emerald Group Publishing Limited.

Kybernetes

A comparative study of RIFCM with other related algorithms from their suitability in analysis of satellite images using other supporting techniques

Clustering of real life data for analysis has gained popularity and imprecise methods or their hybrid approaches has attracted many researchers of late. Recently, rough intuitionistic fuzzy c-means algorithm was introduced and studied by Tripathy et al [3] and it was found to be superior to all other algorithms in this family. Kernel based counter part of these algorithms have been found to behave better than their corresponding Euclidean distance based algorithms. Very recently kernel based rough fuzzy algorithm was put forth by Bhargav et al [4]. A comparative analysis over standard datasets and images has established the superiority of this algorithm over its corresponding standard algorithm. In this paper we introduce the kernel based rough intuitionistic fuzzy c-means algorithm and show that it is superior to all the algorithms in the sequel; i.e. both normal and the kernel based algorithms. We establish it through experimental analysis by taking different type of inputs and using standard accuracy measures. © Springer International Publishing Switzerland 2014.

Smart Innovation, Systems and Technologies Advanced Computing, Networking and Informatics- Volume 1

On Kernel Based Rough Intuitionistic Fuzzy C-means Algorithm and a Comparative Analysis

Data clustering algorithms are used in many fields like anonymisation of databases, image processing, analysis of satellite images and medical data analysis. There are several C-Means clustering algorithms in the literature. Besides the hard C-Means, there are uncertainty based C-Means algorithms like the Fuzzy C-Means algorithm and its variants, the Rough C-Means algorithm, the Intuitionistic Fuzzy C- Means algorithm and the hybrid C-Means algorithms (Rough Fuzzy C-Means algorithm). In this paper we propose a new hybrid clustering algorithm called Rough Intuitionistic Fuzzy C-Means and evaluate its performance in comparison to the other algorithms mentioned above. We have applied these algorithms on numerical as well as image data of two different types and used some benchmarking indexes for the evaluation of their performance. The results show that the proposed algorithm outperforms the existing algorithms in almost all cases. © 2013 ACM.

Journal	Data powered by Typeset2014 IEEE International Conference on Computational Intelligence and Computing Research
Publisher	Data powered by TypesetIEEE
Open Access	0