Approximate mining of frequent patterns on streams

Intelligent Data Analysis

Volumn 11, Issue 1, 2007, Pages 49-73

  Silvestri, Claudio ^a   Orlando, Salvatore ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 41849106846     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2007-11104     Document Type: Article

References (38)

1. R. Agarwal, C. Aggarwal and V.V.V. Prasad, A tree projection algorithm for generation of frequent itemsets, Journal of Parallel and Distributed Computing 61(3) (2001).
2. R. Agrawal, T. Imielinski and A. Swamim, Mining Association Rules Between Sets of Items in Large Databases, In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 1993.
3. R. Agrawal and J.C. Shafer, Parallel mining of association rules, IEEE Transactions on Knowledge and Data Engineering 8(6) (1996).
4. R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules in Large Databases, In Proceedings of the 20th International Conference on Very Large Data Bases, 1994.
5. B. Babcock, S. Babu, M. Datar, R. Motwani and J. Widom, Models and Issues in Data Stream Systems, In Proceedings of the 21st ACM SIGMOD Symposium on Principles of Database Systems, 2002. 23.
6. T. Brijs, G. Swinnen, K. Vanhoof and G. Wets, Using Association Rules for Product Assortment Decisions: A Case Study, In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1999.
7. J.H. Chang and W.S. Lee, Finding Recent Frequent Itemsets Adaptively Over Online Data Streams, In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003.
8. M. Charikar, K. Chen and M. Farach-Colton, Finding frequent items in data streams. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002.
9. D.W. Cheung, J. Han, V.T. Ng, A.W. Fu and Y. Fu, A Fast Distributed Algorithm for Mining Association Rules, In Proceedings of the 4th International Conference on Parallel and Distributed Information Systems, 1996.
10. G. Cormode and S. Muthukrishnan, What's Hot and what's Not: Tracking Most Frequent Items Dynamically, In Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2003.
11. G. Cormode and S. Muthukrishnan, An improved data stream summary: the count-min sketch and its applications, Journal of Algorithms 55(1) (2005).
12. E.D. Demaine, A. Lóopez-Ortiz and J.I. Munro, Frequency Estimation of Internet Packet Streams with Limited Space, In ESA '02: Proceedings of the 10th Annual European Symposium on Algorithms, 2002.
13. C. Domingo, R. Gavalda and O. Watanabe, Adaptive sampling methods for scaling up knowledge discovery algorithms, Data Mining and Knowledge Discovery 6(2) (2002).
14. U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy, eds, Advances in Knowledge Discovery and Data Mining, AAAI Press, 1998.
15. V. Ganti, J. Gehrke and R. Ramakrishnan, Mining very large databases, IEEE Computer 32(8) (1999).
16. K. Geurts, G. Wets, T. Brijs and K. Vanhoof, Profiling High Frequency Accident Locations Using Association Rules, In Proceedings of the 82nd Annual Transportation Research Board, 2003.
17. C. Giannella, J. Han, J. Pei, X. Yan and P.S. Yu, Mining Frequent Patterns in Data Streams at Multiple Time Granularities, AAAI/MIT Press, 2003. 24.
18. B. Goethals and M.J. Zaki, eds, FIMI '03, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, Vol. 90 of CEUR Workshop Proceedings. CEUR-WS.org, 2003.
19. E.-H.S. Han, G. Karypis and V. Kumar, Scalable parallel data mining for association rules, In IEEE Transaction on Knowledge and Data Engineering (2000).
20. J. Han, J. Pei and Y. Yin, Mining Frequent Patterns Without Candidate Generation, In Proceedings of the ACM SIGMOD International Conference on Management of Data, 2000.
21. J.D. Holt and S.M. Chung, Mining association rules using inverted hashing and pruning. Information Processing Letters 83(4) (2002).
22. R. Jin and G.G. Agrawal, An Algorithm for In-Core Frequent Itemset Mining on Streaming Data, In Fifth IEEE International Conference on Data Mining, 2005.
23. R.M. Karp, S. Shenker and C.H. Papadimitriou, A simple algorithm for finding frequent elements in streams and bags, ACM Transactions on Database Systems 28(1) (2003).
24. G. Manku and R. Motwani, Approximate Frequency Counts Over Data Streams, In In Proceedings of the 28th International Conference on Very Large Data Bases, 2002.
25. J. Misra and D. Gries, Finding repeated elements, Science of Computer Programming 2(2) (1982).
26. A. Mueller, Fast sequential and parallel algorithms for association rules mining: A comparison. Technical Report CS-TR-3515, University of Maryland, 1995.
27. S. Orlando, P. Palmerini, R. Perego and F. Silvestri, Adaptive and Resource-Aware Mining of Frequent Sets, In Proceedings of the 2002 IEEE International Conference on Data Mining, 2002.
28. S. Orlando, R. Perego and C. Silvestri, A New Algorithm for Gap Constrained Sequence Mining, In Proceedings of ACM Symposim on Applied Computing - Data Mining Track, 2004.
29. J.S. Park, M.S. Chen and P.S. Yu, An Effective Hash Based Algorithm for Mining Association Rules, In Proceedings of 1995 ACM SIGMOD International Conference on Management of Data, 1995.
30. S. Parthasarathy, Efficient Progressive Sampling for Association Rules, In Proceedings of the 2002 IEEE International Conference on Data Mining, 2002, 25.
31. A. Savasere, E. Omiecinski and S.B. Navathe, An Efficient Algorithm for Mining Association Rules in Large Databases, In Proceedings of 21th International Conference on Very Large Data Bases, 1995.
32. T. Scheffer and S. Wrobel, Finding the most interesting patterns in a database quickly by using sequential sampling, Journal of Machine Learning Research 3 (2003).
33. A. Schuster and R. Wolffer, Communication Efficient Distributed Mining of Association Rules, In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, 2001.
34. C. Silvestri and S. Orlando, Distributed Approximate Mining of Frequent Patterns, In Proceedings of ACM Symposim on Applied Computing - Data Mining track, 2005.
35. H. Toivonen, Sampling Large Databases for Association Rules, In In Proceedings of the 1996 International Conference on Very Large Data Bases. Morgan Kaufman, 1996.
36. R. Wolff and A. Schuster, Mining Association Rules in Peer-to-Peer Systems, In The Third IEEE International Conference on Data Mining, 2003.
37. M.J. Zaki, Parallel and distributed association mining: A survey, IEEE Concurrency 7(4) (1999).
38. M.J. Zaki, Scalable algorithms for association mining, IEEE Transactions on Knowledge and Data Engineering 12(3) (2000), 26.