NDLI: Alternative Method for Increnentally Constructing the FP-Tree

Content Provider	IEEE Xplore Digital Library
Author	Muhaimenul Adnan Reda Alhajj Barker, K.
Copyright Year	2006
Description	Author affiliation: Dept. of Comput. Sci., Calgary Univ., Alta. (Muhaimenul Adnan; Reda Alhajj; Barker, K.)
Abstract	The FP-tree is an effective data structure that facilitates the mining of frequent patterns from transactional databases. But, transactional databases are dynamic in general, and hence modifications on the database must be reflecting onto the FP-tree. Constructing the FP-tree from scratch and incrementally updating the FP-tree are two possible choices. However, from scratch construction turns unfeasible as the database size increases. So, this paper addresses incremental update by extending the FP-tree concepts and manipulation process. Our new approach is capable of handling all kinds of changes; include additions, deletions and modifications. The target is achieved by constructing and incrementally dealing with the complete FP-tree, i.e., with one minimum support. Constructing the complete FP-tree has the other advantage that it provides the freedom of mining for lower minimum support values without the need to reconstruct the tree. However, directly reflecting the changes onto the FP-tree may invalidate the basic FP-tree structure. Thus, we apply a sequence of shuffling and merging operations to validate and maintain the modified tree. The experiments conducted on synthetic and real datasets clearly highlight advantages of the proposed incremental approach over constructing the FP-tree from scratch
Starting Page	494
Ending Page	499
File Size	8480360
Page Count	6
File Format	PDF
ISBN	142440195X
DOI	10.1109/IS.2006.348469
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-09-04
Publisher Place	UK
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Data mining Transaction databases Association rules Itemsets Computer science Data structures Data analysis Intelligent systems Deductive databases Intelligent structures dynamic databases incremental mining sequential patterns mining FP-tree
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

An Incremental FUSP-Tree Maintenance Algorithm

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

Mining Positive and Negative Fuzzy Multiple Level Sequential Patterns in Large Transaction Databases

InterTARM: FP-tree based Framework for Mining Inter-transaction Association Rules from Stock Market Data

Data Classification Based on the Class-Rooted FP-Tree Approach

Incremental mining of Web sequential patterns using PLWAP tree on tolerance MinSupport

Mining closed frequent itemset based on FP-Tree

An Improved Algorithm for Mining Maximal Frequent Patterns

Set-based approach in mining sequential patterns

Alternative Method for Increnentally Constructing the FP-Tree

Similar Documents

An Incremental FUSP-Tree Maintenance Algorithm

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

Mining Positive and Negative Fuzzy Multiple Level Sequential Patterns in Large Transaction Databases

InterTARM: FP-tree based Framework for Mining Inter-transaction Association Rules from Stock Market Data

Data Classification Based on the Class-Rooted FP-Tree Approach

Incremental mining of Web sequential patterns using PLWAP tree on tolerance MinSupport

Mining closed frequent itemset based on FP-Tree

An Improved Algorithm for Mining Maximal Frequent Patterns

Set-based approach in mining sequential patterns

Alternative Method for Increnentally Constructing the FP-Tree