e-ISSN:0976-5166
p-ISSN:2231-3850


INDIAN JOURNAL OF COMPUTER SCIENCE AND ENGINEERING

Call for Papers 2020

Jun 2020 - Volume 11, Issue 3
Deadline: 15 May 2020
Due to COVID-19 deadline extended to 31-May-2020
Notification: 15 Jun 2020
Publication: 30 Jun 2020

Aug 2020 - Volume 11, Issue 4
Deadline: 15 Jul 2020
Notification: 15 Aug 2020
Publication: 31 Aug 2020

More

Indexed in

IJCSE Indexed in Scopus

ABSTRACT

Title : COMPARATIVE INVESTIGATIONS AND PERFORMANCE ANALYSIS OF FCM AND MFPCM ALGORITHMS ON IRIS DATA
Authors : Vuda Sreenivasa Rao, Dr. S Vidyavathi
Keywords : Data clustering Algorithm, Portioning, Data Mining, Fuzzy C Mean, Modified Fuzzy Possibililstic C mean.
Issue Date : August 2010
Abstract :
Data mining technology has emerged as a means for identifying patterns and trends from large quantities of data. Data mining is a computational intelligence discipline that contributes tools for data analysis, discovery of new knowledge, and autonomous decision making. Clustering is a primary data description method in data mining which groupís most similar data. The data clustering is an important problem in a wide variety of fields. Including data mining, pattern recognition, and bioinformatics. It aims to organize a collection of data items into clusters, such that items within a cluster are more similar to each other than they are items in the other clusters. There are various algorithms used to solve this problem In this paper, we use FCM (Fuzzy C -mean) clustering algorithm and MFPCM (Modified Fuzzy Possibilistic C - mean) clustering algorithm. In this paper we compare the performance analysis of Fuzzy C mean (FCM) clustering algorithm and compare it with Modified Fuzzy possibilistic C mean algorithm. In this we compared FCM and MFPCM algorithm on different data sets. We measure complexity of FCM and MFPCM at different data sets. FCM clustering is a clustering technique which is separated from Modified Fuzzy Possibililstic C mean that employs Possibililstic partitioning.
Page(s) : 145-151
ISSN : 0976-5166
Source : Vol. 1, No.2