skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Frequent Subgraph Discovery in Large Attributed Streaming Graphs

Abstract

The problem of finding frequent subgraphs in large dynamic graphs has so far only consid- ered a dynamic graph as being represented by a series of static snapshots taken at various points in time. This representation of a dynamic graph does not lend itself well to real time processing of real world graphs like social networks or internet traffic which consist of a stream of nodes and edges. In this paper we propose an algorithm that discovers the frequent subgraphs present in a graph represented by a stream of labeled nodes and edges. Our algorithm is efficient and consists of tunable parameters that can be tuned by the user to get interesting patterns from various kinds of graph data. In our model updates to the graph arrive in the form of batches which contain new nodes and edges. Our algorithm con- tinuously reports the frequent subgraphs that are estimated to be found in the entire graph as each batch arrives. We evaluate our system using 5 large dynamic graph datasets: the Hetrec 2011 challenge data, Twitter, DBLP and two synthetic. We evaluate our approach against two popular large graph miners, i.e., SUBDUE and GERM. Our experimental re- sults show thatmore » we can find the same frequent subgraphs as a non-incremental approach applied to snapshot graphs, and in less time.« less

Authors:
; ;
Publication Date:
Research Org.:
Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1178517
Report Number(s):
PNNL-SA-103377
400470000
DOE Contract Number:
AC05-76RL01830
Resource Type:
Conference
Resource Relation:
Conference: Proceedings of the 3rd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications (BIGMINE 2014), August 24, 2014, 36:166-181
Country of Publication:
United States
Language:
English
Subject:
Dynamic graph, Frequent subgraph mining, pattern discovery

Citation Formats

Ray, Abhik, Holder, Larry, and Choudhury, Sutanay. Frequent Subgraph Discovery in Large Attributed Streaming Graphs. United States: N. p., 2014. Web.
Ray, Abhik, Holder, Larry, & Choudhury, Sutanay. Frequent Subgraph Discovery in Large Attributed Streaming Graphs. United States.
Ray, Abhik, Holder, Larry, and Choudhury, Sutanay. Wed . "Frequent Subgraph Discovery in Large Attributed Streaming Graphs". United States. doi:.
@article{osti_1178517,
title = {Frequent Subgraph Discovery in Large Attributed Streaming Graphs},
author = {Ray, Abhik and Holder, Larry and Choudhury, Sutanay},
abstractNote = {The problem of finding frequent subgraphs in large dynamic graphs has so far only consid- ered a dynamic graph as being represented by a series of static snapshots taken at various points in time. This representation of a dynamic graph does not lend itself well to real time processing of real world graphs like social networks or internet traffic which consist of a stream of nodes and edges. In this paper we propose an algorithm that discovers the frequent subgraphs present in a graph represented by a stream of labeled nodes and edges. Our algorithm is efficient and consists of tunable parameters that can be tuned by the user to get interesting patterns from various kinds of graph data. In our model updates to the graph arrive in the form of batches which contain new nodes and edges. Our algorithm con- tinuously reports the frequent subgraphs that are estimated to be found in the entire graph as each batch arrives. We evaluate our system using 5 large dynamic graph datasets: the Hetrec 2011 challenge data, Twitter, DBLP and two synthetic. We evaluate our approach against two popular large graph miners, i.e., SUBDUE and GERM. Our experimental re- sults show that we can find the same frequent subgraphs as a non-incremental approach applied to snapshot graphs, and in less time.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Wed Aug 13 00:00:00 EDT 2014},
month = {Wed Aug 13 00:00:00 EDT 2014}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: