Speedup for a periodic subgraph miner

Authors:
Alberto Apostolico;Manuel Barbares;Cinzia Pizzi
Affiliations:
College of Computing, Georgia Institute of Technology, Atlanta, USA and Dipartimento di Ingegneria dellInformazione, Universití di Padova, Padova, Italy;Dipartimento di Ingegneria dellInformazione, Universití di Padova, Padova, Italy;Dipartimento di Ingegneria dellInformazione, Universití di Padova, Padova, Italy
Venue:
Information Processing Letters
Year:
2011

Citing 4
Cited 1

Graphs over time: densification laws, shrinking diameters and possible explanations

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Frequent pattern mining: current status and future directions

Data Mining and Knowledge Discovery
Mining Periodic Behavior in Dynamic Social Networks

ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Periodic subgraph mining in dynamic networks

Knowledge and Information Systems

Efficient algorithms for the periodic subgraphs mining problem

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

Given a series G={G"0,G"1,...,G"T} of graphs encompassing V vertices and E edges, a periodic graph is a spatially as well as temporally maximal subgraph of a subsequence of G in the form G"i^p={G"i,G"i"+"p,...,G"i"+"n"p}, where n is not smaller than some predetermined threshold value @s. An algorithm for finding all such subgraphs is proposed taking time O((E+V)T^2ln(T/@s)), which is faster by a factor of T than the method previously available.