Finding subgraphs with maximum total density and limited overlap

WSDM 2015 - Proceedings of the 8th ACM International Conference on Web Search and Data Mining

Volumn , Issue , 2015, Pages 379-388

  Balalau, Oana Denisa ^a   Bonchi, Francesco ^b   Chany, T H Hubert ^c   Gullo, Francesco ^b   Sozioz, Mauro ^a  

^a INSTITUT MINES TELECOM   (France)

^b YAHOO RESEARCH   (United States)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS; SOCIAL NETWORKING (ONLINE);

DENSE SUB-GRAPHS; DENSEST SUBGRAPH PROBLEMS; EVENT DETECTION; JACCARD COEFFICIENTS; LARGE AMOUNTS; NATURAL GENERALIZATION; REAL-WORLD GRAPHS; TOTAL DENSITY;

DATA MINING;

EID: 84928713623     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2684822.2685298     Document Type: Conference Paper

References (25)

1. R. Andersen and K. Chellapilla. Finding dense subgraphs with size bounds. In WAW, 2009.
2. A. Angel, N. Sarkas, N. Koudas, and D. Srivastava. Dense subgraph maintenance under streaming edge weight updates for real-time story identification. PVLDB, 5(6), 2012.
3. A. Angel, N. Sarkas, N. Koudas, and D. Srivastava. Dense subgraph maintenance under streaming edge weight updates for real-time story identification. PVLDB, 5(6), 2012.
4. Y. Asahiro, R. Hassin, and K. Iwama. Complexity of finding dense subgraphs. Discr. Ap. Math., 121(1-3), 2002.
5. Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama. Greedily finding a dense subgraph. J. Algorithms, 34(2), 2000.
6. B. Bahmani, R. Kumar, and S. Vassilvitskii. Densest subgraph in streaming and mapreduce. PVLDB, 5(5), 2012.
7. A. Bhaskara, M. Charikar, E. Chlamtac, U. Feige, and A. Vijayaraghavan. Detecting high log-densities: an O (n 1/4) approximation for densest k -subgraph. In STOC, pages 201-210, 2010.
8. F. Bonchi, F. Gullo, A. Kaltenbrunner, and Y. Volkovich. Core decomposition of uncertain graphs. In KDD, 2014.
9. M. Charikar. Greedy approximation algorithms for finding dense components in a graph. In K. Jansen and S. Khuller, editors, APPROX. Springer, 2000.
10. J. Chen and Y. Saad. Dense subgraph extraction with application to community detection. TKDE, 24(7), 2012.
11. W. Cui, Y. Xiao, H. Wang, Y. Lu, and W. Wang. Online search of overlapping communities. In SIGMOD, 2013.
12. X. Du, R. Jin, L. Ding, V. E. Lee, and J. H. Thornton, Jr. Migration motif: a spatial - temporal pattern mining approach for financial markets. In KDD, 2009.
13. E. Fratkin, B. T. Naughton, D. L. Brutlag, and S. Batzoglou. MotifCut: regulatory motifs finding with maximum density subgraphs. In ISMB, 2006.
14. D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, 2005.
15. A. V. Goldberg. Finding a maximum density subgraph. Technical report, University of California at Berkeley, 1984.
16. S. Khot. Ruling out PTAS for graph min-bisection, dense k -subgraph, and bipartite clique. J. Computing, 36(4), 2006.
17. S. Khuller and B. Saha. On finding dense subgraphs. In ICALP, 2009.
18. M. A. Langston and et al. A combinatorial approach to the analysis of differential gene expression data: The use of graph algorithms for disease prediction and screening. In Methods of Microarray Data Analysis IV. 2005.
19. 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.
20. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. Comput. Syst. Sci., 43(3), 1991.
21. M. Sozio and A. Gionis. The community-search problem and how to plan a successful cocktail party. In KDD, pages 939-948, 2010.
22. N. Tatti and A. Gionis. Discovering nested communities. In ECML/PKDD (2), 2013.
23. C. Tsourakakis, F. Bonchi, A. Gionis, F. Gullo, and M. Tsiarli. Denser than the densest subgraph: Extracting optimal quasi-cliques with quality guarantees. In KDD, 2013.
24. E. Valari, M. Kontaki, and A. N. Papadopoulos. Discovery of top-k dense subgraphs in dynamic graph collections. In SSDBM, 2012.
25. N. Wang, J. Zhang, K.-L. Tan, and A. K. H. Tung. On triangulation-based dense neighborhood graph discovery. PVLDB, 4(2), 2010.