By Topic

Sub-frequent Patterns Mining Based on SFP-Tree

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
$31 $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

5 Author(s)
Yintian Liu ; DB&KE Lab., Chengdu Univ. of Inf. Technol., Chengdu ; Yingming Liu ; Zeng, T ; Kaikuo Xu
more authors

Resource distribution optimization and load balance of distributed P2P network can be described as mining sub-frequent patterns (SFPs) from query response transaction database. The response of a latter query for a file resource provided by P2P system will pick out one SFP from the SFPs of this file resource and returns a subset of selected SFP. To realize the SFPs mining this paper proposes the structure of SFP-tree along with relative mining algorithms. The main content includes: proposing the concept of sub-frequent pattern; proposing the SFP-tree along with frequency-ascending order header table FP-Tree (AFP-Tree) and conditional mix pattern tree (CMP-Tree); and proposing the SFPs mining algorithms base on SFP-Tree. The performance experiment shows the effectiveness and efficiency of SFP-Tree based mining algorithm.

Published in:

Fuzzy Systems and Knowledge Discovery, 2008. FSKD '08. Fifth International Conference on  (Volume:5 )

Date of Conference:

18-20 Oct. 2008