Discovering highly reliable subgraphs in uncertain graphs

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2011, Pages 992-1000

  Jin, Ruoming ^a   Liu, Lin ^a   Aggarwal, Charu C ^b  

^a KENT STATE UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Frequent cohesive set; Reliable subgraph; Uncertain graph

Indexed keywords

FREQUENT COHESIVE SET; INDUCED SUBGRAPHS; NETWORK APPLICATIONS; PROTEIN COMPLEXES; RELIABLE SUBGRAPH; SOCIAL NETWORK ANALYSIS; SUBGRAPH PROBLEMS; SUBGRAPHS; UNCERTAIN GRAPHS; UNCERTAINTY;

EID: 80052650977     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020569     Document Type: Conference Paper

References (41)

1. E. Adar and C. Re. Managing uncertainty in social networks. IEEE Data Eng. Bull., 30(2):15-22, 2007.
2. C. C. Aggarwal, editor. Managing and Mining Uncertain Data. Advances in Database Systems. Springer, 2009.
3. S. Asthana, O. D. King, F. D. Gibbons, and F. P. Roth. Predicting protein complex membership using probabilistic network reliability. Genome Res, 14(6):1170-1175, June 2004. (Pubitemid 38811553)
4. J. S. Bader, A. Chaudhuri, J. M. Rothberg, and J. Chant. Gaining confidence in high-throughput protein interaction networks. Nature Biotechnology, 22(1):78-85, December 2003.
5. M. O. Ball. Computational complexity of network reliability analysis: An overview. IEEE Transactions on Reliability, 35:230-239, 1986.
6. Y. Benjamini and Y. Hochberg. Controlling the false discovery rate: A practical and powerful approach to multiple testing. Journal of the Royal Statistical Society. Series B (Methodological), 57(1):289-300, 1995.
7. Y. Benjamini and D. Yekutieli. The Control of the False Discovery Rate in Multiple Testing under Dependency. The Annals of Statistics, 29(4):1165-1188, 2001. (Pubitemid 33575263)
8. C. Chen, X. Yan, F. Zhu, and J. Han. gapprox: Mining frequent approximate patterns from a massive network. In ICDM, pages 445-450, 2007.
9. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics, 23(4):493-507, 1952.
10. C. J. Colbourn. The Combinatorics of Network Reliability. Oxford University Press, Inc., 1987.
11. J. Ghosh, H. Q. Ngo, S. Yoon, and C. Qiao. On a Routing Problem Within Probabilistic Graphs and its Application to Intermittently Connected Networks. In INFOCOM'07, pages 1721-1729, 2007. (Pubitemid 47334401)
12. R. Guha, R. Kumar, P. Raghavan, and A. Tomkins. Propagation of trust and distrust. In WWW'04, pages 403-412, 2004. (Pubitemid 40752775)
13. J. Han, H. Cheng, D. Xin, and X. Yan. Frequent Pattern Mining: Current Status and Future Directions. Data Mining and Knowledge Discovery, 14(1), 2007.
14. J. Han, M. Kamber, and J. Pei. Data Mining: Concepts and Techniques, Second Edition (The Morgan Kaufmann Series in Data Management Systems). Morgan Kaufmann, 2nd edition, 2006.
15. S. Hanhijärvi, K. Puolamäki, and G. C. Garriga. Multiple hypothesis testing in pattern discovery, 2009. arXiv:0906.5263v1 [stat.ML].
16. P. Hintsanen. The most reliable subgraph problem. In PKDD, pages 471-478, 2007.
17. P. Hintsanen and H. Toivonen. Finding reliable subgraphs from large probabilistic graphs. Data Min. Knowl. Discov., 17(1):3-23, 2008.
18. P. Hintsanen, H. Toivonen, and P. Sevon. Fast discovery of reliable subnetworks. In ASONAM, pages 104-111, 2010.
19. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
20. J. Hopcroft and R. Tarjan. Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM, 16:372-378, June 1973.
21. R. Jiang, Z. Tu, T. Chen, and F. Sun. Network motif identification in stochastic networks. PNAS, 103(25):9404-9409, June 2006. (Pubitemid 43955839)
22. R. Jin, L. Liu, B. Ding, and H. Wang. Distance-constraint reachability computation in uncertain graphs. In Proceedings of the VLDB Endowment, volume 4, 2011.
23. R. Jin, S. McCallen, and E. Almaas. Trend motif: A graph mining approach for analysis of dynamic complex networks. In ICDM, pages 541-546, 2007.
24. B. Karrer and M. E. J. Newman. Stochastic blockmodels and community structure in networks. Phys. Rev. E, 83(1):016107, Jan 2011.
25. M. Kasari, H. Toivonen, and P. Hintsanen. Fast discovery of reliable k-terminal subgraphs. In PAKDD (2), pages 168-177, 2010.
26. D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD, pages 137-146, 2003.
27. A. Kirsch, M. Mitzenmacher, A. Pietracaprina, G. Pucci, E. Upfal, and F. Vandin. An efficient rigorous approach for identifying statistically significant frequent itemsets. In PODS'09, pages 117-126, 2009.
28. V. E. Lee, N. Ruan, R. Jin, and C. Aggarwal. A survey of algorithms for dense subgraph discovery. In Charu C. Aggarwal and Haixun Wang, editors, Managing and Mining Graph Data, pages 303-336. Springer US, 2010.
29. V. Manfredi, R. Hancock, and J. Kurose. Robust routing in dynamic manets. In Annual Conference of the International Technology Alliance (ACITA), 2008.
30. M. Potamias, F. Bonchi, A. Gionis, and G. Kollios. k-nearest neighbors in uncertain graphs. PVLDB, 3(1):997-1008, 2010.
31. G. Rubino. Network reliability evaluation. In Network performance modeling and simulation, pages 275-302. 1999.
32. M. Stoer and F. Wagner. A simple min-cut algorithm. J. ACM, 44:585-591, July 1997. (Pubitemid 127617705)
33. G. Swamynathan, C. Wilson, B. Boe, K. Almeroth, and B. Y. Zhao. Do social networks improve e-commerce?: a study on social marketplaces. In WOSP'08: Proceedings of the first workshop on Online social networks, pages 1-6, 2008.
34. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, 1979.
35. D. R. White and F. Harary. The cohesiveness of blocks in social networks: Node connectivity and conditional density. Sociological Methodology, 31:305-359, 2001. (Pubitemid 33584802)
36. X. Yan, X. J. Zhou, and J. Han. Mining closed relational graphs with connectivity constraints. In KDD'05, 2005.
37. D. M. Yellin. An algorithm for dynamic subset and intersection testing. Theoretical Computer Science, 129(2):397-406, 1994.
38. Y. Yuan, L. Chen, and G. Wang. Efficiently answering probability threshold-based shortest path queries over uncertain graphs. In DASFAA, pages 155-170, 2010.
39. Z. Zou, H. Gao, and J. Li. Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In KDD, pages 633-642, 2010.
40. Z. Zou, J. Li, H. Gao, and S. Zhang. Finding top-k maximal cliques in an uncertain graph. In ICDE, pages 649-652, 2010.
41. Z. Zou, J. Li, H. Gao, and S. Zhang. Mining frequent subgraph patterns from uncertain graph data. IEEE Trans. on Knowl. and Data Eng., 22(9), 2010.