2011
DOI: 10.14569/specialissue.2011.010323
|View full text |Cite
|
Sign up to set email alerts
|

Comparative Analysis of Various Approaches Used in Frequent Pattern Mining

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2016
2016

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 25 publications
(10 reference statements)
0
3
0
Order By: Relevance
“…The major weakness of Apriori algorithm is producing large number of candidate itemsets and large number of database scans which is equal to maximum length of frequent itemset [5]. It is very much expensive to scan large database [11]. A true reason of apriori failure is it lacks efficient processing method on database [7].…”
Section: Resultsmentioning
confidence: 99%
“…The major weakness of Apriori algorithm is producing large number of candidate itemsets and large number of database scans which is equal to maximum length of frequent itemset [5]. It is very much expensive to scan large database [11]. A true reason of apriori failure is it lacks efficient processing method on database [7].…”
Section: Resultsmentioning
confidence: 99%
“…The first step is mining the trend of continues attribute through cycle curve and the second step is calculating the period of the attribute. MPTAR did not define the cumulative threshold, and it is short of embracing upcoming transaction entries in the association rule mining [15,18,25].…”
Section: Related Workmentioning
confidence: 99%
“…The time period during which a fact is true with respect to the real world is considered as valid time and the time period during which a fact is stored in the database is called transaction time. According to these two time aspects temporal databases allow the division of three different forms [4,25]. They are a.…”
Section: Introductionmentioning
confidence: 99%