Discovery of Top-k Dense Subgraphs in Dynamic Graph Collections
Dense subgraph discovery is a key issue in graph mining, due to its importance in several applications, such as correlation analysis, community discovery in the Web, gene co-expression and protein-protein interactions in bioinformatics. In this work, we study the discovery of the top-k dense subgraphs in a set of graphs. After the investigation of the problem in its static case, we extend the methodology to work with dynamic graph collections, where the graph collection changes over time. Our methodology is based on lower and upper bounds of the density, resulting in a reduction of the number of exact density computations. Our algorithms do not rely on user-defined threshold values and the only input required is the number of dense subgraphs in the result (k). In addition to the exact algorithms, an approximation algorithm is provided for top-k dense subgraph discovery, which trades result accuracy for speed. We show that a significant number of exact density computations is avoided, resulting in efficient monitoring of the top-k dense subgraphs.
KeywordsPriority Queue Graph Object Expiration Time Dense Subgraph Active Graph
Unable to display preview. Download preview PDF.
- 1.Aggarwal, C., Wang, H.: Managing and mining graph data. Springer (2010)Google Scholar
- 2.Aggarwal, C., Li, Y., Yu, P.S., Jin, R.: On dense pattern mining in graph streams. In: Proceedings of the 36th VLDB Conference, pp. 975–984 (2010)Google Scholar
- 3.Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. CoRR, cs.DS/0310049 (2003)Google Scholar
- 5.Cook, D.J., Holder, L.B. (eds.): Mining graph data. Wiley (2007)Google Scholar
- 6.Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: Proceedings of the 31st VLDB Conference, pp. 721–732 (2005)Google Scholar
- 7.Goldberg, A.V.: Finding a maximum density subgraph. Technical Report CSD-84-171, University of Berkeley (1984)Google Scholar
- 11.Mouratidis, K., Bakiras, S., Papadias, D.: Continuous monitoring of top-k queries over sliding windows. In: Proceedings of the ACM SIGMOD Conference, pp. 635–646 (2006)Google Scholar
- 15.Sun, J., Faloutsos, C., Papadimitriou, S., Yu, P.S.: GraphScope: parameter-free mining of large time-evolving graphs. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 687–696 (2007)Google Scholar