Sciweavers

Share
ICDM
2009
IEEE

Efficient Discovery of Frequent Correlated Subgraph Pairs

9 years 8 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining techniques, such as frequent subgraph mining and correlated subgraph mining, have been proposed. In many applications, both frequency and correlation play an important role. Thus, this paper studies a new problem of mining the set of frequent correlated subgraph pairs. A simple algorithm that combines existing algorithms for mining frequent subgraphs and correlated subgraphs results in a multiplication of the mining operations, the majority of which are redundant. We discover that most of the graphs correlated to a common graph are also highly correlated. We establish theoretical foundations for this finding and derive a tight lower bound on the correlation of any two graphs that are correlated to a common graph. This theoretical result leads to the design of a very effective skipping mechanism, by which we s...
Yiping Ke, James Cheng, Jeffrey Xu Yu
Added 18 Feb 2011
Updated 18 Feb 2011
Type Journal
Year 2009
Where ICDM
Authors Yiping Ke, James Cheng, Jeffrey Xu Yu
Comments (0)
books