Mining of frequent itemsets from streams of uncertain data

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 1663-1670

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

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAM; EXISTENTIAL PROBABILITY; FREQUENT ITEMSET MINING; FREQUENT ITEMSETS; MINING ALGORITHMS; MINING FREQUENT ITEMSETS; REAL-LIFE APPLICATIONS; TRANSACTION DATABASE; TREE-BASED; UNCERTAIN DATA;

DATA MINING;

MINING;

EID: 67649641426     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.157     Document Type: Conference Paper

References (21)

1. R. Agrawal, T. Imielinski, and A. Swami, "Mining association rules between sets of items in large databases," in Proc. ACM 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. Cheng, J. Chen, M. F. Mokbel, and C.-Y. Chow, "Probabilistic verifiers: evaluating constrained nearest-neighbor queries over uncertain data," in Proc. IEEE ICDE 2008, pp. 973-982.
4. C.-K. Chui and B. Kao, "A decremental approach for mining frequent itemsets from uncertain data," in Proc. PAKDD 2008, pp. 64-75.
5. C.-K. Chui, B. Kao, and E. Hung, "Mining frequent itemsets from uncertain data," in Proc. PAKDD 2007, pp. 47-58.
6. G. Cormode and M. Hadjieleftheriou, "Finding frequent items in data streams," in Proc. VLDB 2008, pp. 1530-1541.
7. X. Dai, M. L. Yiu, N. Mamouils, Y. Tao, and M. Vaitis, "Probabilistic spatial queries on existentially uncertain data," in Proc. SSTD 2005, pp. 400-417.
8. M. M. Gaber, A. B. Zaslavsky, and S. Krishnaswamy, "Mining data streams: a review," SIGMOD Record, 34(2), pp. 18-26, June 2005.
9. C. Giannella, J. Han, J. Pei, X. Yan, and P. S. Yu, "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.
10. J. Han, J. Pei, and Y. Yin, "Mining frequent patterns without candidate generation," in Proc. ACM SIGMOD 2000, pp. 1-12.
11. C. Jin, K. Yi, L. Chen, J. X. Yu, and X. Lin, "Sliding-window top-k queries on uncertain streams," in Proc. VLDB 2008, pp. 301-312.
12. 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.
13. C. K.-S. Leung, "Frequent itemset mining with constraints," to appear in Encyclopedia of Database Systems, Springer, 2009.
14. C. K.-S. Leung, C. L. Carmichael, and B. Hao, "Efficient mining of frequent patterns from uncertain data," in Proc. IEEE ICDM Workshops 2007, pp. 489-494.
15. C. K.-S. Leung, P. P. Irani, and C. L. Carmichael, "WiFIsViz: effective visualization of frequent itemsets," in Proc. IEEE ICDM 2008, pp. 875- 880.
16. 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.
17. 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.
18. 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.
19. R. T. Ng, L. V. S. Lakshmanan, J. Han, and A. Pang, "Exploratory mining and pruning optimizations of constrained associations rules," in Proc. ACM SIGMOD 1998, pp. 13-24.
20. R. C.-W. Wong and A. W.-C. Fu, "Mining top-K frequent itemsets from data streams," Data Mining and Knowledge Discovery, 13(2), pp. 193- 217, Sept. 2006.
21. Q. Zhang, F. Li, and K. Yi, "Finding frequent items in probabilistic data," in Proc. ACM SIGMOD 2008, pp. 819-832.