Mining of frequent itemsets with JoinFI-mine algorithm
Association rule mining among frequent items has been widely studied in data mining field. Many researches have improved the algorithm for generation of all the frequent itemsets. In this paper, we proposed a new algorithm to mine all frequents itemsets from a transaction database. The main features...
Saved in:
Main Authors: | Supatra Sahaphong, Gumpon Sritanratana |
---|---|
Other Authors: | Ramkhamhaeng University |
Format: | Conference or Workshop Item |
Published: |
2018
|
Subjects: | |
Online Access: | https://repository.li.mahidol.ac.th/handle/123456789/11797 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Mahidol University |
Similar Items
-
A fast algorithm for mining the longest frequent itemset
by: FU QIAN
Published: (2010) -
Mining frequent itemsets using support constraints
by: Wang, K., et al.
Published: (2014) -
A data mining proxy approach for efficient frequent itemset mining
by: Yu, J.X., et al.
Published: (2013) -
Claim: An Efficient Method for Relaxed Frequent Closed Itemsets Mining over Stream Data
by: SONG, Guojie, et al.
Published: (2007) -
Mining interesting itemsets
by: Ardian Kristano Poernomo
Published: (2011)