Skip to main content
Springer Nature Link
Log in

Inducing Theory for the Rule Set

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2005))

Included in the following conference series:

  • 5104 Accesses

Abstract

An important data mining problem is to restrict the number of association rules to those that are novel, interesting, useful. However, there are situations when a user is not allowed to access the database and can deal only with the rules provided by somebody else. The number of rules can be limited e.g. for security reasons or the rules are of low quality. Still, the user hopes to find new interesting relationships. In this paper we propose how to induce as much knowledge as possible from the provided set of rules. The algorithms for inducing theory as well as for computing maximal covering rules for the theory are provided. In addition, we show how to test the consistency of rules and how to extract aconsistent subset of rules.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, 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 

  2. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. In: Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R. (eds.): Advances in Knowledge Discovery and Data Mining. AAAI, Menlo Park, California (1996) 307–328

    Google Scholar 

  3. Kryszkiewicz, M.: Representative Association Rules. In: Proc. of PAKDD '98. Melbourne, Australia. LNAI1394. Springer-Verlag (1998) 198–209

    Google Scholar 

  4. Kryszkiewicz, M.: Fast Discovery of Representative Association Rules. In: Proc. of RSCTC '98. Warsaw, Poland. LNAI 1424. Springer-Verlag (1998) 214–221

    Google Scholar 

  5. Kryszkiewicz, M.: Mining with Cover and Extension Operators. In: Proc. of PKDD'00. Lyon, France. To appear as a Springer-Verlag LNAI volume

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665, Warsaw, Poland

    Marzena Kryszkiewicz

Authors
  1. Marzena Kryszkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Regina Regina, S4S 0A2, Saskatchewan, Canada

    Wojciech Ziarko  & Yiyu Yao  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kryszkiewicz, M. (2001). Inducing Theory for the Rule Set. In: Ziarko, W., Yao, Y. (eds) Rough Sets and Current Trends in Computing. RSCTC 2000. Lecture Notes in Computer Science(), vol 2005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45554-X_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-45554-X_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43074-2

  • Online ISBN: 978-3-540-45554-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics