Extracting Minimal and Closed Monotone DNF Formulas

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3245, Issue , 2004, Pages 298-305

  Shima, Yoshikazu ^a   Mitsuishi, Shinji ^b   Hirata, Kouichi ^a   Harao, Masateru ^c  

^a Kyushu Institute of Technology   (Japan)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

^c OBIC Co Ltd   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BACTERIAL CULTURES; CLOSED ITEMSETS; DNF FORMULAS;

ALGORITHMS;

EID: 35048854672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30214-8_24     Document Type: Article

References (10)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, A. I. Verkamo: Fast discovery of association rules, in U. M. Fayyed, G. Piatetsky-Shapiro, P. Smyth, R. Uthurusamy (eds.): Advances in Knowledge Discovery and Data Mining, AAAI/MIT Press, 307-328, 1996.
2. R. Agrawal, R. Srikant: Fast algorithms for mining association rules in large databases, Proc. of 20th VLDB, 487-499, 1994.
3. D. Burdick, M. Calimlim, J. Gehrke, MAFIA: A maximal frequent itemset algorithm for transaction databases, Proc. 17th International Conference on Data Engineering, 443-452, 2001.
4. K. Hirata, R. Nagazumi, M. Harao: Extraction of Coverings as Monotone DNF Formulas, Proc. 6th International Conference on Discovery Science, LNCS 2843, 165-178, 2003.
5. N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal: Discovering frequent closed itemsets for association rules, Proc. 7th International Conference on Database Theory, LNCS 1540, 398-416, 1999.
6. E. Suzuki: Mining bacterial test data with scheduled discovery of exception rules, in [7], 34-40.
7. E. Suzuki (ed.): Proc. International Workshop of KDD Challenge on Real-World Data (KDD Challenge 2000), 2000.
8. S. Tsumoto: Guide to the bacteriological examination data set, in [7], 8-12.
9. T. Uno, T. Asai, Y. Uchida, H. Arimura: LCM: An efficient algorithms for enumerating frequent closed item sets, Proc. Workshop on Frequent Itemset Mining Implementation, 2003.
10. M. J. Zaki, C.-J. Hsiao: CHARM: An efficient algorithm for closed itemset mining, Proc. 2nd SIAM International Symposium on Data Mining, 457-478, 2002.