NDLI: Balanced Tidset-based Parallel FP-tree Algorithm for the Frequent Pattern Mining on Grid System

Content Provider	IEEE Xplore Digital Library
Author	Jiayi Zhou Kun-Ming Yu
Copyright Year	2008
Description	Author affiliation: Dept. of Comput. Sci. & Inf. Eng., Chung Hua Univ., Hsinchu (Kun-Ming Yu) \|\| Inst. of Eng. Sci., Chung Hua Univ., Hsinchu (Jiayi Zhou)
Abstract	Mining frequent patterns from transaction-oriented database is an important problem. Frequent patterns are essential for generate association rules, time series, etc. Most of frequent patterns mining algorithm can be classified into two categories: generate-and-test approach (Apriori-like) and pattern growth approach (FP-tree). In recent times, many methods have been proposed for solving this problem based on FP-tree, because this approach can reduce the number of database scan. However, even for pattern growth methods, the execution time grows rapidly when the database size is getting large and the given support is small. Therefore, parallel-distributed computing is a good strategy to solve this problem. Some parallel algorithms have been proposed, but the execution time is costly when the database size is large. In this paper, we proposed an efficient parallel and distributed mining algorithm-Balanced Tidset Parallel FP-tree (BTP-tree) algorithm on grid computing system. Grid system is a heterogeneous computing environment, our proposed method can balance the loading according to the tree depth and width. In order to exchange transactions efficiently, transaction identification set (Tidset) was used to directly select transactions instead of scanning database. BTP-tree, TPFP-tree and PFP-tree were implemented and the datasets generated by IBM Quest Synthetic Data Generator are used to verify the performance of BTP-tree. The experimental results show that BTP-tree can reduce the execution time significantly and has better loading balance capability than TPFP-tree and PFP-tree.
Starting Page	103
Ending Page	108
File Size	380747
Page Count	6
File Format	PDF
ISBN	9780769534015
DOI	10.1109/SKG.2008.65
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-12-03
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Knowledge engineering Pervasive computing load balancing grid computing association rules Data engineering Data structures Transaction databases Data mining Association rules Computer science Concurrent computing Grid computing tidset frequent pattern mining
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Libarray of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Mining closed frequent itemset based on FP-Tree

Parallel frequent itemsets mining algorithm without intermediate result

Association rules parallel algorithm based on FP-tree

A Parallel Apriori Algorithm for Frequent Itemsets Mining

A New Algorithm for Frequent Itemsets Mining Based on Apriori and FP-Tree

Mining Up-to-Date Knowledge Based on Tree Structures

Mining Frequent Patterns based on Compressed FP-tree without Conditional FP-tree Generation

Applying a pattern length constraint on the FP-Growth algorithm

HPFP-Miner: A Novel Parallel Frequent Itemset Mining Algorithm

Balanced Tidset-based Parallel FP-tree Algorithm for the Frequent Pattern Mining on Grid System

Similar Documents

Mining closed frequent itemset based on FP-Tree

Parallel frequent itemsets mining algorithm without intermediate result

Association rules parallel algorithm based on FP-tree

A Parallel Apriori Algorithm for Frequent Itemsets Mining

A New Algorithm for Frequent Itemsets Mining Based on Apriori and FP-Tree

Mining Up-to-Date Knowledge Based on Tree Structures

Mining Frequent Patterns based on Compressed FP-tree without Conditional FP-tree Generation

Applying a pattern length constraint on the FP-Growth algorithm

HPFP-Miner: A Novel Parallel Frequent Itemset Mining Algorithm

Balanced Tidset-based Parallel FP-tree Algorithm for the Frequent Pattern Mining on Grid System