NDLI: Maintenance of Fast Updated Frequent Pattern Trees for Record Modification

Content Provider	IEEE Xplore Digital Library
Author	Tzung-Pei Hong Jun-Wei Lin Yu-Lung Wu
Copyright Year	2006
Description	Author affiliation: Dept. of Electr. Eng., Nat. Univ. of Kaohsiung (Tzung-Pei Hong)
Abstract	In this paper, we attempt to extend the FP-tree construction algorithm for efficiently handling record modification. A fast updated FP-tree (FUFP-tree) structure is used, which makes the tree update process become easier. An FUFP-tree maintenance algorithm is also proposed for reducing the execution time in reconstructing the tree when records are modified. Experimental results show that the proposed FUFP-tree maintenance algorithm for record modification runs faster than the batch FP-tree construction algorithm for handling updated records and generates nearly the same tree structure as the FP-tree algorithm
Sponsorship	IEEE ICIC Int. National Natural Sci. Found. of China Beijing Jiaotong Univ. Kaosiung Univ. of Appl. Sci
Starting Page	570
Ending Page	573
File Size	150193
Page Count	4
File Format	PDF
ISBN	0769526160
DOI	10.1109/ICICIC.2006.111
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-08-30
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Tree data structures Itemsets Bidirectional control Frequency Transaction databases Partitioning algorithms Information management Data mining Association rules Joining processes
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 Library 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

A Fast Updated Frequent Pattern Tree

An FUSP-Tree Maintenance Algorithm for Record Modification

Maintaining the Fast Updated FP-tree from Modified Records Based on Pre-large Itemsets

Mining frequent closed itemsets using conditional frequent pattern tree

A Hybrid Method for Frequent Itemsets Mining

The Efficient and Complete Frequent Itemsets Mining of Association Rules

A new technique for fast frequent closed itemsets mining

Mining Frequent Closed Itemsets in Large Databases by Hierarchical Partitioning

Efficient Algorithms of Mining Top-k Frequent Closed Itemsets

Maintenance of Fast Updated Frequent Pattern Trees for Record Modification

Similar Documents

A Fast Updated Frequent Pattern Tree

An FUSP-Tree Maintenance Algorithm for Record Modification

Maintaining the Fast Updated FP-tree from Modified Records Based on Pre-large Itemsets

Mining frequent closed itemsets using conditional frequent pattern tree

A Hybrid Method for Frequent Itemsets Mining

The Efficient and Complete Frequent Itemsets Mining of Association Rules

A new technique for fast frequent closed itemsets mining

Mining Frequent Closed Itemsets in Large Databases by Hierarchical Partitioning

Efficient Algorithms of Mining Top-k Frequent Closed Itemsets

Maintenance of Fast Updated Frequent Pattern Trees for Record Modification