By Topic

Efficiently Mining Closed Frequent Patterns with Weight Constraint from Directed Graph Traversals Using Weighted FP-Tree Approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Runian Geng ; Sch. of Inf. Technol., Jiangnan Univ., Wuxi ; Xiangjun Dong ; Xingye Zhang ; Wenbo Xu

In this paper, a transformable model of EWDG (edge-weighted directed graph) and VWDG (vertex-weighted directed graph) is proposed to resolve the problem of weighted traversal patterns mining. Based on the model, an effective algorithm called GTCWFP miner (graph traversals-based closed weighted frequent patterns miner) is presented. The algorithm exploits a divide-and-conquer paradigm with a pattern growth method to mine closed frequent patterns with weight constraint from the traversals on directed graph. It incorporates the closure property with weight constrains to reduce effectively search space and extracts succinct and lossless patterns from graph traversal TDB. Experimental results of synthetic data show that the algorithm is an efficient and scalable algorithm for mining closed weighted frequent patterns based on graph traversals.

Published in:

2008 ISECS International Colloquium on Computing, Communication, Control, and Management  (Volume:3 )

Date of Conference:

3-4 Aug. 2008