Denser than the densest subgraph: Extracting optimal quasi-cliques with quality guarantees

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

Volumn Part F128815, Issue , 2013, Pages 104-112

  Tsourakakis, Charalampos E ^a   Bonchi, Francesco ^b   Gionis, Aristides ^c   Gullo, Francesco ^b   Tsiarli, Maria A ^d  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b YAHOO RESEARCH   (Spain)

^c AALTO UNIVERSITY   (Finland)

^d UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

Dense subgraph; Graph mining; Quasi clique

Indexed keywords

APPROXIMATION ALGORITHMS; DATA MINING; GRAPHIC METHODS; HEURISTIC ALGORITHMS; OPTIMIZATION;

APPLICATION STUDIES; DENSE SUBGRAPH; DENSEST SUBGRAPHS; DIRECT OPTIMIZATION; GRAPH MINING; LOCAL SEARCH HEURISTICS; QUASI-CLIQUE; SYNTHETIC DATASETS;

DENSITY FUNCTIONAL THEORY;

EID: 84970890840     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2487575.2487645     Document Type: Conference Paper

References (33)

1. J. Abello, M. G. C. Resende, and S. Sudarsky. Massive quasi-clique detection. In LATIN, 2002.
2. R. Andersen and K. Chellapilla. Finding dense subgraphs with size bounds. In WAW, 2009.
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. S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. In STOC, 1995.
5. Y. Asahiro, R. Hassin, and K. Iwama. Complexity of finding dense subgraphs. Discr. Ap. Math., 121(1-3), 2002.
6. Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama. Greedily finding a dense subgraph. J. Algorithms, 34(2), 2000.
7. C. Bron and J. Kerbosch. Algorithm 457: Finding all cliques of an undirected graph. CACM, 16(9), 1973.
8. M. Brunato, H. H. Hoos, and R. Battiti. On effectively finding maximal quasi-cliques in graphs. In Learning and Intelligent Optimization. 2008.
9. G. Buehrer and K. Chellapilla. A scalable pattern mining approach to web graph compression with communities. In WSDM, 2008.
10. M. Charikar. Greedy approximation algorithms for finding dense components in a graph. In APPROX, 2000.
11. F. R. K. Chung and L. Lu. The average distance in a random graph with given expected degrees. Internet Mathematics, 1(1), 2003.
12. X. Du, et al. Migration motif: A spatial -Temporal pattern mining approach for financial markets. In KDD, 2009.
13. U. Feige. Approximating maximum clique by removing subgraphs. SIAM Journal of Discrete Mathematics, 18(2), 2005.
14. U. Feige, G. Kortsarz, and D. Peleg. The dense k-subgraph problem. Algorithmica, 29(3), 2001.
15. U. Feige and M. Langberg. Approximation algorithms for maximization problems arising in graph partitioning. J. Algorithms, 41(2), 2001.
16. E. Fratkin, B. T. Naughton, D. L. Brutlag, and S. Batzoglou. MotifCut: Regulatory motifs finding with maximum density subgraphs. In ISMB, 2006.
17. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. A fast parametric maximum flow algorithm and applications. Journal of Computing, 18(1), 1989.
18. D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, 2005.
19. A. V. Goldberg. Finding a maximum density subgraph. Technical report, University of California at Berkeley, 1984.
20. J. Hastad. Clique is hard to approximate within n1-o. Acta Mathematica, 182(1), 1999.
21. R. Jin, Y. Xiang, N. Ruan, and D. Fuhry. 3-hop: A high-compression indexing scheme for reachability query. In SIGMOD, 2009.
22. S. Khot. Ruling out PTAS for graph min-bisection, dense k-subgraph, and bipartite clique. Journal of Computing, 36(4), 2006.
23. S. Khuller and B. Saha. On Finding Dense Subgraphs. ICALP, 2009.
24. M. N. Kolountzakis and et al.: Efficient triangle counting in large graphs via degree-based vertex partitioning. Internet Mathematics, 8(1-2), 2012.
25. 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. Methods of Microarray Data Analysis IV. 2005.
26. V. E. Lee, N. Ruan, R. Jin, and C. C. Aggarwal. A survey of algorithms for dense subgraph discovery. Managing and Mining Graph Data. 2010.
27. M. Newman. The structure and function of complex networks. SIAM review, 45(2):167-256, 2003.
28. A. Schrijver. Combinatorial Optimization : Polyhedra and Efficiency (Algorithms and Combinatorics). Springer, 2004.
29. T. Sorlie and et al. Repeated observation of breast tumor subtypes in independent gene expression data sets. PNAS, 100(14), 2003.
30. M. Sozio and A. Gionis. The community-search problem and how to plan a successful cocktail party. KDD, 2010.
31. T. Uno. An efficient algorithm for solving pseudo clique enumeration problem. Algorithmica, 56(1), 2010.
32. M. J. van de Vijver et al. A gene-expression signature as a predictor of survival in breast cancer. The New England journal of medicine, 347(25), 2002.
33. R. A. Weinberg. The Biology of Cancer HB. Garland Science, 2006.