Efficient mining of constrained frequent patterns from streams

Proceedings of the International Database Engineering and Applications Symposium, IDEAS

Volumn , Issue , 2006, Pages 61-68

  Leung, Carson Kai Sang ^a   Khan, Quamrul I ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; SENSOR NETWORKS; USER INTERFACES; WEB SERVICES;

FREQUENT PATTERNS; STREAM MINING; WEB CLICK STREAMS;

DATA MINING;

EID: 39749123235     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDEAS.2006.20     Document Type: Conference Paper

References (25)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. SIGMOD 1993, pp. 207-216.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB 1994, pp. 487-499.
3. R.J. Bayardo. Efficiently mining long patterns from databases. In Proc. SIGMOD 1998, pp. 85-93.
4. R.J. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. In Proc. ICDE 1999, pp. 188-197.
5. J.-F. Boulicaut and B. Jeudy. Mining free itemsets under constraints. In Proc. IDEAS 2001, pp. 322-329.
6. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: generalizing association rules to correlations. In Proc. SIGMOD 1997, pp. 265-276.
7. D.W. Cheung et al. Maintenance of discovered association rules in large databases: an incremental updating technique. In Proc. ICDE 1996, pp. 106-114.
8. W. Cheung and O.R. Zaïane. Incremental mining of frequent patterns with candidate generation or support constraint. In Proc. IDEAS 2003, pp. 111-116.
9. Y. Chi et al. Moment: maintaining closed frequent itemsets over a stream sliding window. In Proc. ICDM 2004, pp. 59-66.
10. M.M. Gaber, A.B. Zaslavsky, and S. Krishnaswamy. Mining data streams: a review. SIGMOD Record, 34(2), Jun. 2005, pp. 18-26.
11. M.N. Garofalakis, R. Rastogi, and K. Shim. SPIRIT: sequential pattern mining with regular expression constraints. In Proc. VLDB 1999, pp. 223-234.
12. C. Giannella et al. Mining frequent patterns in data streams at multiple time granularities. In Data Mining: Next Generation Challenges and Future Directions, AAAI/MIT Press, 2004, ch. 6.
13. G. Grahne, L.V.S. Lakshmanan, and X. Wang. Efficient mining of constrained correlated sets. In Proc. ICDE 2000, pp. 512-521.
14. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. SIGMOD 2000, pp. 1-12.
15. R.J. Hilderman et al. Mining market basket data using share measures and characterized itemsets. In Proc. PAKDD 1998, pp. 159-170.
16. N. Jiang and L. Gruenwald. Research issues in data stream association rule mining. SIGMOD Record, 35(1), Mar. 2006, pp. 14-19.
17. R.M. Karp, S. Shenker, and C.H. Papadimitriou. A simple algorithm for finding frequent elements in streams and bags. ACM TODS, 28(1), Mar. 2003, pp. 51-55.
18. L.V.S. Lakshmanan, C.K.-S. Leung, and R. Ng. Efficient dynamic mining of constrained frequent sets. ACM TODS, 28(4), Dec. 2003, pp. 337-389.
19. C.K.-S. Leung, Q.I. Khan, and T. Hoque. CanTree: a tree structure for efficient incremental mining of frequent patterns. In Proc. ICDM 2005, pp. 274-281.
20. C.K.-S. Leung, R.T. Ng, and H. Mannila. OSSM: a segmentation approach to optimize frequency counting. In Proc. ICDE 2002, pp. 583-592.
21. R.J. Miller and Y. Yang. Association rules over interval data. In Proc. SIGMOD 1997, pp. 452-4-61.
22. R.T. Ng et al. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. SIGMOD 1998, pp. 13-24.
23. J.S. Park, M.-S. Chen, and P.S. Yu. Using a hash-based method with transaction trimming for mining association rules. IEEE TKDE, 9(5), Sep./Oct. 1997, pp. 813-825.
24. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In Proc. KDD 1997, pp. 67-73.
25. J.X. Yu et al. False positive or false negative: mining frequent itemsets from high speed transactional data streams. In Proc. VLDB 2004, pp. 204-215.