Efficient algorithms for stream mining of constrained frequent patterns in a limited memory environment

ACM International Conference Proceeding Series

Volumn 299, Issue , 2008, Pages 189-198

  Leung, Carson Kai Sang ^a   Brajczuk, Dale A ^a   Yu, Jialiang ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

constraints; data mining; data streams; frequent itemsets; limited memory space

Indexed keywords

CONTINUOUS DATA; DATA STREAM; EFFICIENT ALGORITHM; FREQUENT ITEMSETS; FREQUENT PATTERNS; LIMITED MEMORY; MEMORY SPACE; MINING ALGORITHMS; MINING PROCESS; REAL-LIFE APPLICATIONS; STREAM MINING; TECHNOLOGY ADVANCES; TREE-BASED ALGORITHMS; USER CONSTRAINTS;

ALGORITHMS; DATA COMMUNICATION SYSTEMS; HYDRAULICS; MINING;

DATA MINING;

EID: 77954446289     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1451940.1451967     Document Type: Conference Paper

References (26)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB 1994, pp. 487-499.
2. R. Agrawal et al. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD 1993, pp. 207-216.
3. J. Bailey et al. Fast algorithms for mining emerging patterns. In Proc. PKDD 2002, pp. 187-208.
4. R.J. Bayardo Jr. et al. Constraint-based rule mining in large, dense databases. In Data Mining and Knowledge Discovery, 4(2-3), July 2000, pp. 217-240.
5. J.-F. Boulicaut and B. Jeudy. Mining free itemsets under constraints. In Proc. IDEAS 2001, pp. 322-329.
6. Y. Chi et al. Moment: maintaining closed frequent itemsets over a stream sliding window. In Proc. IEEE ICDM 2004, pp. 59-66.
7. M. El-Hajj and O.R. Zaïane. COFI-tree mining: a new approach to pattern growth with reduced candidacy generation. In Proc. FIMI 2003.
8. M.M. Gaber et al. Mining data streams: a review. ACM SIGMOD Record, 34(2), June 2005, pp. 18-26.
9. 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.
10. G. Grahne et al. Efficient mining of constrained correlated sets. In Proc. IEEE ICDE 2000, pp. 512-521.
11. J. Han et al. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD 2000, pp. 1-12.
12. N. Jiang and L. Gruenwald. Research issues in data stream association rule mining. ACM SIGMOD Record, 35(1), March 2006, pp. 14-19.
13. R.M. Karp et al. A simple algorithm for finding frequent elements in streams and bags. ACM TODS, 28(1), March 2003, pp. 51-55.
14. M. Kontaki et al. Efficient incremental subspace clustering in data streams. In Proc. IDEAS 2006, pp. 53-60.
15. 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.
16. C.K.-S. Leung. Interactive constrained frequent-pattern mining system. In Proc. IDEAS 2004, pp. 49-58.
17. C.K.-S. Leung and D.A. Brajczuk. Efficient mining of frequent itemsets from data streams. In Proc. BNCOD 2008, pp. 2-14.
18. C.K.-S. Leung and Q.I. Khan. DSTree: a tree structure for the mining of frequent sets from data streams. In Proc. IEEE ICDM 2006, pp. 928-932.
19. C.K.-S. Leung and Q.I. Khan. Efficient mining of constrained frequent patterns from streams. In Proc. IDEAS 2006, pp. 61-68.
20. C.K.-S. Leung et al. A tree-based approach for frequent pattern mining from uncertain data. In Proc. PAKDD 2008, pp. 653-661.
21. C.K.-S. Leung et al. An effective multi-layer model for controlling the quality of data. In Proc. IDEAS 2007, pp. 28-36.
22. C.K.-S. Leung et al. CanTree: a tree structure for efficient incremental mining of frequent patterns. In Proc. IEEE ICDM 2005, pp. 274-281.
23. C.K.-S. Leung et al. FIsViz: a frequent itemset visualizer. In Proc. PAKDD 2008, pp. 644-652.
24. W. Lindner and J. Meier. Securing the Borealis data stream engine. In Proc. IDEAS 2006, pp. 137-147.
25. R.T. Ng et al. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. ACM SIGMOD 1998, pp. 13-24.
26. 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.