UCFS2: An enhanced system that mines uncertain data for constrained frequent sets

ACM International Conference Proceeding Series

Volumn , Issue , 2010, Pages 32-37

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

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Data mining; Frequent patterns; Probabilistic databases; Uncertain data; User constraints

Indexed keywords

FREQUENT PATTERNS; FREQUENT SET MINING; FREQUENT SETS; PROBABILISTIC DATABASE; TREE-BASED; UNCERTAIN DATAS; USER CONSTRAINTS;

DATA MINING; DATABASE SYSTEMS;

TREES (MATHEMATICS);

EID: 78649956077     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1866480.1866486     Document Type: Conference Paper

References (23)

1. C.C. Aggarwal et al. Frequent pattern mining with uncertain data. In Proc. KDD 2009, pp. 29-37.
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. R.J. Bayardo Jr. et al. Constraint-based rule mining in large, dense databases. In Data Mining and Knowledge Discovery, 4(2-3), July 2000, pp. 217-240.
5. T. Bernecker et al. Probabilistic frequent itemset mining in uncertain databases. In Proc. KDD 2009, pp. 119-127.
6. J.-F. Boulicaut and B. Jeudy. Mining free itemsets under constraints. In Proc. IDEAS 2001, pp. 322-329.
7. C.-K. Chui et al. Mining frequent itemsets from uncertain data. In Proc. PAKDD 2007, pp. 47-58.
8. X. Dai et al. Probabilistic spatial queries on existentially uncertain data. In Proc. SSTD 2005, pp. 400-417.
9. G. Grahne et al. Efficient mining of constrained correlated sets. In Proc. IEEE ICDE 2000, pp. 512-521.
10. J. Han et al. Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1), Jan. 2004, pp. 53-87.
11. T.-Y. Jen et al. Mining frequent conjunctive queries in star schemas. In Proc. IDEAS 2009, pp. 97-108.
12. 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.
13. C.K.-S. Leung and D.A. Brajczuk. Efficient algorithms for the mining of constrained frequent patterns from uncertain data. ACM SIGKDD Explorations, 11(2), Dec. 2009, pp. 123-130.
14. C.K.-S. Leung. Frequent itemset mining with constraints. Encyclopedia of Database Systems, pp. 1179-1183.
15. C.K.-S. Leung and D.A. Brajczuk. Mining uncertain data for constrained frequent sets. In Proc. IDEAS 2009, pp. 109-120.
16. C.K.-S. Leung, B. Hao, and D.A. Brajczuk. Mining uncertain data for frequent itemsets that satisfy aggregate constraints. In ACM SAC 2010, pp. 1034-1038.
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 et al. An effective multi-layer model for controlling the quality of data. In Proc. IDEAS 2007, pp. 28-36.
19. C.K.-S. Leung et al. CanTree: a canonical-order tree for incremental frequent-pattern mining. KAIS, 11(3), Apr. 2007, pp. 287-311.
20. C.K.-S. Leung et al. Efficient algorithms for stream mining of constrained frequent patterns in a limited memory environment. In Proc. IDEAS 2008, pp. 189-198.
21. R.T. Ng et al. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. ACM SIGMOD 1998, pp. 13-24.
22. J. Pei et al. Pushing convertible constraints in frequent itemset mining. Data Mining and Knowledge Discovery, 8(3), May 2004, pp. 227-252.
23. Q. Zhang et al. Finding frequent items in probabilistic data. In Proc. ACM SIGMOD 2008, pp. 819-832.