Improved BVBUC algorithm to discover closed itemsets in long biological datasets
The task in mining closed frequent itemsets requires the algorithm to mine the frequent ones then determine its closure. The efficiency of closure computation is very important as it will determine the total mining time and the required memory. Over the years, many closure computation methods have b...
Main Authors: | Md Zaki, Fatimah Audah, Zulkurnain, Nurul Fariza |
---|---|
Format: | Article |
Language: | English |
Published: |
Trans Tech Publications Ltd, Switzerland
2019
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/79195/ http://irep.iium.edu.my/79195/ http://irep.iium.edu.my/79195/ http://irep.iium.edu.my/79195/1/79195_Improved%20BVBUC%20Algorithm%20to%20Discover.pdf |
Similar Items
-
Towards scalable algorithm for closed itemset mining in high-dimensional data
by: Md. Zaki, Fatimah Audah, et al.
Published: (2017) -
RARE: mining colossal closed itemset in high dimensional data
by: Md Zaki, Fatimah Audah, et al.
Published: (2018) -
An efficient algorithm to discover large and frequent itemset in high dimensional data
by: Zulkurnain, Nurul Fariza
Published: (2019) -
Datasets Size: Effect on Clustering Results
by: Raheem, Ajiboye Adeleke, et al.
Published: (2013) -
Visualizing the construction of incremental Disorder Trie Itemset data structure (DOSTrieIT) for Frequent Pattern Tree (FP-Tree)
by: Zailani, Abdullah, et al.
Published: (2011)