A Search Space Reduced Algorithm for Mining Frequent Patterns

Download Now
Provided by: Tamir Khason
Topic: Big Data
Format: PDF
Mining frequent patterns is to discover the groups of items appearing always together excess of a user specified threshold. Many approaches have been proposed for mining frequent patterns by applying the FP-tree structure to improve the efficiency of the FP-growth algorithm which needs to recursively construct sub-trees. Although these approaches do not need to recursively construct many sub-trees, they also suffer the problem of a large search space, such that the performances for the previous approaches degrade when the database is massive or the threshold for mining frequent patterns is low.
Download Now

Find By Topic