An efficient algorithm to discover colossal closed itemsets 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 item sets which are less important than colossal (large) ones. As the trend in Frequent Itemse...
Saved in:
Main Author: | Fatimah Audah Md. Zaki (Author) |
---|---|
Format: | Thesis Book |
Language: | English |
Published: |
Kuala Lumpur :
Kulliyyah of Engineering, International Islamic University Malaysia,
2020
|
Subjects: | |
Online Access: | http://studentrepo.iium.edu.my/handle/123456789/11050 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Designing an efficient hybrid algorithm using unifying process to mine frequent itemset /
by: Ahmad Shah
Published: (2016) -
AN ENHANCEMENT OF INCREMENTAL ECLAT ALGORITHM FOR FREQUENT ITEMSET MINING
by: MAHADI MAN -
A new approach in infrequent itemset mining based on Eclat algorithm
by: Julaily Aida Jusoh -
A hybrid model for discovering significant patterns in data mining
by: Abdullah, Zailani
Published: (2012) -
Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop
by: Mohd Yakop, Mohammad Arsyad
Published: (2017)