期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：11
出版社：S.S. Mishra
摘要：Data Mining, the ex traction of hidden predictive information from large databases, is a powerful new technology with great potential to help companies focus on the most important information in their data warehouses. Data Mining is a field of search and researches of data. Mining the data means fetching out a piece of data from a huge data block. The basic work in the data mining can be categorized in two subsequent ways. One is called classification and the other is called clustering. In the presented research work, our aim is to find out an algorithm which is better as comparison with another algorithm by analyzing their performance.There are various algorithm of clustering from which we take main algorithm is k – mean with the combination of c – mean algorithm. There is a problem with k – mean that it does not show membership function with the clusters but in this paper we implement that by using c-mea n algorithm with k –mean we get a graph which represent membership function between clusters
