Core decomposition of uncertain graphs

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

Volumn , Issue , 2014, Pages 1316-1325

  Bonchi, Francesco ^a   Gullo, Francesco ^a   Kaltenbrunner, Andreas ^b   Volkovich, Yana ^b  

^a YAHOO RESEARCH   (United States)

^b Barcelona Media Innovation Center   (Spain)

Author keywords

core decomposition; dense subgraph; uncertain graphs

Indexed keywords

EID: 84907033605     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2623330.2623655     Document Type: Conference Paper

References (34)

1. E. Adar and C. Re. Managing Uncertainty in Social Networks. IEEE Data Eng. Bull., 30(2):15-22, 2007.
2. J. I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, and A. Vespignani. Large scale networks fingerprinting and visualization using the k-core decomposition. In NIPS, 2005.
3. R. Andersen and K. Chellapilla. Finding dense subgraphs with size bounds. In WAW, 2009.
4. S. Asthana, O. D. King, F. D. Gibbons, and F. P. Roth. Predicting Protein Complex Membership using Probabilistic Network Reliability. Genome Res., 14:1170-1175, 2004.
5. V. Batagelj and M. Zaveršnik. Fast algorithms for determining (generalized) core groups in social networks. Advances in Data Analysis and Classification, 5(2):129-145, 2011.
6. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. JMLR, 3:993-1022, 2003.
7. P. Boldi, F. Bonchi, A. Gionis, and T. Tassa. Injecting Uncertainty in Graphs for Identity Obfuscation. PVLDB, 5(11):1376-1387, 2012.
8. X. H. Chen, A. P. Dempster, and J. S. Liu. Weighted finite population sampling to maximize entropy. Biometrika, 81:457-469, 1994.
9. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In VLDB, pages 864-875, 2004.
10. D. Eppstein, M. Löffler, and D. Strash. Listing all maximal cliques in sparse graphs in near-optimal time. In ISAAC, 2010.
11. A. Goyal, F. Bonchi, and L. V. Lakshmanan. Learning influence probabilities in social networks. In WSDM, 2010.
12. A. Goyal, W. Lu, and L. V. Lakshmanan. Celf++: optimizing the greedy algorithm for influence maximization in social networks. In WWW, pages 47-48, 2011.
13. J. Healy, J. Janssen, E. E. Milios, and W. Aiello. Characterization of graphs using degree cores. In WAW, 2006.
14. R. Jin, L. Liu, and C. C. Aggarwal. Discovering Highly Reliable Subgraphs in Uncertain Graphs. In KDD, 2011.
15. R. Jin, L. Liu, B. Ding, and H. Wang. Distance-Constraint Reachability Computation in Uncertain Graphs. PVLDB, 4(9):551-562, 2011.
16. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In KDD, 2003.
17. M. Kitsak, L. K. Gallos, S. Havlin, F. Liljeros, L. Muchnik, H. E. Stanley, and H. A. Makse. Identifying influential spreaders in complex networks. Nature Physics 6, 888, 2010.
18. G. Kollios, M. Potamias, and E. Terzi. Clustering large probabilistic graphs. TKDE, 25(2):325-336, 2013.
19. G. Kortsarz and D. Peleg. Generating sparse 2-spanners. J. Algorithms, 17(2):222-236, 1994.
20. D. L.-Nowell and J. Kleinberg. The Link Prediction Problem for Social Networks. In CIKM, 2003.
21. V. E. Lee, N. Ruan, R. Jin, and C. C. Aggarwal. A survey of algorithms for dense subgraph discovery. In Managing and Mining Graph Data. 2010.
22. L. Liu, R. Jin, C. Aggrawal, and Y. Shen. Reliable clustering on uncertain graphs. In ICDM, 2012.
23. K. Pearson. Tables of the Incomplete Beta-Function. Cambridge University Press, 1968.
24. M. Potamias, F. Bonchi, A. Gionis, and G. Kollios. k-Nearest Neighbors in Uncertain Graphs. PVLDB, 3(1):997-1008, 2010.
25. S. B. Seidman. Network structure and minimum degree. Social Networks, 5(3):269-287, 1983.
26. P. Sevon, L. Eronen, P. Hintsanen, K. Kulovesi, and H. Toivonen. Link Discovery in Graphs Derived from Biological Databases. In DILS, 2006.
27. M. Sozio and A. Gionis. The community-search problem and how to plan a successful cocktail party. In KDD, 2010.
28. L. G. Valiant. The Complexity of Enumeration and Reliability Problems. SIAM J. on Computing, 8(3):410-421, 1979.
29. E. W. Weisstein. Binomial distribution. From MathWorld - A Wolfram Web Resource. Last visited on 16/5/2013, http://mathworld.wolfram.com/ BinomialDistribution.html.
30. S. Wuchty and E. Almaas. Peeling the yeast protein network. Proteomics, 5(2):444-449, Feb. 2005.
31. Y. Yuan, G. Wang, L. Chen, and H. Wang. Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases. PVLDB, 5(9):800-811, 2012.
32. H. Zhang, H. Zhao, W. Cai, J. Liu, and W. Zhou. Using the k-core decomposition to analyze the static structure of large-scale software systems. The Journal of Supercomputing, 53(2):352-369, 2010.
33. L. Zou, P. Peng, and D. Zhao. Top-K Possible Shortest Path Query over a Large Uncertain Graph. In WISE, 2011.
34. Z. Zou, H. Gao, and J. Li. Discovering Frequent Subgraphs over Uncertain Graph Databases under Probabilistic Semantics. In KDD, 2010.