2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS) 2017
DOI: 10.1109/icecds.2017.8389527
|View full text |Cite
|
Sign up to set email alerts
|

Effective algorithm for frequent pattern mining

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…For the websites requiring high performance, we use a Bloom Filter [16] to query rapidly and memory-efficiently whether the hash of incoming HTTP request presents in the existing hash patterns. Other matching methods can be found at [17], [18].…”
Section: Attack Preventionmentioning
confidence: 99%
“…For the websites requiring high performance, we use a Bloom Filter [16] to query rapidly and memory-efficiently whether the hash of incoming HTTP request presents in the existing hash patterns. Other matching methods can be found at [17], [18].…”
Section: Attack Preventionmentioning
confidence: 99%
“…According to Aditya, S. P et al [8], apriori algorithm uses more memory and time to generate frequent pattern. Improved Apriori Algorithm takes less time to generate frequent patterns.…”
Section: According To S G Langhnoja Et Al [4]mentioning
confidence: 99%