Recently, probabilistic graph have more interest in the data mining. After some result it is found that correlations may exist among adjacent edges in various probabilistic graphs. As one of the basic mining techniques, graph clustering is widely used. Different Clustering methods are used. But, when correlations are considered, it becomes more challenging to efficiently cluster probabilistic graphs. Here, we define the problem of clustering correlated probabilistic graphs and its techniques. To solve the challenging problem the PEEDR and the DPTC clustering algorithm are defined for each of the proposed algorithms, with some several pruning techniques and Different Similarity measures.

Clustering; Correlated; Probabilistic Graph; Graph Clustering; Pruning

[1] “Graph Clustering” Satu Elisa Schaeffer_C Computer Science Review 2007 .
[2] A.K. JAIN, M.N. MURTY, P.J. FLYNN, “Data Clustering: A Review "
[3] C. C. Aggarwal and H. Wang, “Managing and Mining Graph Data”, New York, NY, USA: Springer, 2010.
[4] Ye Yuan, Guoren Wang, Lei Chen, Haixun Wang,"Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases"
[5] Wang, W. and Demsetz" Model for Evaluating Networks under Correlated Uncertainty",—NETCOR.” J. Constr. Eng. Manage., 126(6), 458–466.
[6] U. Brandes, M. Gaertler, and D. Wagner, “Engineering Graph Clustering: Models and Experimental Evaluation,” ACM J. Experimental Algorithmics, vol. 12, article 1.1, pp. 1-26, 2007.
[7] G. Karypis and V. Kumar, “Parallel Multilevel K-Way Partitioning for Irregular Graphs,” SIAM Rev., vol. 41, pp. 278-300, 1999.
[8] M. Newman, “Modularity and Community Structure in Networks,” Proc. Nat’l Academy of Sciences USA, vol. 103, pp. 8577-8582, 2006.
[9] Y. Yorozu, M. Hirano, K. Oka, and Y. Tagawa, “Electron spectroscopy studies on magneto-optical media and plastic substrate interface,” IEEE Transl. J. Magn. Japan, vol. 2, pp. 740-741, August 1987 [Digests 9th Annual Conf. Magnetics Japan, p. 301, 1982].
[10] C.C. Aggarwal and P.S. Yu, “A Framework for Clustering Uncertain Data Streams,” Proc. IEEE 24th Int’l Conf. Data Eng.(ICDE), pp. 150-159, 2008
[11] G. Cormode and A. McGregor, “Approximation Algorithms for Clustering Uncertain Data,” Proc. 27th ACM SIGMOD-SIGACTSIGART Symp.Principles of Database Systems (PODS), pp. 191-200, 2008.
[12] S. Gu¨nnemann, H. Kremer, and T. Seidl, “Subspace Clustering for Uncertain Data,” Proc. SIAM Int’l Conf. Data Mining (SDM),pp. 385-396, 2010
[13] S. Guha and K. Munagala, “Exceeding Expectations and Clustering Uncertain Data,” Proc. 28th ACM SIGMOD-SIGACT-SIGARTSymp. Principles of Database Systems (PODS), pp. 269-278, 2009.
[14] Yu Gu,Chunpeng Gao, Gao Cong, and Ge Yu, "Effective and Efficicient Clustering Methods for correlated probabulistic graph" IEEE Transactions On Knowledge And Data Engineering, Vol. 26, No. 5, May 2014.