Finding Frequent Patterns in a Large Sparse Graph
Abstract
This paper presents two algorithms based on the horizontal and vertical pattern discovery paradigms that find the connected subgraphs that have a sufficient number of edge disjoint embeddings in a single large undirected labeled sparse graph. These algorithms use three different methods to determine the number of the edge-disjoint embeddings of a subgraph that are based on approximate and exact maximum independent set computations and use it to prune infrequent subgraphs. Experimental evaluation on real datasets from various domains show that both algorithms achieve good performance, scale well to sparse input graphs with more than 100,000 vertices and around 200,000 edges, and significantly outperform previously developed algorithms.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 25, 2003
- Accession Number
- ADA438928
Entities
People
- George Karypis
- Michihiro Kuramochi
Organizations
- University of Minnesota