Inferring minimal rule covers from relations

  • Claudio Carpineto
  • Giovanni Romano
Machine Learning 2
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1321)

Abstract

An implication rule Q→R is roughly a statement of the form “form all objects in the database, if an object has Q then it has also R”.We introduce a definition of minimal cover for the set of implication rules that hold in a relation, by analogy with earlier work on functional dependencies, and present an approach to computing it. The core of the proposed approach is an algorithm for inferring a reduced cover containing only maximally general rules, i.e., such that no attribute-value pair on any left side i s redundant. We study the computational complexity of the proposed approach and present an experimental comparison with another method that confirms its validity, especially when the number of attributes in the database is limited.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AGRAWAL, R., and R. SRIKANT. 1994. Fast algorithms for mining association rules. In Proc. of the 20th VLDB Conference, Santiago, Chile, 487–499.Google Scholar
  2. CAI Y., N. CERCONE, and J., HAN. 1991. Learning in relational databases: an attribute-oriented approach. Computational Intelligence, 7: 119–132.Google Scholar
  3. CARPINETO C., and G. ROMANO. 1993. GALOIS: An order-theoretic approach to conceptual clustering. In Proc. of the Tenth International Conference on Machine Learning, Amherst, MA: Morgan Kauffmann, pp. 33–40.Google Scholar
  4. CARPINETO C., G. ROMANO, and P. d'ADAMO (submitted). Inferring dependencies from relations: a conceptual clustering approach. Submitted for publication.Google Scholar
  5. GODIN, R., and R. MISSAOUI. 1994. An incremental concept formation approach for learning from databases, Theoretical Computer Science: Special Issue on Formal Methods in Databases and Software Engineering, 133:387–419.Google Scholar
  6. GUIGES, J. L., and V. DUQUENNE. 1986. Famille nonredundantes d'implications informatives résultant d'un tableau de données binaires. Mathématique and Sciences Humaines, 95:5–18.Google Scholar
  7. MAIER, D. 1983. The theory of relational databases. Computer Science Press, Rockville, MD.Google Scholar
  8. MANNILA, H., and K. RÄHIÄ. 1994. Algorithms for inferring functional dependencies from relations. Data & Knowledge Engineering, 12(1):83–99.Google Scholar
  9. MICHALSKI, R. 1983. A theory and methodology of inductive learning. Artificial Intelligence, 20:111–161.Google Scholar
  10. PIATETSKY-SHAPIRO, J. 1991. Discovery, analysis and presentation of strong rules. In Knowledge Discovery in Databases. Edited by G. Piatetsky-Shapiro and W. Frawley. AAAI Press, 1991, pp. 229–248.Google Scholar
  11. QUINLAN, R. 1993. C4.5: programs for machine learning. Morgan Kaufmann, San Mateo, CA.Google Scholar
  12. SCHLIMMER, J. 1993. Efficiently inducing determinations: A complete and systematic search algorithm that uses optimal pruning. In Proc. of the.10th International Machine Learnig Conference, Amherst, MA, Morgan Kaufmann, pp.284–290.Google Scholar
  13. SHAN, N., W. ZIARKO, H. HAMILTON, and N. CERCONE. 1995. Using rough sets as tools for knowledge discovery. In Proc. of the First International Conference on Knowledge Discovery and Data Mining, Montreal, Canada, AAAI Press, pp. 263–268.Google Scholar
  14. TOIVONEN, H., M. KLEMETTINEN, P. RONKAINEN, K. HAETOENEN, and H. MANNILA. 1995. Pruning and grouping of discovered association rules. In Working Notes of the MLnet Workshop on Statistics, Machine Learning and Knowledge Discovery in Databases. Crete, Greece.Google Scholar
  15. ULLMAN, J. 1988. Principles of database and knowledge-base systems, Vol. I, Computer Science Press.Google Scholar
  16. ZIARKO, W., and N. SHAN. 1996. A method for computing all maximally general rules in attribute-value systems. Computational Intelligence, 12(2):223–234.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Claudio Carpineto
    • 1
  • Giovanni Romano
    • 1
  1. 1.Fondazione Ugo BordoniRomeItaly

Personalised recommendations