Extraction of Coverings as Monotone DNF Formulas

  • Kouichi Hirata
  • Ryosuke Nagazumi
  • Masateru Harao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2843)


In this paper, we extend monotone monomials as large itemsets in association rule mining to monotone DNF formulas. First, we introduce not only the minimum support but also the maximum overlap, which is a new measure how much all pairs of two monomials in a monotone DNF formula commonly cover data. Next, we design the algorithm dnf_cover to extract coverings as monotone DNF formulas satisfying both the minimum support and the maximum overlap. In the algorithm dnf_cover, first we collect the monomials of which support value is not only more than the minimum support but also less than the minimum support as seeds. Secondly we construct the coverings as monotone DNF formulas, by combining monomials in seeds under the minimum support and the maximum overlap. Finally, we apply the algorithm dnf_cover to bacterial culture data.


Association Rule Minimum Support Association Rule Mining Transaction Database Large Itemsets 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adamo, J.-M.: Data mining for association rules and sequential patterns: Sequential and parallel algorithms. Springer, Heidelberg (2001)zbMATHCrossRefGoogle Scholar
  2. 2.
    Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: [7], pp. 307–328Google Scholar
  3. 3.
    Agrawal, R., Srikant, R.: algorithms for mining association rules in large databases. In: Proc. of 20th VLDB, pp. 487–499 (1994)Google Scholar
  4. 4.
    Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)Google Scholar
  5. 5.
    Arimura, H., Shinohara, T., Otsuki, S.: Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 649–660. Springer, Heidelberg (1994)Google Scholar
  6. 6.
    Džeroski, S., Lavrač, N. (eds.): Relational data mining. Springer, Heidelberg (2001)zbMATHGoogle Scholar
  7. 7.
    Fayyed, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.): Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press (1996)Google Scholar
  8. 8.
    Matsuoka, K., Fukunami, M., Yokoyama, S., Ichiyama, S., Harao, M., Yamakawa, T., Tsumoto, S., Sugawara, K.: Study on the relationship of patients’ diseases and the occurrence of Anaerobes by using data mining techniques. In: Proc. International Congress of the Confederation of Anaerobes Societies, vol. 186, pp. (1Xa-P2) (2000)Google Scholar
  9. 9.
    Suzuki, E.: Mining bacterial test data with scheduled discovery of exception rules. In: [10], pp. 34–40Google Scholar
  10. 10.
    Suzuki, E. (ed.): Proc. International Workshop of KDD Challenge on Real-World Data (KDD Challenge 2000) (2000)Google Scholar
  11. 11.
    Tsumoto, S.: Guide to the bacteriological examination data set. In: [10], pp. 8–12, Also available at
  12. 12.
    Zhang, C., Zhang, S.: Association Rule Mining. LNCS (LNAI), vol. 2307, p. 25. Springer, Heidelberg (2002)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Kouichi Hirata
    • 1
  • Ryosuke Nagazumi
    • 2
  • Masateru Harao
    • 1
  1. 1.Department of Artificial Intelligence 
  2. 2.Graduate School of Computer Science and Systems EngineeringKyushu Institute of TechnologyIizukaJapan

Personalised recommendations