Constrained frequent itemset mining from uncertain data streams

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 120-127

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

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BUILDING BLOCKES; DATA MINING TASKS; DATA STREAM; FREQUENT ITEMSET MINING; FREQUENT ITEMSETS; ITEM SETS; REAL-LIFE APPLICATIONS; TRANSACTION DATABASE; TREE-BASED ALGORITHMS; UNCERTAIN DATAS; USER INTERESTS; USER-SPECIFIED CONSTRAINTS;

ASSOCIATIVE PROCESSING; DATA COMMUNICATION SYSTEMS; DATA MINING; MINING;

TREES (MATHEMATICS);

EID: 77952656749     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDEW.2010.5452736     Document Type: Conference Paper

References (29)

1. C.C. Aggarwal et al., "Frequent pattern mining with uncertain data," in Proc. KDD 2009, pp. 29-37.
2. R. Agrawal et al., "Mining association rules between sets of items in large databases," in Proc. ACM SIGMOD 1993, pp. 207-216.
3. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in Proc. VLDB 1994, pp. 487-499.
4. R.J. Bayardo Jr., R. Agrawal, and D. Gunopulos, "Constraint-based rule mining in large, dense databases," Data Mining and Knowledge Discovery, 4(2-3), pp. 217-240, July 2000.
5. T. Bernecker et al., "Probabilistic frequent itemset mining in uncertain databases," in Proc. KDD 2009, pp. 119-127.
6. R. Cheng et al., "Probabilistic verifiers: evaluating constrained nearest-neighbor queries over uncertain data," in Proc. IEEE ICDE 2008, pp. 973-982.
7. C.-K. Chui, B. Kao, and E. Hung, "Mining frequent itemsets from uncertain data," in Proc. PAKDD 2007, pp. 47-58.
8. G. Cormode and M. Hadjieleftheriou, "Finding frequent items in data streams," in Proc. VLDB 2008, pp. 1530-1541.
9. G. Cormode et al., "Finding hierarchical heavy hitters in streaming data," ACM TKDD, 1(4), article 2, Jan. 2008.
10. X. Dai et al., "Probabilistic spatial queries on existentially uncertain data," in Proc. SSTD 2005, pp. 400-417.
11. M.M. Gaber, A.B. Zaslavsky, and S. Krishnaswamy, "Mining data streams: a review," SIGMOD Record, 34(2), pp. 18-26, June 2005.
12. 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, AAAI/MIT Press, 2004.
13. G. Grahne, L.V.S. Lakshmanan, and X. Wang, "Efficient mining of constrained correlated sets," in Proc. IEEE ICDE 2000, pp. 512-521.
14. J. Han, J. Pei, and Y. Yin, "Mining frequent patterns without candidate generation," in Proc. ACM SIGMOD 2000, pp. 1-12.
15. J. Huang et al., "MayBMS: a probabilistic database management system," in Proc. ACM SIGMOD 2009, pp. 1071-1074.
16. C. Jin et al., "Sliding-window top-k queries on uncertain streams," in Proc. VLDB 2008, pp. 301-312.
17. L.V.S. Lakshmanan, C.K.-S. Leung, and R.T. Ng, "Efficient dynamic mining of constrained frequent sets," ACM TODS, 28(4), pp. 337-389, Dec. 2003.
18. C.K.-S. Leung, "Frequent itemset mining with constraints," in Encyclopedia of Database Systems, pp. 1179-1183, Springer, 2009.
19. C.K.-S. Leung and D.A. Brajczuk, "Efficient algorithms for mining constrained frequent patterns from uncertain data," in Proc. U '09, pp. 9-18.
20. C.K.-S. Leung and B. Hao, "Mining of frequent itemsets from streams of uncertain data," in Proc. IEEE ICDE 2009, pp. 1663-1670.
21. 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-933.
22. C.K.-S. Leung, M.A.F. Mateo, and D.A. Brajczuk, "A tree-based approach for frequent pattern mining from uncertain data," in Proc. PAKDD 2008, pp. 653-661.
23. C.K.-S. Leung, R.T. Ng, and H. Mannila, "OSSM: a segmentation approach to optimize frequency counting," in Proc. IEEE ICDE 2002, pp. 583-592.
24. R.T. Ng et al., "Exploratory mining and pruning optimizations of constrained associations rules," in Proc. ACM SIGMOD 1998, pp. 13-24.
25. J. Pei, J. Han, and L.V.S. Lakshmanan, "Mining frequent itemsets with convertible constraints," in Proc. IEEE ICDE 2001, pp. 433-442.
26. C. Ré et al., "Event queries on correlated probabilistic streams," in Proc. ACM SIGMOD 2008, pp. 715-728.
27. A.D. Sarma, M. Theobald, and J. Widom, "Exploiting lineage for confidence computation in uncertain and probabilistic databases," in Proc. IEEE ICDE 2008, pp. 1023-1032.
28. K. Yi et al., "Small synopses for group-by query verification on outsourced data streams," ACM TODS, 34(3), article 15, Aug. 2009.
29. Q. Zhang, F. Li, and K. Yi, "Finding frequent items in probabilistic data," in Proc. ACM SIGMOD 2008, pp. 819-832.