A new class of constraints for constrained frequent pattern mining

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2012, Pages 199-204

  Leung, Carson Kai Sang ^a   Sun, Lijing ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

aggregate functions; constraints; data mining; frequent itemset mining; monotonicity; numerical attributes

Indexed keywords

AGGREGATE FUNCTION; CONSTRAINTS; FREQUENT ITEMSET MINING; MONOTONICITY; NUMERICAL ATTRIBUTES;

ALGORITHMS;

DATA MINING;

EID: 84863567189     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2245276.2245314     Document Type: Conference Paper

References (17)

1. R. Agrawal & R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB 1994, pp. 487-499.
2. R. Agrawal et al. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD 1993, pp. 207-216.
3. F. Bonchi & C. Lucchese. Extending the state-of-the-art of constraint-based pattern discovery. DKE, 60(2): 377-399. 2007. (Pubitemid 46096638)
4. F. Bonchi & C. Lucchese. Pushing tougher constraints in frequent pattern mining. In Proc. PAKDD 2005, pp. 114-124.
5. S. Brin et al. Beyond market baskets: generalizing association rules to correlation. In Proc. SIGMOD 1997, pp. 265-276.
6. C. Bucila et al. DualMiner: a dual-pruning algorithm for itemsets with constraints. In Proc. KDD 2002, pp. 42-51.
7. L. Cerf et al. Data peeler: Constraint-based closed pattern mining in n-ary relations. In Proc. SDM 2008, pp. 37-48.
8. C.-J. Chu et al. An efficient algorithm for mining high utility itemsets with negative item values in large databases. J. AMC, 215(2): 767-778. 2009.
9. L.V.S. Lakshmanan, C.K.-S. Leung, & R. Ng. Efficient dynamic mining of constrained frequent sets. ACM TODS, 28(4): 337-389. 2003.
10. C.K.-S. Leung. Frequent itemset mining with constraints. Encyclopedia of Database Systems, 2009, pp. 1179-1183.
11. C.K.-S. Leung & F. Jiang. Frequent itemset mining of uncertain data streams using the damped window model. In Proc. ACM SAC 2011, pp. 950-955.
12. C.K.-S. Leung & L. Sun. Equivalence class transformation based mining of frequent itemsets from uncertain data. In Proc. ACM SAC 2011, pp. 983-984.
13. C.K.-S. Leung et al. Exploiting succinct constraints using FP-trees. ACM SIGKDD Explorations, 4(1): 40-49. 2002.
14. C.K.-S. Leung et al. Mining uncertain data for frequent itemsets that satisfy aggregate constraints. In Proc. ACM SAC 2010, pp. 1034-1038.
15. R.T. Ng et al. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. ACM SIGMOD 1998, pp. 13-24.
16. J. Pei et al. Pushing convertible constraints in frequent itemset mining. Data Mining and Knowledge Discovery, 8(3): 227-252. 2004. (Pubitemid 39019962)
17. A. Soulet & B. Crémilleux. An efficient framework for mining flexible constraints. In Proc. PAKDD 2005, pp. 661-671.