An efficient algorithm to discover large and frequent itemset in high dimensional data
The current trend of data collection involves a small number of observations with a very large number of variables, known as high dimensional data. Mining these data produces an explosive number of smaller itemsets which are less important than colossal (large) ones. As the trend in Frequent Itemset...
Main Author: | Zulkurnain, Nurul Fariza |
---|---|
Format: | Monograph |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/70312/ http://irep.iium.edu.my/70312/1/FRGS_Closing_Report.pdf |
Similar Items
-
HYBRID: an efficient unifying process to mine frequent itemsets
by: Zulkurnain, Nurul Fariza, et al.
Published: (2018) -
RARE: mining colossal closed itemset in high dimensional data
by: Md Zaki, Fatimah Audah, et al.
Published: (2018) -
Frequent itemset mining in high dimensional data: a review
by: Md. Zaki, Fatimah Audah, et al.
Published: (2019) -
DisClose: Discovering colossal closed itemsets via a memory efficient compact row-tree
by: Zulkurnain , N.F., et al.
Published: (2013) -
Towards scalable algorithm for closed itemset mining in high-dimensional data
by: Md. Zaki, Fatimah Audah, et al.
Published: (2017)