Efficient algorithms for mining constrained frequent patterns from uncertain data

Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data, U'09 in Conjunction with KDD'09

Volumn , Issue , 2009, Pages 9-18

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

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Constrained mining; Frequent itemsets; Knowledge discovery and data mining; Uncertain data mining; Uncertainty; User constraints

Indexed keywords

EFFICIENT ALGORITHM; FREQUENT PATTERNS; KNOWLEDGE DISCOVERY AND DATA MININGS; MINING FREQUENT ITEMSETS; UNCERTAIN DATAS; USER CONSTRAINTS;

ALGORITHMS; ASSOCIATIVE PROCESSING; COMPUTATIONAL EFFICIENCY; MINING;

DATA ACQUISITION;

EID: 70450243146     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1610555.1610557     Document Type: Conference Paper

References (31)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB 1994, pp. 487-499.
2. 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.
3. J. Bailey, T. Manoukian, and K. Ramamohanarao. Fast algorithms for mining emerging patterns. In Proc. PKDD 2002, pp. 187-208.
4. R.J. Bayardo Jr., R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. In Data Mining and Knowledge Discovery, 4(2-3), pp. 217-240, 2000.
5. G. Buehrer, S. Parthasarathy, and A. Ghoting. Out-of-core frequent pattern mining on a commodity PC. In Proc. KDD 2006, pp. 86-95.
6. L. Cerf, J. Besson, et al. Data-Peeler: constraint-based closed pattern mining in n-ary relations. In Proc. SDM 2008, pp. 37-48.
7. R. Cheng, J. Chen, et al. Probabilistic verifiers: evaluating constrained nearest-neighbor queries over uncertain data. In Proc. IEEE ICDE 2008, pp. 973-982.
8. C.-K. Chui and B. Kao. A decremental approach for mining frequent itemsets from uncertain data. In Proc. PAKDD 2008, pp. 64-75.
9. C.-K. Chui, B. Kao, and E. Hung. Mining frequent itemsets from uncertain data. In Proc. PAKDD 2007, pp. 47-58.
10. X. Dai, M.L. Yiu, et al. Probabilistic spatial queries on existentially uncertain data. In Proc. SSTD 2005, pp. 400-417.
11. L. de Raedt, T. Guns, and S. Nijssen. Constraint programming for itemset mining. In Proc. KDD 2008, pp. 204-212.
12. R. Ge, M. Ester, et al. Constraint-driven clustering. In Proc. KDD 2007, pp. 320-329.
13. G. Grahne, L.V.S. Lakshmanan, and X. Wang. Efficient mining of constrained correlated sets. In Proc. IEEE IGDE 2000, pp. 512-521.
14. R. Gupta, G. Fang, et al. Quantitative evaluation of approximate frequent pattern mining algorithms. In Proc. KDD 2008, pp. 301-309.
15. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD 2000, pp. 1-12.
16. M. Hu, J. Yang, and W. Su. Permu-pattern: discovery of mutable permutation patterns with proximity constraint. In Proc. KDD 2008, pp. 318-326.
17. Y. Ke, J. Cheng, and W. Ng. Mining quantitative correlated patterns using an information-theoretic approach. In Proc. KDD 2006, pp. 227-236.
18. A.J. Knobbe and E.K.Y. Ho. Maximally informative k-itemsets and their efficient discovery. In Proc. KDD 2006, pp. 237-244.
19. 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.
20. C. K.-S. Leung. Frequent itemset mining with constraints. To appear in Encyclopedia of Database Systems, Springer, 2009.
21. 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.
22. C.K.-S. Leung and B. Hao. Mining of frequent itemsets from streams of uncertain data. In Proc. ICDE 2009, pp. 1663-1670.
23. 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.
24. C.K.-S. Leung, L.V.S. Lakshmanan, and R.T. Ng. Exploiting succinct constraints using FP-trees. SIGKDD Explorations, 4(1), pp. 40-49.
25. 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.
26. C.K.-S. Leung, Q.I. Khan, and T. Hoque. CanTree: a tree structure for efficient incremental mining of frequent patterns. In Proc. IEEE ICDM 2005, pp. 274-281.
27. C.K.-S. Leung, P.P. Irani, C.L. Carmichael. FIsViz: a frequent itemset visualizer. In Proc. PAKDD 2008, pp. 644-652.
28. R.T. Ng, L.V.S. Lakshmanan, et al. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. ACM SIGMOD 1998, pp. 13-24.
29. J. Pei, M. Hua, et al. Query answering techniques on uncertain and probabilistic data: tutorial summary. In Proc. ACM SIGMOD 2008, pp. 1357-1364.
30. C. Wang and S. Parthasarathy. Summarizing itemset patterns using probabilistic models. In Proc. KDD 2006, pp. 730-735.
31. Q. Zhang, F. Li, and K. Yi. Finding frequent items in probabilistic data. In Proc. ACM SIGMOD 2008, pp. 819-832.