Cluster evaluation divides the records into groups which can be meaningful and beneficial. It`s also used as a start line for different functions of information summarization. This paper speak some very fundamental algorithms like k-means, Fuzzy C-method, Hierarchical clustering to give you clusters, and use R information mining device. The outcomes are examined at the datasets specifically on-line news popularity, Cyber Crime information Set information evaluation. All datasets became analyzed with specific clustering algorithms and the figures we`re displaying the running of them in R information mining tool. Each set of rules has its specialty and antithetical conduct.

K-means algorithm, Fuzzy C-method algorithm, Hierarchical clustering algorithm, R tool

[1]. J. Han and M. Kamber, Data Mining: Concepts and Techniques, second ed. Morgan Kaufmann, 2006.
[2]. C.C. Aggarwal and P.S. Yu, “Finding Generalized Projected Clusters in High Dimensional Spaces,” Proc. 26th ACM SIGMOD Int‟l Conf. Management of Data, pp. 70-81, 2000.
[3]. K. Kailing, H.-P. Kriegel, P. Kro ¨ger, and S. Wanka, “Ranking Interesting Subspaces for Clustering High Dimensional Data,” Proc.Seventh European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD), pp. 241-252, 2003.
[4]. K. Kailing, H.-P. Kriegel, and P. Kro ¨ger, “Density-Connected Subspace Clustering for High- Dimensional Data,” Proc. Fourth SIAM Int‟l Conf. Data Mining (SDM), pp. 246-257, 2004.
[5]. E. Mu ¨ ller, S. Gu ¨nnemann, I. Assent, and T. Seidl, “Evaluating Clustering in Subspace Projections of High Dimensional Data,” Proc. VLDB Endowment, vol. 2, pp. 1270-1281, 2009.
[6]. E. Agirre, D. Martı´nez, O.L. de Lacalle, and A. Soroa, “Two Graph-Based Algorithms for State-of-the-Art WSD,”Proc. Conf.Empirical Methods in Natural Language Processing (EMNLP), pp. 585- 593, 2006.
[7]. K. Ning, H. Ng, S. Srihari, H. Leong, and A. Nesvizhskii, “Examination of the Relationship between Essential Genes in PPI Network and Hub Proteins in Reverse Nearest Neighbor Topology,” BMC Bioinformatics,vol. 11, pp. 1-14, 2010.
[8]. D. Arthur and S. Vassilvitskii, “K-Means++: The Advantages of Careful Seeding,”Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA),pp. 1027-1035, 2007.
[9]. I.S. Dhillon, Y. Guan, and B. Kulis, “Kernel k Means: Spectral Clustering and Normalized Cuts,”Proc. 10th ACM SIGKDD Int‟lConf. Knowledge Discovery and Data Mining,pp. 551- 556, 2004.
[10]. T.N. Tran, R. Wehrens, and L.M.C. Buydens, “Knn Density-Based Clustering for High Dimensional Multispectral Images,”Proc.Second GRSS/ISPRS Joint Workshop Remote Sensing and Data Fusion over Urban Areas,pp. 147-151, 2003.