Bifold constraint-based mining by simultaneous monotone and anti-monotone checking

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2005, Pages 146-153

  El Hajj, Mohammad ^a   Zaïane, Osmar R ^a   Nalos, Paul ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATABASE SYSTEMS; PATTERN MATCHING;

ANTI-MONOTONE CHECKING; DUALMINER; POST-PROCESSING PHASE;

DATA MINING;

EID: 34548547041     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2005.35     Document Type: Conference Paper

References (17)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data, pages 207-216, Washington, D.C., May 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases, pages 487-499, Santiago, Chile, September 1994.
3. I. Almaden. Quest synthetic data generation code. http://www.almaden.ibm. com/software/quest/Resources/index.shtm
4. F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi. Examiner: Optimized level-wise frequent pattern mining with monotone constraints. In IEEE ICDM, Melbourne, Florida, November 2004.
5. F. Bonchi and B. Goethals. Fp-bonsai: the art of growing and pruning small fp-trees. In Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'04), pages 155-160, 2004.
6. F. Bonchi and C. Lucchese. On closed constrained frequent pattern mining. In IEEE International Conference on Data Mining (ICDM'04), Brighton, UK, November 2004.
7. C. Bucila, J. Gehrke, D. Kifer, and W. White. Dualminer: A dual-pruning algorithm for itemsets with constraints. In Eight ACM SIGKDD Internationa Conf. on Knowledge Discovery and Data Mining, pages 42-51, Edmonton, Alberta, August 2002.
8. D. Burdick, M. Calimlim, and J. Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. In ICDE, pages 443-452, 2001.
9. S. Chaudhuri. Data mining and database systems: Where is the intersection? Bulletin of the Technical Committee on Data Engineering, 21, March 1998.
10. M. El-Hajj and O. R. Zaïane. Non recursive generation of frequent k-itemsets from frequent pattern tree representations. In Proc. of 5th International Conference on Data Warehousing and Knowledge Discovery (DaWak'2003), September 2003.
11. Frequent itemset mining implementations repository. http://fimi.cs. helsinki.fi/.
12. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In ACM-SIGMOD, Dallas, 2000.
13. L. Lakshmanan, R. Ng, J. Han, and A. Pang. Optimization of constrained frequent set queries with 2-variable constraints. In ACM SIGMOD Conference on Management of Data, pages 157-168, 1999.
14. J. Pie and J. Han. Can we push more constraints into frequent pattern mining? In ACM SIGKDD Conference, pages 350-354, 2000.
15. J. Pie, J. Han, and L. Lakshmanan. Mining frequent itemsets with convertible constraints. In IEEE ICDE Conference, pages 433-442, 2001.
16. R. M. Ting, J. Bailey, and K. Ramamohanarao. Paradualminer: An efficient parallel implementation of the dualminer algorithm. In Eight Pacific-Asia Conference, PAKDD 2004, pages 96-105, Sydney, Australia, May 2004.
17. O. R. Zaïane and M. El-Hajj. Pattern Lattice Traversal by Selective Jumps. In In Proc. 2005 Int'l Conf. on Data Mining and Knowledge Discovery (ACM SIGKDD), Chicago, IL, USA., pages 729-735, August 2005.