On closed constrained frequent pattern mining

Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

Volumn , Issue , 2004, Pages 35-42

  Bonchi, Francesco ^a   Lucchese, Claudio ^a  

^a ISTI CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ANTI-MONOTONE CONSTRAINTS; CARDINALITY; CONSTRAINT-BASED MINING; ITEMSETS;

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES; PROBLEM SOLVING; SEMANTICS; SET THEORY; TREES (MATHEMATICS);

DATA MINING;

EID: 19544376989     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2004.10093     Document Type: Conference Paper

References (20)

1. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In Proceedings ACM SIGMOD, 1993.
2. R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases. In Proceedings of the 20th VLDB, 1994.
3. R. J. Bayardo. Efficiently mining long patterns from databases. In Proceedings of ACM SIGMOD, 1998.
4. F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi. Adaptive Constraint Pushing in frequent pattern mining. In Proceedings of 7th PKDD, 2003.
5. F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi. ExAMiner: Optimized level-wise frequent pattern mining with monotone constraints. In Proc. of ICDM, 2003.
6. F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi. Exante: Anticipated data reduction in constrained pattern mining. In Proceedings of the 7th PKDD, 2003.
7. F. Bonchi and B. Goethals. FP-Bonsai: the art of growing and pruning small fp-trees. In Proc. of the Eighth PAKDD, 2004.
8. J. Boulicaut and B. Jeudy. Mining free itemsets under constraints. In International Database Engineering and Applications Symposium (IDEAS), 2001.
9. C. Bucila, J. Gehrke, D. Kifer, and W. White. DualMiner: A dual-pruning algorithm for itemsets with constraints. In Proc. of the 8th ACM SIGKDD, 2002.
10. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of ACM SIGMOD, 2000.
11. L.Jia, R. Pei, and D. Pei. Tough constraint-based frequent closed itemsets mining. In Proc. of the ACM Symposium on Applied computing, 2003.
12. H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations: Extended abstract. In Proceedings of the 2th ACM KDD, page 189, 1996.
13. R. T. Ng, L. V. S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. of SIGMOD, 1998.
14. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proceedings of 7th ICDT, 1999.
15. J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent item sets with convertible constraints. In (ICDE'01), pages 433-442, 2001.
16. J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000.
17. J. Pei, J. Han, and J. Wang. Closet+: Searching for the best strategies for mining frequent closed itemsets. In SIGKDD '03, August 2003.
18. L. D. Raedt and S. Kramer. The levelwise version space algorithm and its application to molecular fragment finding. In Proc. IJCAI, 2001.
19. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In Proceedings ACM SIGKDD, 1997.
20. M. J. Zaki and C.-J. Hsiao. Charm: An efficient algorithm for closed itemsets mining. In 2nd SIAM International Conference on Data Mining, April 2002.