Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

6-2013

Abstract

Despite the wealth of research on frequent graph pattern mining, how to efficiently mine the complete set of those with constraints still poses a huge challenge to the existing algorithms mainly due to the inherent bottleneck in the mining paradigm. In essence, mining requests with explicitly-specified constraints cannot be handled in a way that is direct and precise. In this paper, we propose a direct mining framework to solve the problem and illustrate our ideas in the context of a particular type of constrained frequent patterns — the “skinny” patterns, which are graph patterns with a long backbone from which short twigs branch out. These patterns, which we formally define as l-long d-skinny patterns, are able to reveal insightful spatial and temporal trajectory patterns in mobile data mining, information diffusion, adoption propagation, and many others. Based on the key concept of a canonical diameter, we develop SkinnyMine, an efficient algorithm to mine all the l-long d-skinny patterns guaranteeing both the completeness of our mining result as well as the unique generation of each target pattern. We also present a general direct mining framework together with two properties of reducibility and continuity for qualified constraints. Our experiments on both synthetic and real data demonstrate the effectiveness and scalability of our approach.

Keywords

Direct mining, frequent graph pattern mining, constrained patternmining, skinny pattern

Discipline

Databases and Information Systems | Numerical Analysis and Scientific Computing

Publication

SIGMOD '13 Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data

First Page

821

Last Page

832

ISBN

9781450320375

Identifier

10.1145/2463676.2463723

Publisher

ACM

City or Country

New York City, NY, USA

Copyright Owner and License

LARC

Additional URL

http://dx.doi.org/10.1145/2463676.2463723

Download

Share

COinS