Hybrid Temporal Mining for Finding Out Frequent Itemsets in Temporal Databases Using Clustering and Bit Vector Methods

Author(s):  
M. Krishnamurthy ◽  
A. Kannan ◽  
R. Baskaran ◽  
G. Bhuvaneswari
2011 ◽  
Vol 3 ◽  
pp. 513-523 ◽  
Author(s):  
M. Krishnamurthy ◽  
A. Kannan ◽  
R. Baskaran ◽  
M. Kavitha

2012 ◽  
Vol 7 (23) ◽  
pp. 393-399
Author(s):  
Quanzhu Yao ◽  
Yubing Zhang ◽  
Jiulong Zhang

2014 ◽  
Vol 989-994 ◽  
pp. 3747-3750
Author(s):  
Nai Li Liu

Because of the weakness of traditional Apriori algorithm, this paper presents an improved algorithm for mining frequent itemsets, which constructs bit vector and graph, the algorithm deletes node and the adjacent edges according to the number of node’s edges, which need traverse graph to generate candidate itemsets and verify candidate itemset by bit vector. Experimental results show that the improved algorithm has better efficiency than Apriori algorithm.


2013 ◽  
Vol 33 (11) ◽  
pp. 3045-3048
Author(s):  
Hongmei WANG ◽  
Ming HU

1998 ◽  
Author(s):  
Clark W. Barrett ◽  
David L. Dill ◽  
Jeremy R. Levitt

2021 ◽  
Vol 16 (2) ◽  
pp. 1-30
Author(s):  
Guangtao Wang ◽  
Gao Cong ◽  
Ying Zhang ◽  
Zhen Hai ◽  
Jieping Ye

The streams where multiple transactions are associated with the same key are prevalent in practice, e.g., a customer has multiple shopping records arriving at different time. Itemset frequency estimation on such streams is very challenging since sampling based methods, such as the popularly used reservoir sampling, cannot be used. In this article, we propose a novel k -Minimum Value (KMV) synopsis based method to estimate the frequency of itemsets over multi-transaction streams. First, we extract the KMV synopses for each item from the stream. Then, we propose a novel estimator to estimate the frequency of an itemset over the KMV synopses. Comparing to the existing estimator, our method is not only more accurate and efficient to calculate but also follows the downward-closure property. These properties enable the incorporation of our new estimator with existing frequent itemset mining (FIM) algorithm (e.g., FP-Growth) to mine frequent itemsets over multi-transaction streams. To demonstrate this, we implement a KMV synopsis based FIM algorithm by integrating our estimator into existing FIM algorithms, and we prove it is capable of guaranteeing the accuracy of FIM with a bounded size of KMV synopsis. Experimental results on massive streams show our estimator can significantly improve on the accuracy for both estimating itemset frequency and FIM compared to the existing estimators.


Author(s):  
Mohammad Mehdi Pourhashem Kallehbasti ◽  
Matteo Giovanni Rossi ◽  
Luciano Baresi
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document