Bharat Gupta and Dr. Deepak Garg (2011) FP-Tree Based Algorithms Analysis: FPGrowth, COFI-Tree and CT-PRO

getCITED

Home Search Add Content Reports Help

Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations

Add to Bookstack | Show Bookstack | Change Bookstack

FP-Tree Based Algorithms Analysis: FPGrowth, COFI-Tree and CT-PRO

Post a Comment

CONTRIBUTORS:

	Author:	Bharat Gupta
	Author:	Dr. Deepak Garg

JOURNAL:

International Journal on Computer Science and Engineering (IJCSE), 3(7), 2691 - 2699.

YEAR:

2011

PUB TYPE:

Journal Article

SUBJECT(S):

Data mining, FP-Tree based Algorithm, Frequent Itemsets.

DISCIPLINE:

Computer Science

HTTP:

http://www.enggjournals.com/ijcse/doc/IJCSE11-03-07-092.pdf

LANGUAGE:

English

PUB ID:

103-491-430 (Last edited on 2011/07/16 03:05:59 GMT-6)

SPONSOR(S):

ABSTRACT:
Mining frequent itemsets from the large transactional database is a very critical and important task. Many algorithms have been proposed from past many years, But FP-tree like algorithms are considered as very effective algorithms for efficiently mine frequent item sets. These algorithms considered as efficient because of their compact structure and also for less generation of candidates itemsets compare to Apriori and Apriori like algorithms. Therefore this paper aims to presents a basic Concepts of some of the algorithms (FP-Growth, COFI-Tree, CT-PRO) based upon the FP- Tree like structure for mining the frequent item sets along with their capabilities and comparisons.

STATISTICS

Click on # to view
Citations		0
References		0
Comments		0
Quality		0/0.00
Interest		0/0.00
View(er)s		1/92

Quality
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Interest
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Prev | Next