Claim: An Efficient Method for Relaxed Frequent Closed Itemsets Mining over Stream Data
Recently, frequent itemsets mining over data streams attracted much attention. However, mining closed itemsets from data stream has not been well addressed. The main difficulty lies in its high complexity of maintenance aroused by the model definition of closed itemsets and the dynamic changing of...
Saved in:
Main Authors: | SONG, Guojie, YANG, Dongqing, Cui, Bin, ZHENG, Baihua, WANG, Tengjiao |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2007
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/386 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Mining of frequent itemsets with JoinFI-mine algorithm
by: Supatra Sahaphong, et al.
Published: (2018) -
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) -
A fast algorithm for mining the longest frequent itemset
by: FU QIAN
Published: (2010) -
Speed-up iterative frequent itemset mining with constraint changes
by: Cong, G., et al.
Published: (2013)