Discovery of top-k dense subgraphs in dynamic graph collections

Authors:
Elena Valari;Maria Kontaki;Apostolos N. Papadopoulos
Affiliations:
Data Engineering Lab., Department of Informatics, Aristotle University, Thessaloniki, Greece;Data Engineering Lab., Department of Informatics, Aristotle University, Thessaloniki, Greece;Data Engineering Lab., Department of Informatics, Aristotle University, Thessaloniki, Greece
Venue:
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Year:
2012

Citing 15
Cited 0

Size and connectivity of the k-core of a random graph

Discrete Mathematics
Generating sparse 2-spanners

Journal of Algorithms
Finding a Maximum Density Subgraph

Finding a Maximum Density Subgraph
Mining Graph Data

Mining Graph Data
Progressive skyline computation in database systems

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Discovering large dense subgraphs in massive graphs

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Mining coherent dense subgraphs across massive biological networks for functional discovery

Bioinformatics
Maintaining Sliding Window Skylines on Data Streams

IEEE Transactions on Knowledge and Data Engineering
Continuous monitoring of top-k queries over sliding windows

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
GraphScope: parameter-free mining of large time-evolving graphs

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Managing and Mining Graph Data

Managing and Mining Graph Data
Continuous Subgraph Pattern Search over Certain and Uncertain Graph Streams

IEEE Transactions on Knowledge and Data Engineering
On dense pattern mining in graph streams

Proceedings of the VLDB Endowment
Efficient and simple generation of random simple connected graphs with prescribed degree sequence

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Dense subgraphs with restrictions and applications to gene annotation graphs

RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.