2017 Annual Conference on New Trends in Information &Amp; Communications Technology Applications (NTICT) 2017
DOI: 10.1109/ntict.2017.7976130
|View full text |Cite
|
Sign up to set email alerts
|

Maximal itemsets mining algorithm based on Bees' Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…In 2017, Mohammed et al [33] suggested that the maximal frequent itemset is the biggest incessant itemset in a database which isn't secured by different itemsets. All visit itemsets can be developed from maximal one.…”
Section: Related Workmentioning
confidence: 99%
“…In 2017, Mohammed et al [33] suggested that the maximal frequent itemset is the biggest incessant itemset in a database which isn't secured by different itemsets. All visit itemsets can be developed from maximal one.…”
Section: Related Workmentioning
confidence: 99%