NDLI: Applying a pattern length constraint on the FP-Growth algorithm

Content Provider	IEEE Xplore Digital Library
Author	Gyorodi, C. Gyorodi, R. Dersidan, M. Bandici, L.
Copyright Year	2009
Description	Author affiliation: Department of Computer Science, Faculty of Electrical Engineering and Information Technology, University of Oradea, Str. Universitatii 1, 410087, Romania (Gyorodi, C.; Gyorodi, R.; Dersidan, M.; Bandici, L.)
Abstract	With the ever-growing database sizes, we have enormous quantities of data, but unfortunately we cannot use raw data in our day-to-day reasoning/decisions. We desperately need knowledge. This knowledge is in most cases in the gathered data, but the extraction of it is a very time and resources consuming operation. In this paper we propose an improvement of the FP-Growth algorithm that focuses on applying a pattern-length constraint on the FP-Growth algorithm. This is, mining only frequent patterns with their length belonging in an interval selected by the user. The algorithm with this constraint applied can be used when only patterns with specific lengths are interesting for the user. The main advantage of running the algorithm with the length limitation instead of the classic FP-Growth algorithm is that the running time of the former is smaller, thus, the required information can be obtained in a shorter time.
Starting Page	183
Ending Page	186
File Size	317239
Page Count	4
File Format	PDF
ISBN	9781424450541
DOI	10.1109/SOFA.2009.5254855
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-07-29
Publisher Place	Romania
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Tree data structures FP-tree Data Mining Transaction databases Data mining Association rules Medical diagnosis Information technology Computer science Forward contracts Economic forecasting Iterative algorithms frequent pattern
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	Mr. Siddhartha Mukherjee siddhartha@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	ndl-support@iitkgp.ac.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

An Efficient Frequent Patterns Mining Algorithm Based on Apriori Algorithm and the FP-Tree Structure

A Fast Updated Frequent Pattern Tree

An Efficient Close Frequent Pattern Mining Algorithm

Mining closed frequent itemset based on FP-Tree

Parallel frequent itemsets mining algorithm without intermediate result

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

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

A Bounded and Adaptive Memory-Based Approach to Mine Frequent Patterns From Very Large Databases

Considering RFM-values of frequent patterns in transactional databases

Applying a pattern length constraint on the FP-Growth algorithm

Similar Documents

An Efficient Frequent Patterns Mining Algorithm Based on Apriori Algorithm and the FP-Tree Structure

A Fast Updated Frequent Pattern Tree

An Efficient Close Frequent Pattern Mining Algorithm

Mining closed frequent itemset based on FP-Tree

Parallel frequent itemsets mining algorithm without intermediate result

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

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

A Bounded and Adaptive Memory-Based Approach to Mine Frequent Patterns From Very Large Databases

Considering RFM-values of frequent patterns in transactional databases

Applying a pattern length constraint on the FP-Growth algorithm