Dense subgraph maintenance under streaming edge weight updates for realtime story identification

Proceedings of the VLDB Endowment

Volumn 5, Issue 6, 2012, Pages 574-585

  Angel, Albert ^a   Koudas, Nick ^a   Sarkas, Nikos ^a   Srivastava, Divesh ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOGS;

DENSE SUB-GRAPHS; DENSE SUBGRAPH; EXPERIMENTAL EVALUATION; NOVEL ALGORITHM; REAL-WORLD ENTITIES; SYNTHETIC DATASETS; TIGHTLY-COUPLED; USER-GENERATED CONTENT;

MAINTENANCE;

EID: 84863730251     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2168651.2168658     Document Type: Article

References (30)

1. J. Abello, M. G. C. Resende, and S. Sudarsky. Massive quasi-clique detection. In LATIN, pages 598-612, 2002.
2. A. Angel and N. Koudas. Efficient diversity-aware search. In SIGMOD, pages 781-792, 2011.
3. A. Angel, N. Koudas, N. Sarkas, and D. Srivastava.What's on the grapevine? In SIGMOD, pages 1047-1050, 2009.
4. A. Angel, N. Koudas, N. Sarkas, and D. Srivastava. Dense subgraph maintenance under streaming edge weight updates for real-time story identification. Tr, 2011. Available at http://tinyurl.com/dyndens.
5. N. Bansal, F. Chiang, N. Koudas, and F. W. Tompa. Seeking stable clusters in the blogosphere. In VLDB, pages 806-817, 2007.
6. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In SODA, pages 623-632, 2002.
7. D. Chakrabarti, R. Kumar, and A. Tomkins. Evolutionary clustering. In KDD, pages 554-560, 2006.
8. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. In STOC, pages 626-635, 1997.
9. C. Cortes, D. Pregibon, and C. Volinsky. Computational methods for dynamic graphs. JCGS, 12(4):950-970, 2003.
10. D. Eppstein, Z. Galil, and G. F. Italiano. Dynamic graph algorithms. In Algorithms and Theory of Computation Handbook, chapter 8. 1999.
11. M. Ester, H.-P. Kriegel, J. Sander, M. Wimmer, and X. Xu. Incremental clustering for mining in a data warehousing environment. In VLDB, pages 323-333, 1998.
12. G. W. Flake, S. Lawrence, and C. L. Giles. Efficient identification of web communities. In KDD, pages 150-160, 2000.
13. D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, pages 721-732, 2005.
14. A. Goldberg. Finding a maximum density subgraph. Technical report, University of California at Berkeley, 1984.
15. S. Guha, A. Meyerson, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams: Theory and practice. TKDE, 15(3):515-528, 2003.
16. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD, pages 1-12, 2000.
17. J. Hartline and A. Sharp. An incremental model for combinatorial maximization problems. In WEA, pages 36-48, 2006.
18. J. Hartline and A. Sharp. Incremental flow. Networks, 50(1):77-85, 2007.
19. S. Hill, D. K. Agarwal, R. Bell, and C. Volinsky. Building an effective representation for dynamic networks. Journal of Computational and Graphical Statistics, 15(3):584-608, 2006.
20. S. Khuller and B. Saha. On finding dense subgraphs. In ICALP, pages 597-608, 2009.
21. M.-S. Kim and J. Han. Chronicle: A two-stage density-based clustering algorithm for dynamic networks. In Discovery Science, pages 152-167, 2009.
22. S. Kumar and P. Gupta. An incremental algorithm for the maximum flow problem. JMMA, 2(1):1-16, 2003.
23. J. Long and C. Hartman. ODES: an overlapping dense sub-graph algorithm. Bioinformatics, 26(21):2788-2789, 2010.
24. M. Mathioudakis and N. Koudas. Twittermonitor: trend detection over the twitter stream. In SIGMOD, pages 1155-1158, 2010.
25. P. M. Pardalos and J. Xue. The maximum clique problem. Journal of Global Optimization, 4(3):301-328, 1994.
26. N. Sarkas, A. Angel, N. Koudas, and D. Srivastava. Efficient identification of coupled entities in document collections. In ICDE, pages 769-772, 2010.
27. V. Stix. Finding all maximal cliques in dynamic graphs. Computational Optimization and Applications, 27(2):173-186, 2004.
28. T. Uno. An efficient algorithm for solving pseudo clique enumeration problem. Algorithmica, 56(1):3-16, 2010.
29. N. Wang, S. Parthasarathy, K.-L. Tan, and A. K. H. Tung. Csv: visualizing and mining cohesive subgraphs. In SIGMOD, pages 445-458, 2008.
30. D. Yang, E. A. Rundensteiner, and M. O. Ward. Neighbor-based pattern detection for windows over streaming data. In EDBT, pages 529-540, 2009.