Name
Abstract | ||
|---|---|---|
Mining frequent patterns refers to the discovery of the sets of items that frequently appear in a transaction database. Many approaches have been proposed for mining frequent itemsets from a large database, but a large number of frequent itemsets may be discovered. In order to present users fewer but more important patterns, researchers are interested in discovering frequent closed itemsets which is a well-known complete and condensed representation of frequent itemsets. In this paper, we propose an efficient algorithm for discovering frequent closed itemsets over a data stream. The previous approaches need to do a large number of searching operations and computations to maintain the closed itemsets when a transaction is added or deleted. Our approach only performs few intersection operations on the transaction and the closed itemsets related to the transaction without doing any searching operation on the previous closed itemsets. The experimental results show that our approach significantly outperforms the previous approaches. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/FUZZY.2011.6007724 | FUZZ-IEEE |
Keywords | Field | DocType |
stream sliding window,sliding window,frequent closed itemsets,frequent pattern mining,data mining,frequent closed itemset mining,intersection operations,transaction database,data stream,memory management,algorithm design and analysis,computer science | Data mining,Algorithm design,Sliding window protocol,Data stream,Computer science,Algorithm,Memory management,Database transaction,Computation | Conference |
ISSN | ISBN | Citations |
1098-7584 E-ISBN : 978-1-4244-7316-8 | 978-1-4244-7316-8 | 11 |
PageRank | References | Authors |
0.69 | 14 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Show-Jane Yen | 1 | 537 | 130.05 |
| Cheng-Wei Wu | 2 | 329 | 10.89 |
| Yue-Shi Lee | 3 | 543 | 41.14 |
| Vincent S. Tseng | 4 | 2923 | 161.33 |
| Chaur-Heh Hsieh | 5 | 354 | 46.89 |