14th International Conference on Computer and Information Technology (ICCIT 2011) 2011
DOI: 10.1109/iccitechn.2011.6164843
|View full text |Cite
|
Sign up to set email alerts
|

Implication of association rules employing FP-growth algorithm for knowledge discovery

Abstract: Nowadays the database of an organization is increasing day by day. Sometimes it is necessary to know the behavior of that organization by retrieving the relationships among different attributes of their database. Implication of association rules provides an efficient way of data mining task which is used to find out the relationships among the items or the attributes of a database. This paper addresses on implication of association rules among the quantitative and categorical attributes of a database employing… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 8 publications
(2 reference statements)
0
2
0
Order By: Relevance
“…Eventually, their frequent item set search process between are unique and diverse [17]. Nowadays, the FP-Growth is one of the quickest algorithms among the rules of association [18]. Frequent Pattern Growth is one of the alternative methods to determine the most frequent item set in a data set.…”
Section: Introductionmentioning
confidence: 99%
“…Eventually, their frequent item set search process between are unique and diverse [17]. Nowadays, the FP-Growth is one of the quickest algorithms among the rules of association [18]. Frequent Pattern Growth is one of the alternative methods to determine the most frequent item set in a data set.…”
Section: Introductionmentioning
confidence: 99%
“…In the produced association rule, antecedent consists of any number of items of frequent itemsets and consequent consists of only one item. This paper explores the FP-growth algorithm on a sample employee database, which is illustrated in table 1 [9]. …”
mentioning
confidence: 99%