Mining Frequent Patterns in the Recent Time Window over Data Streams

@article{Chen2008MiningFP,
  title={Mining Frequent Patterns in the Recent Time Window over Data Streams},
  author={Hui Chen},
  journal={2008 10th IEEE International Conference on High Performance Computing and Communications},
  year={2008},
  pages={586-593}
}
Because of the fluidity and continuity of a stream data, historic transactions might become obsolete and useless as new transactions arrive. It is more desirable to mine the frequent patterns in the recent time windows of a data stream. This paper proposes a method to mine the recent frequent patterns in the sliding window of data stream. It uses a conservative method to calculate the approximate frequencies of patterns in sliding window, and uses recent frequent pattern tree (RFP-tree for… CONTINUE READING
2 Citations
14 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Mining frequent patterns in data streams at multiple time granularities. In Data Mining: Next Generation Challenges and Future Directions

  • C. Giannella, J. Han, J. Pei, X. Yan, P. S. Yu
  • 2004
Highly Influential
14 Excerpts

Min - ing frequent patterns in data streams at multiple time granularities

  • J. Han C. Giannella, P. S. Yu.
  • Data Mining : Next Generation Challenges and…
  • 2004

Similar Papers

Loading similar papers…