Name
Title | ||
|---|---|---|
Mining recent frequent itemsets in data streams by radioactively attenuating strategy |
Abstract | ||
|---|---|---|
We propose a novel approach for mining recent frequent itemsets. The approach has three key contributions. First, it is a single-scan algorithm which utilizes the special property of suffix-trees to guarantee that all frequent itemsets are mined. During the phase of itemset growth it is unnecessary to traverse the suffix-trees which are the data structure for storing the summary information of data. Second, our algorithm adopts a novel method for itemset growth which includes two special kinds of itemset growth operations to avoid generating any candidate itemset. Third, we devise a new regressive strategy from the attenuating phenomenon of radioelement in nature, and apply it into the algorithm to distinguish the influence of latest transactions from that of obsolete transactions. We conduct detailed experiments to evaluate the algorithm. It confirms that the new method has an excellent scalability and the performance illustrates better quality and efficiency. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11527503_95 | ADMA |
Keywords | Field | DocType |
new regressive strategy,radioactively attenuating strategy,recent frequent itemsets,data structure,itemset growth operation,single-scan algorithm,frequent itemsets,novel approach,candidate itemset,novel method,itemset growth,new method,data stream | Transaction processing,Data structure,Data mining,Data stream mining,Suffix,Data stream,Computer science,Deposition process,Traverse,Scalability | Conference |
Volume | ISSN | ISBN |
3584 | 0302-9743 | 3-540-27894-X |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lifeng Jia | 1 | 100 | 7.35 |
| Zhe Wang | 2 | 41 | 4.17 |
| Chunguang Zhou | 3 | 543 | 52.37 |
| Xiujuan Xu | 4 | 44 | 10.82 |