Inferring minimal rule covers from relations

  • Claudio Carpineto
  • Giovanni Romano
Machine Learning 2

DOI: 10.1007/3-540-63576-9_104

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1321)
Cite this paper as:
Carpineto C., Romano G. (1997) Inferring minimal rule covers from relations. In: Lenzerini M. (eds) AI*IA 97: Advances in Artificial Intelligence. AI*IA 1997. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence), vol 1321. Springer, Berlin, Heidelberg

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.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

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

Personalised recommendations