Mining uncertain data for frequent itemsets that satisfy aggregate constraints

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2010, Pages 1034-1038

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

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

aggregate functions; constraints; data mining; frequent patterns; probabilistic databases

Indexed keywords

AGGREGATE CONSTRAINT; AGGREGATE FUNCTION; AGGREGATE FUNCTIONS; CANDIDATE GENERATION; FREQUENT ITEMSETS; FREQUENT PATTERNS; MINING PROCESS; PROBABILISTIC DATABASE; TRANSACTION DATABASE; TREE-BASED ALGORITHMS; UNCERTAIN DATAS; USER CONSTRAINTS; USER INTERESTS;

AGGREGATES; ALGORITHMS; DATA MINING; DATABASE SYSTEMS; MINING;

TREES (MATHEMATICS);

EID: 77954748923     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1774088.1774305     Document Type: Conference Paper

References (29)

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. 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.
6. T. Bernecker et al. Probabilistic frequent itemset mining in uncertain databases. In Proc. KDD 2009, pp. 119-127.
7. S. Brin et al. Beyond market baskets: generalizing association rules to correlations. In Proc. ACM SIGMOD 1997, pp. 265-276.
8. T. Calders et al. Mining itemsets in the presence of missing values. In Proc. ACM SAC 2007, pp. 404-408.
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 et al. Mining frequent itemsets from uncertain data. In Proc. PAKDD 2007, pp. 47-58.
11. X. Dai et al. Probabilistic spatial queries on existentially uncertain data. In Proc. SSTD 2005, pp. 400-417.
12. N. Dexters et al. A probability analysis for candidate-based frequent itemset algorithms. In Proc. ACM SAC 2006, pp. 541-545.
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. C. Hébert et al. Optimizing hypergraph transversal computation with an anti-monotone constraint. In Proc. ACM SAC 2007, pp. 443-444.
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. LaRosa et al. Frequent pattern mining for kernel trace data. In Proc. ACM SAC 2008, pp. 880-885.
18. L. Leonardi et al. Frequent spatio-temporal patterns in trajectory data warehouses. In Proc. ACM SAC 2009, pp. 1433-1440.
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 D.A. Brajczuk. Mining uncertain data for constrained frequent sets. In Proc. IDEAS 2009, pp. 109-120.
21. C.K.-S. Leung and B. Hao. Mining of frequent itemsets from streams of uncertain data. In Proc. IEEE ICDE 2009, pp. 1663-1670.
22. C.K.-S. Leung et al. A tree-based approach for frequent pattern mining from uncertain data. In Proc. PAKDD 2008, pp. 653-661.
23. W. Lian et al. Maintenance of maximal frequent itemsets in large databases. In Proc. ACM SAC 2007, pp. 388-392.
24. I. Mitasiunaite and J.-F. Boulicaut. Looking for monotonicity properties of a similarity constraint on sequences. In Proc. ACM SAC 2006, pp. 546-552.
25. R.T. Ng et al. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. ACM SIGMOD 1998, pp. 13-24.
26. J. Pei et al. Mining frequent itemsets with convertible constraints. In Proc. IEEE ICDE 2001, pp. 433-442.
27. S. Tsang et al. Decision trees for uncertain data. In Proc. IEEE ICDE 2009, pp. 441-444.
28. J.-J. Zeng et al. Mining fault-tolerant frequent patterns efficiently with powerful pruning. In Proc. ACM SAC 2008, pp. 927-931.
29. Q. Zhang et al. Finding frequent items in probabilistic data. In Proc. ACM SIGMOD 2008, pp. 819-832.