A constrained frequent pattern mining system for handling aggregate constraints

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 14-23

  Leung, Carson Kai Sang ^a   Jiang, Fan ^a   Sun, Lijing ^a   Wang, Yan ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Aggregate functions; Data mining; Frequent patterns; Monotonicity; Pattern discovery; User constraint

Indexed keywords

AGGREGATE FUNCTION; FREQUENT PATTERNS; MONOTONICITY; PATTERN DISCOVERY; USER CONSTRAINTS;

ALGORITHMS; DATA MINING; DATABASE SYSTEMS; MINING MACHINERY;

AGGREGATES;

EID: 84866626711     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2351476.2351479     Document Type: Conference Paper

References (33)

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. R. Anand and C.K. Reddy. Constrained logistic regression for discriminative pattern mining. In Proc. ECML PKDD 2011, Part I, pp. 92-107.
4. R.J. Bayardo Jr., R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. Data Mining and Knowledge Discovery, 4(2-3), July 2000, pp. 217-240.
5. F. Bonchi and C. Lucchese. Pushing tougher constraints in frequent pattern mining. In Proc. PAKDD 2005, pp. 114-124.
6. F. Bonchi and C. Lucchese. Extending the state-of-the-art of constraint-based pattern discovery. DKE, 60(2), Feb. 2007, pp. 377-399.
7. J.-F. Boulicaut and B. Jeudy. Mining free itemsets under constraints. In Proc. IDEAS 2001, pp. 322-329.
8. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: generalizing association rules to correlation. In Proc. SIGMOD 1997, pp. 265-276.
9. C. Bucila, J. Gehrke, D. Kifer, and W.M. White. DualMiner: a dual-pruning algorithm for itemsets with constraints. In Proc. KDD 2002, pp. 42-51.
10. J.J. Cameron, C.K.-S. Leung, and S.K. Tanbeer. Finding strong groups of friends among friends in social networks. In Proc. IEEE DASC/SCA 2011, pp. 824-831.
11. L. Cerf, J. Besson, C. Robardet, and J.-F. Boulicaut. Data peeler: Constraint-based closed pattern mining in n-ary relations. In Proc. SDM 2008, pp. 37-48.
12. C.-J. Chu, V.S. Tseng, and T. Liang. An efficient algorithm for mining high utility itemsets with negative item values in large databases. J. AMC, 215(2), Sept. 2009, pp. 767-778.
13. E. Desmier, F. Flouvat, D. Gay, and N. Selmaoui-Folcher. A clustering-based visualization of colocation patterns. In Proc. IDEAS 2011, pp. 70-78.
14. L. De Raedt, T. Guns, and S. Nijssen. Constraint programming for itemset mining. In Proc. ACM KDD 2008, pp. 204-212.
15. G. Dong and J. Bailey. Contrast Data Mining: Concepts, Algorithms, and Applications. Chapman & Hall/CRC, 2012.
16. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1), Jan. 2004, pp. 53-87.
17. S. Kim, M. Barsky, and J. Han. Efficient mining of top correlated patterns based on null-invariant measures. In Proc. ECML PKDD 2011, Part II, pp. 177-192.
18. 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.
19. C.K.-S. Leung. Frequent itemset mining with constraints. Encyclopedia of Database Systems, 2009, pp. 1179-1183.
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, C.L. Carmichael, and E.W. Teh. Visual analytics of social networks: mining and visualizing co-authorship networks. In Proc. HCII/FAC 2011, pp. 335-345.
22. C.K.-S. Leung, B. Hao, and D.A. Brajczuk. uCFS2: an enhanced system that mines uncertain data for constrained frequent sets. In Proc. IDEAS 2010, pp. 32-37.
23. C.K.-S. Leung and F. Jiang. RadialViz: an orientation-free frequent pattern visualizer. In Proc. PAKDD 2012, Part II, pp. 322-334.
24. C.K.-S. Leung and L. Sun. A new class of constraints for constrained frequent pattern mining. In Proc. ACM SAC 2012, pp. 199-204.
25. C.K.-S. Leung and S.K. Tanbeer. Fast tree-based mining of frequent itemsets from uncertain data. In Proc. DASFAA 2012, Part I, pp. 272-287.
26. C.K.-S. Leung and S.K. Tanbeer. Mining popular patterns from transactional databases. In Proc. DaWaK 2012, pp. 291-302.
27. E.Y. Liu, Z. Zhang, and W. Wang. Clustering with relative constraints. In Proc. ACM KDD 2011, pp. 947-955.
28. R.T. Ng, L.V.S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. ACM SIGMOD 1998, pp. 13-24.
29. J. Pei, J. Han, and L.V.S. Lakshmanan. Pushing convertible constraints in frequent itemset mining. Data Mining and Knowledge Discovery, 8(3), May 2004, pp. 227-252.
30. J. Schmidt, E.M. Brändle, and S. Kramer. Clustering with attribute-level constraints. In Proc. IEEE ICDM 2011, pp. 1206-1211.
31. A. Soulet and B. Crémilleux. An efficient framework for mining flexible constraints. In Proc. PAKDD 2005, pp. 661-671.
32. Y. Tabei, D. Okanohara, S. Hirose, and K. Tsuda. LGM: mining frequent subgraphs from linear graphs. In Proc. PAKDD 2011, Part II, pp. 26-37.
33. G. Wang and Q. Song. Selecting feature subset via constraint association rules. In Proc. PAKDD 2012, Part II, pp. 304-321.