Mining frequent items in a stream using flexible windows

Intelligent Data Analysis

Volumn 12, Issue 3, 2008, Pages 293-304

  Caldersa, Toon ^a   Dextersb, Nele ^b   Goethalsb, Bart ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 49849086283     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2008-12304     Document Type: Article

References (15)

1. J. Ruoming and G. Agrawal, An Algorithm for In-Core Frequent Itemset Mining on Streaming Data. In Proc. 5th IEEE Int. Conf. on Data Mining (ICDM'05), (2005), pp. 210-217.
2. R. Agrawal, T. Imielinski and A. Swami, Mining Association Rules between Sets of Items in Large Databases. In Proc. ACM SIGMOD Int. Conf on Management of Data, (1993), pp. 207 216.
3. G. Cormode and S. Muthukrishnan, What's Hot and What's Not: Tracking Most Frequent Items Dynamically. In Proc. PODS Int. Conf. Principles of Database Systems, (2003).
4. E.D. Demaine, A. Lopez-Ortiz and J.I. Munro, Frequency Estimation of Internet Packet Streams with Limited Space. In Proc. of the 10th Annual European Symposium on Algorithms, (2002), pp. 348-360.
5. C. Giannella, J. Han, E. Robertson and C. Liu,: Mining Frequent Itemsets Over Arbitrary Time Intervals in Data Streams. In Technical Report TR587, Indiana University, Bloomington. (2003).
6. C. Giannella, J. Han, J. Pei, X. Yan and P.S. Yu, Mining Frequent Patterns In Data Streams at Multiple Time Granularities, in: Next Generation Data Mining, H. Kargupta, A. Joshi, K. Sivakumar and Y. Yesha, eds, 2003, pp. 191-212.
7. L. Golab, D. DeHaan, E.D. Demaine, A. Lopez-Ortiz and J. I. Munro, Identifying Frequent Items in Sliding Windows over On-Line Packet Streams, In Proc. of the 1st ACM SIGCOMM Internet Measurement Conference, (2003), pp. 173-178.
8. R. Jin and G. Agrawal, An Algorithm for In-Core Frequent Itemset Mining on Streaming Data. In Proc. of the 5th IEEE International Conference on Data Mining (ICDM), (2005), pp. 210-217.
9. R.M. Karp, C.H. Papadimitriou and S. Shenker, A Simple Algorithm for Finding Frequent Elements in Streams and Bags, ACM Trans on Database Systems 28 (2003), 51-55.
10. D. Lee and W. Lee, Finding Maximal Frequent Itemsets over Online Data Streams Adaptively. In Proc. of the 5th IEEE International Conference on Data Mining (ICDM), (2005), pp. 266-273.
11. L.K. Lee and H.F. Ting, A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows. In Proc. PODS Int. Conf. Principles of Database Systems, (2006).
12. C.-H. Lin, D.-Y. Chin, Y.-H. Wu and A.L.P. Chen, Mining Frequent Itemsets from Data Streams with a Time-Sensitive Sliding Window. In Proc. SIAM International Conference on Data Mining, (2005).
13. J. Misra and D. Gries, Finding Repeated Elements, Science of Computer Programming 2 (2) (1982), 143-152.
14. R. Chi-Wing Wong and A. Wai-Chee Fu, Mining Top-K Frequent itemsets from Data Streams. In Data Mining and Knowledge Discovery. To appear, (2006).
15. J.X. Yu, Z. Chong, H. Lu and A. Zhou, False Positive or False Negative: Mining Frequent Items from High Speed Transactional Data Streams. In Proc. of the 30th International Conference on Very Large Databases, (2004), pp. 204-215.