Mining frequent closed itemsets from a landmark window over online data streams

@article{Liu2009MiningFC,
  title={Mining frequent closed itemsets from a landmark window over online data streams},
  author={Xuejun Liu and Jihong Guan and Ping Hu},
  journal={Computers & Mathematics with Applications},
  year={2009},
  volume={57},
  pages={927-936}
}
The frequent closed itemsets determine exactly the complete set of frequent itemsets and are usually much smaller than the later. However, mining frequent closed itemsets from a landmark window over data streams is a challenging problem. To solve the problem, this paper presents a novel algorithm (called FP-CDS) that can capture all frequent closed itemsets and a new storage structure (called FP-CDS tree) that can be dynamically adjusted to reflect the evolution of itemsets’ frequencies over… CONTINUE READING