TGP: Mining Top-K Frequent Closed Graph Pattern without Minimum Support

Download Now
Provided by: Wuhan Institute of Technology Network and Information Center
Topic: Big Data
Format: PDF
In this paper, the authors propose a new mining task: mining top-k frequent closed graph patterns without minimum support. Most previous frequent graph pattern mining works require the specification of a minimum support threshold to perform the mining. However it is difficult for users to set a suitable value sometimes. They develop an efficient algorithm, called TGP, to mine patterns without minimum support. A new structure called lexicographic pattern net is designed to store graph patterns, which makes the closed pattern verification more efficient and speeds up raising support threshold dynamically.
Download Now

Find By Topic