P-BBA: A MASTER/SLAVE PARALLEL BINARY-BASED ALGORITHM FORMINING FREQUENT ITEMSETS IN LARGE-SCALE DATASETS
Frequent itemsets mining is an effective but computationally expensive technique, especially when dealing with big datasets.
Saved in:
Main Author: | AMIR, ALIYA NAJIHA |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | http://utpedia.utp.edu.my/22706/1/AliyaNajiha_19000192.pdf http://utpedia.utp.edu.my/22706/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An efficient algorithm to discover large and frequent itemset in high dimensional data
by: Zulkurnain, Nurul Fariza
Published: (2019) -
HYBRID: an efficient unifying process to mine frequent itemsets
by: Zulkurnain, Nurul Fariza, et al.
Published: (2018) -
A new method for mining maximal frequent itemsets
by: Nadimi-Shahraki, Mohammad-Hossein, et al.
Published: (2008) -
A semi-apriori algorithm for discovering the frequent itemsets
by: Fageeri, S.O., et al.
Published: (2014) -
Algorithms for frequent itemset mining: a literature review
by: Chee, C.-H., et al.
Published: (2018)