Advertisement

Representative association rules and minimum condition maximum consequence association rules

  • Marzena Kryszkiewicz
Posters
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1510)

Abstract

Discovering association rules (AR) among items in a large database is an important database mining problem. The number of association rules may be large. To alleviate this problem, we introduced in [1] a notion of representative association rules (RR. RR is a least set of rules that covers all association rules. The association rules, which are not representative ones, may be generated by means of a cover operator without accessing a database. On the other hand, a subset of association rules that allows to predict as much as possible from minimum facts is usually of interest to analysts. This kind of rules we will call minimum condition maximum consequence rules (MMR). In this paper, we investigate the relationship between RR and MMR. We prove that MMR is a subset of RR and it may be extracted from RR.

References

  1. 1.
    Kryszkiewicz, M.: Representative Association Rules. In: Proc. of PAKDD ’98. Melbourne, Australia. Lecture Notes in Artificial Intelligence 1394. Research and Development in Knowledge Discovery and Data Mining. Springer-Verlag (1998) 198–209Google Scholar
  2. 2.
    Agraval, R., Imielinski, T., Swami, A.: Mining Associations Rules between Sets of Items in Large Databases. In: Proc. of the ACM SIGMOD Conference on Management of Data. Washington, D.C. (1993) 207–216.Google Scholar
  3. 3.
    Srikant, R., Agraval, R.: Mining Generalized Association Rules. In: Proc. of the 21st VLDB Conference. Zurich, Swizerland (1995) 407–419Google Scholar
  4. 4.
    Meo, R., Psaila, G., Ceri, S.: A new SQL-like Operator for Mining Association Rules. In: Proc. of the 22nd VLDB Conference. Mumbai (Bombay), India (1996)Google Scholar
  5. 5.
    Communications of the ACM, November 1996, Vol. 39. No. 11. (1996)Google Scholar
  6. 6.
    Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.): Advances in Knowledge Discovery and Data Mining. AAAI, Menlo Park, California (1996)Google Scholar
  7. 7.
    Piatetsky-Shapiro, G.: Discovery, Analysis and Presentation of Strong Rules. In: Piatetsky-Shapiro, G., Frawley, W. (eds.): Knowledge Discovery in Databases. AAAI/MIT Press, Menlo Park, CA (1991) 229–248Google Scholar
  8. 8.
    Washio, T., Matsuura, H., Motoda, H., Mining Association Rules for Estimation and Prediction. In: Proc. of PAKDD ’98. Melbourne, Australia. Lecture Notes in Artificial Intelligence 1394. Research and Development in Knowledge Discovery and Data Mining. Springer-Verlag (1998) 417–419Google Scholar
  9. 9.
    Kryszkiewicz, M., Fast Discovery of Representative Association Rules. To appear in Proc. of RSCTC ’98. Rough Sets and Current Trends in Computing. Springer-Verlag. Warsaw, Poland (1998) 214–221Google Scholar
  10. 10.
    Agraval, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: [6] (1996) 307–328Google Scholar
  11. 11.
    Savasere, A, Omiecinski, E., Navathe, S.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: Proc. of the 21st VLDB Conference. Zurich, Swizerland (1995) 432–444Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Marzena Kryszkiewicz
    • 1
  1. 1.Institute of Computer ScienceWarsaw University of TechnologyWarsawPoland

Personalised recommendations