Stream mining of frequent sets with limited memory

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2013, Pages 173-175

  Cameron, Juan J ^a   Cuzzocrea, Alfredo ^b   Leung, Carson K ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Data mining; Data streams; Data structure; Frequent patterns; Matrix structure

Indexed keywords

DATA STREAM; FREQUENT PATTERNS; FREQUENT SETS; LIMITED MEMORY; MAIN MEMORY; MATRIX STRUCTURE; STREAM MINING; STREAMING DATA;

ALGORITHMS; DATA COMMUNICATION SYSTEMS; DATA MINING;

DATA STRUCTURES;

EID: 84877995754     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2480362.2480398     Document Type: Conference Paper

References (20)

1. R. Agrawal & R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB 1994, pp 487-499.
2. B.P. Budhia, A. Cuzzocrea & C.K. Leung. Vertical frequent pattern mining from uncertain data. In Proc. KES 2012, pp. 1273-1282.
3. G. Buehrer et al. Out-of-core frequent pattern mining on a commodity. In Proc. ACM KDD 2006, pp. 86-95.
4. M. El-Hajj & O.R. Zaïane. Inverted matrix: efficient discovery of frequent items in large datasets in the context of interactive mining. In Proc. ACM KDD 2003, pp. 109-118.
5. M.M. Gaber et al. Data stream mining. Data Mining and Knowledge Discovery Handbook 2010, pp. 759-787.
6. C. Giannella et al. Mining frequent patterns in data streams at multiple time granularities. Data Mining: Next Generation Challenges and Future Directions, AAAI/MIT Press (2004), ch. 6.
7. G. Grahne & J. Zhu. Mining frequent itemsets from secondary memory. In Proc. IEEE ICDM 2004, pp. 91-98.
8. J. Han et al. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD 2000, pp. 1-12.
9. R. Jin & G. Agrawal. An algorithm for in-core frequent itemset mining on streaming data. In Proc. IEEE ICDM 2005, pp. 210-217
10. C.K. Leung & D.A. Brajczuk. Efficient mining of frequent itemsets from data streams. In Proc. BNCOD 2008, pp. 2-14.
11. C.K. Leung & B. Hao. Mining of frequent itemsets from streams of uncertain data. In Proc. IEEE ICDE 2009, pp. 1663-1670.
12. C.K. Leung & F. Jiang. Frequent itemset mining of uncertain data streams using the damped window model. In Proc. ACM SAC 2011, pp. 950-955.
13. C.K. Leung & Q.I. Khan. DSTree: a tree structure for the mining of frequent sets from data streams. In Proc. IEEE ICDM 2006, pp. 928-932.
14. C.K. Leung & L. Sun. A new class of constraints for constrained frequent pattern mining. In Proc. ACM SAC 2012, pp. 199-204.
15. C.K. Leung et al. A tree-based approach for frequent pattern mining from uncertain data. In Proc. PAKDD 2008, pp. 653-661.
16. C.K. Leung et al. Mining probabilistic datasets vertically. In Proc. IDEAS 2012, pp. 199-204.
17. C.K. Leung et al. Mining uncertain data for frequent itemsets that satisfy aggregate constraints. In Proc. ACM SAC 2010, pp. 1034-1038.
18. O. Papapetrou et al. Sketch-based querying of distributed sliding-window data streams. In Proc. VLDB 2012, pp. 992-1003.
19. S. Tirthapura & D.P. Woodruff. A general method for estimating correlated aggregates over a data stream. In Proc. IEEE ICDE 2012, pp. 162-173.
20. K. Yu et al. Mining emerging patterns by streaming feature selection. In Proc. ACM KDD 2012, pp. 60-68.