2018 International Conference on Computer, Communication, Chemical, Material and Electronic Engineering (IC4ME2) 2018
DOI: 10.1109/ic4me2.2018.8465499
|View full text |Cite
|
Sign up to set email alerts
|

An Adaptive Method for Mining Frequent Itemsets Based on Apriori And FP Growth Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
8
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 8 publications
1
8
0
Order By: Relevance
“…This system is able to provide an efficient and custom services, enabling readers to find the books of their interest more quickly. In the journal, Hasan et al [32] suggested a technique for avoiding this issue by using binomial distribution (BD) to adapt to discover adequate minimum assistance. Mine optimal frequency itemsets have been helped to make their suggested method work better than the current benchmark.…”
Section: Related Workmentioning
confidence: 99%
“…This system is able to provide an efficient and custom services, enabling readers to find the books of their interest more quickly. In the journal, Hasan et al [32] suggested a technique for avoiding this issue by using binomial distribution (BD) to adapt to discover adequate minimum assistance. Mine optimal frequency itemsets have been helped to make their suggested method work better than the current benchmark.…”
Section: Related Workmentioning
confidence: 99%
“…The frequent itemset mining algorithm (Apriori algorithm) [ 33 , 34 , 35 , 36 ] used for I = { , ,…, } is the set of all items in the data, while T = { , ,…, } is the set of all transactions. A collection of 0 or more items is called an itemset.…”
Section: Detailed Description Of the Schemementioning
confidence: 99%
“…However, the sizes of three data structures are set empirically. The work in Reference 31 finds the most suitable minimum support adaptively by Binomial distribution. It is able to optimize the running time on some specific datasets, but fails to do so if the minimum support changes.…”
Section: Related Workmentioning
confidence: 99%