Mining uncertain data for constrained frequent sets

ACM International Conference Proceeding Series

Volumn , Issue , 2009, Pages 109-120

  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

CANDIDATE GENERATION; FREQUENT PATTERNS; FREQUENT SET MINING; FREQUENT SETS; MINING PROCESS; MINING SYSTEMS; PROBABILISTIC DATABASES; TRANSACTION DATABASE; TREE-BASED; UNCERTAIN DATA; UNCERTAIN DATAS; USER CONSTRAINTS; USER INTERESTS; USER-SPECIFIED CONSTRAINTS;

ASSOCIATIVE PROCESSING; DATA MINING; DATABASE SYSTEMS;

MINING;

EID: 70350635438     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1620432.1620444     Document Type: Conference Paper

References (30)

1. C.C. Aggarwal and P.S. Yu. A framework for clustering uncertain data streams. In Proc. IEEE ICDE 2008, pp. 150-159.
2. C.C. Aggarwal et al. Frequent pattern mining with uncertain data. In Proc. KDD 2009, pp. 29-37.
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB 1994, pp. 487-499.
4. R. Agrawal et al. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD 1993, pp. 207-216.
5. J. Bailey et al. Fast algorithms for mining emerging patterns. In Proc. PKDD 2002, pp. 187-208.
6. 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.
7. T. Bernecker et al. Probabilistic frequent itemset mining in uncertain databases. In Proc. KDD 2009, pp. 119-127.
8. J.-F. Boulicaut and B. Jeudy. Mining free itemsets under constraints. In Proc. IDEAS 2001, pp. 322-329.
9. R. Cheng et al. Probabilistic verifiers: evaluating constrained nearest-neighbor queries over uncertain data. In Proc. IEEE ICDE 2008, pp. 973-982.
10. C.-K. Chui and B. Kao. A decremental approach for mining frequent itemsets from uncertain data. In Proc. PAKDD 2008, pp. 64-75.
11. C.-K. Chui et al. Mining frequent itemsets from uncertain data. In Proc. PAKDD 2007, pp. 47-58.
12. X. Dai et al. Probabilistic spatial queries on existentially uncertain data. In Proc. SSTD 2005, pp. 400-417.
13. G. Grahne et al. Efficient mining of constrained correlated sets. In Proc. IEEE ICDE 2000, pp. 512-521.
14. J. Han et al. Mining frequent patterns without candidate generation. In Proc. ACM SIGMOD 2000, pp. 1-12.
15. B. Kao et al. Clustering uncertain data using Voronoi diagrams. In Proc. IEEE ICDM 2008, pp. 333-342.
16. 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.
17. 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.
18. C.K.-S. Leung and B. Hao. Mining of frequent itemsets from streams of uncertain data. In Proc. IEEE ICDE 2009, pp. 1663-1670.
19. 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.
20. C.K.-S. Leung and Q.I. Khan. Efficient mining of constrained frequent patterns from streams. In Proc. IDEAS 2006, pp. 61-68.
21. C.K.-S. Leung et al. A tree-based approach for frequent pattern mining from uncertain data. In Proc. PAKDD 2008, pp. 653-661.
22. C.K.-S. Leung et al. An effective multi-layer model for controlling the quality of data. In Proc. IDEAS 2007, pp. 28-36.
23. C.K.-S. Leung et al. CanTree: a tree structure for efficient incremental mining of frequent patterns. In Proc. IEEE ICDM 2005, pp. 274-281.
24. 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.
25. C.K.-S. Leung et al. WiFIsViz: effective visualization of frequent itemsets. In Proc. IEEE ICDM 2008, pp. 875-880.
26. B. Mozafari et al. Verifying and mining frequent patterns from large windows over data streams. In Proc. IEEE ICDE 2008, pp. 179-188.
27. R.T. Ng et al. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. ACM SIGMOD 1998, pp. 13-24.
28. J. Pei et al. Mining frequent itemsets with convertible constraints. In Proc. IEEE ICDE 2001, pp. 433-442.
29. S. Tsang et al. Decision trees for uncertain data. In Proc. IEEE ICDE 2009, pp. 441-444.
30. Q. Zhang et al. Finding frequent items in probabilistic data. In Proc. ACM SIGMOD 2008, pp. 819-832.