Name
Title | ||
|---|---|---|
A Skipping FP-Tree for Incrementally Intersecting Closed Itemsets in On-Line Stream Mining. |
Abstract | ||
|---|---|---|
An on-line mining for a data stream consisting of large transactions is still quite difficult because of an explosion of frequent itemsets. In this paper, we propose a new data structure, called a skipping FP-tree, which enables us to effectively compress the set of closed itemsets in a stream. We show, through experimental evaluations, the skipping FP-tree achieves more than ten times faster computation for incremental intersections. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/BIGCOMP.2019.8679296 | BigComp |
Keywords | Field | DocType |
Itemsets,Time-frequency analysis,Frequency estimation,Data mining,Approximation algorithms,Computer science | Data mining,Approximation algorithm,Data structure,Data stream,Computer science,Time–frequency analysis,Fold (higher-order function),Computation | Conference |
ISSN | ISBN | Citations |
2375-933X | 978-1-5386-7789-6 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takumi Nishina | 1 | 0 | 1.01 |
| Koji Iwanuma | 2 | 138 | 17.65 |
| Yoshitaka Yamamoto | 3 | 29 | 7.50 |