Frequent itemset mining of uncertain data streams using the damped window model

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2011, Pages 950-955

  Leung, Carson Kai Sang ^a   Jiang, Fan ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

data mining; frequent patterns; probabilistic databases; streaming data; time fading window

Indexed keywords

CONTINUOUS DATA; DATA STREAM; FREQUENT ITEMSET MINING; FREQUENT ITEMSETS; FREQUENT PATTERNS; MINING FREQUENT ITEMSETS; PROBABILISTIC DATABASE; SLIDING WINDOW; STREAM MINING; STREAMING DATA; TIME FADING WINDOW; TREE-BASED ALGORITHMS; UNCERTAIN DATA STREAMS; UNCERTAIN DATAS;

ALGORITHMS; DATA COMMUNICATION SYSTEMS; DATA HANDLING; DATA MINING; PLANT EXTRACTS; SENSORS;

TREES (MATHEMATICS);

EID: 79959320027     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1982185.1982393     Document Type: Conference Paper

References (22)

1. C.C. Aggarwal et al. Frequent pattern mining algorithms with uncertain data. In Managing and Mining Uncertain Data, pp. 427-459. 2009.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB 1994, pp. 487-499.
3. R. Agrawal et al. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD 1993, pp. 207-216.
4. E. Baralis et al. A persistent HY-Tree to efficiently support itemset mining on large datasets. In Proc. ACM SAC 2010, pp. 1060-1064.
5. T. Calders et al. Mining itemsets in the presence of missing values. In Proc. ACM SAC 2007, pp. 404-408.
6. F. Cao, M. Ester, et al. Density-based clustering over an evolving data stream with noise. In Proc. SDM 2006, pp. 328-339.
7. Y. Chen, M.A. Nascimento, et al. SpADe: On shape-based pattern detection in streaming time series. In Proc. IEEE ICDE 2007, pp. 786-795.
8. C.-K. Chui et al. Mining frequent itemsets from uncertain data. In Proc. PAKDD 2007, pp. 47-58.
9. M.M. Gaber et al. Mining data streams: a review. ACM SIGMOD Record, 34(2), pp. 18-26. June 2005.
10. C. Giannella et al. Mining frequent patterns in data streams at multiple time granularities. In Data Mining: Next Generation Challenges and Future Directions, ch. 6. 2004.
11. B. Goethals et al. Mining interesting sets and rules in relational databases. In Proc. ACM SAC 2010, pp. 997-1001.
12. J. Han et al. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD 2000, pp. 1-12.
13. M.J. Heravi and O.R. Zaïane. A study on interestingness measures for associative classifiers. In Proc. ACM SAC 2010, pp. 1039-1046.
14. N. Jiang and L. Gruenwald. Research issues in data stream association rule mining. SIGMOD Record, 35(1), pp. 14-19.
15. L. Leonardi et al. Frequent spatio-temporal patterns in trajectory data warehouses. In Proc. ACM SAC 2009, pp. 1433-1440.
16. C.K.-S. Leung and B. Hao. Mining of frequent itemsets from streams of uncertain data. In Proc. IEEE ICDE 2009, pp. 1663-1670.
17. C.K.-S. Leung and L. Sun. Equivalence class transformation based mining of frequent itemsets from uncertain data. In Proc. ACM SAC 2011.
18. C.K.-S. Leung et al. A tree-based approach for frequent pattern mining from uncertain data. In Proc. PAKDD 2008, pp. 653-661.
19. C.K.-S. Leung et al. Mining uncertain data for frequent itemsets that satisfy aggregate constraints. In Proc. ACM SAC 2010, pp. 1034-1038.
20. W. Lian et al. Maintenance of maximal frequent itemsets in large databases. In Proc. ACM SAC 2007, pp. 388-392.
21. G.A. Mihaila et al. Anomaly-free incremental output in stream processing. In Proc. CIKM 2008, pp. 359-368.
22. J.-J. Zeng et al. Mining fault-tolerant frequent patterns efficiently with powerful pruning. In Proc. ACM SAC 2008, pp. 927-931.