Skip to main content
SpringerLink
Log in
Book cover

International Conference on Formal Concept Analysis

ICFCA 2005: Formal Concept Analysis pp 162–175Cite as

Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis

  • Conference paper

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

Abstract

Functional dependencies, a notion originated in Relational Database Theory, are known to admit interesting characterizations in terms of Formal Concept Analysis. In database terms, two successive, natural extensions of the notion of functional dependency are the so-called degenerate multivalued dependencies, and multivalued dependencies proper. We propose here a new Galois connection, based on any given relation, which gives rise to a formal concept lattice corresponding precisely to the degenerate multivalued dependencies that hold in the relation given. The general form of the construction departs significantly from the most usual way of handling functional dependencies. Then, we extend our approach so as to extract Armstrong relations for the degenerate multivalued dependencies from the concept lattice obtained; the proof of the correctness of this construction is nontrivial.

This work is supported in part by MCYT TIC 2002-04019-C03-01 (MOISES) and by the PASCAL-NETWORK Project.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baixeries, J.: A Formal Concept Analysis Framework to Model Functional Dependencies. Mathematical Methods for Learning (2004)

    Google Scholar 

  2. Baixeries, J., Balcázar, J.L.: Using Concept Lattices to Model Multivalued Dependencies

    Google Scholar 

  3. Balcázar, J.L., Baixeries, J.: Discrete Deterministic Data Mining as Knowledge Compilation. In: Workshop on Discrete Mathematics and Data Mining in SIAM International Conference on Data Mining (2003)

    Google Scholar 

  4. Balcázar, J.L., Baixeries, J.: Characterization of Multivalued Dependencies and Related Expressions Discovery Science (2004)

    Google Scholar 

  5. Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining Minimal Non-Redundant Association Rules using Closed Itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 972–986. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining Frequent Patterns with Counting Inference. SIGKDD Explorations 2(2), 66–75 (2000)

    Article  Google Scholar 

  7. Beeri, C.: On the Membership Problem for Functional and Multivalued Dependencies in Relational Databases. ACM Trans. Database Syst. 5(3), 241–259 (1980)

    Article  MATH  Google Scholar 

  8. Birkhoff, G.: Lattice Theory, 1st edn., vol. 25. Amer. Math. Soc. Coll. Publ., Providence (1973)

    Google Scholar 

  9. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (1990-2002)

    MATH  Google Scholar 

  10. Elmasri, R., Navathe, S.B.: Fundamentals of Database Systems, 2nd edn. Benjamin/Cummings (1994)

    Google Scholar 

  11. Fagin, R.: Functional dependencies in a relational database and propositional logic. IBM J. Research and Development 21(6), 534–544 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  12. Fagin, R.: Multivalued dependencies and a new normal form for relational databases. ACM Trans. on Database Systems 2(3), 262–278 (1977)

    Article  MathSciNet  Google Scholar 

  13. Fagin, R.: Armstrong databases. Invited paper. In: Proc. 7th IBM Symposium on Mathematical Foundations of Computer Science, Kanagawa, Japan (May 1982)

    Google Scholar 

  14. Fagin, R., Beeri, C., Howard, J.H.: A complete axiomatization for functional and multivalued dependencies in database relations. In: Smith, D.C.P. (ed.) Proc. 1977 ACM SIGMOD Symposium, Toronto, pp. 47–61 (1977)

    Google Scholar 

  15. Fagin, R., Sagiv, Y., Delobel, D., Stott Parker, D.: An equivalence between relational database dependencies and a fragment of propositional logic. Jr. J. ACM 28(3), 435–453 (July 1981); Corrigendum: J. ACM 34(4), 1016–1018 (October 1987)

    Google Scholar 

  16. Fagin, R., Vardi, Y.V.: The theory of data dependencies: a survey. In: Mathematics of Information Processing, Proceedings of Symposia in Applied Mathematics, AMS, vol. 34, pp. 19–72 (1986)

    Google Scholar 

  17. Flach, P., Savnik, I.: Database dependency discovery: a machine learning approach. AI Communications 12(3), 139–160 (1999)

    MathSciNet  Google Scholar 

  18. Flach, P., Savnik, I.: Discovery of multivalued dependencies from relations. Intelligent Data Analysis 4(3,4), 195–211 (2000)

    MATH  Google Scholar 

  19. Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  20. Godin, R., Missaoui, R.: 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 

  21. Huhtala, Y., Karkkainen, J., Porkka, P., Toivonen, H.: TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. The Computer Journal 42(2), 100–111 (1999)

    Article  MATH  Google Scholar 

  22. Kivinen, J., Mannila, H.: Approximate inference of functional dependencies from relations. Theoretical Computer Science 149(1), 129–149 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  23. Liquiere, M., Sallantin, J.: Structural machine learning with Galois lattice and Graphs. In: International Conference in Machine Learning, ICML 1998 (1998)

    Google Scholar 

  24. Lopes, S., Petit, J.-M., Lakhal, L.: Efficient Discovery of Functional Dependencies and Armstrong Relations. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, p. 350. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  25. Lopes, S., Petit, J.-M., Lakhal, L.: Functional and approximate dependency mining: database and FCA points of view. In: Special issue of Journal of Experimental and Theoretical Artificial Intelligence (JETAI) on Concept Lattices for KDD, vol. 14(2-3), pp. 93–114. Taylor and Francis, Abington (2002)

    Google Scholar 

  26. Pfaltz, J.L.: Transformations of Concept Graphs: An Approach to Empirical Induction. In: 2nd International Workshop on Graph Transformation and Visual Modeling Techniques. GTVM 2001, Satellite Workshop of ICALP 2001, Crete, Greece, July 2001, pp. 320–326 (2001)

    Google Scholar 

  27. Pfaltz, J.L., Taylor, C.M.: Scientific Discovery through Iterative Transformations of Concept Lattices. In: Workshop on Discrete Mathematics and Data Mining at 2nd SIAM Conference on Data Mining, Arlington, April 2002, pp. 65–74 (2002)

    Google Scholar 

  28. Sagiv, Y.: An algorithm for inferring multivalued dependencies with an application to propositional logic. Journal of the ACM 27(2), 250–262 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  29. Savnik, I., Flach, P.: Bottom-up Induction of Functional Dependencies from Relations. In: Proc. of AAAI 1993 Workshop: Knowledge Discovery in Databases (1993)

    Google Scholar 

  30. Ullman, J.D.: Principles of Database and Knowledge-Base Systems. Computer Science Press, Inc., Rockville (1988)

    Google Scholar 

  31. Zaniolo, C., Melkanoff, M.A.: On the Design of Relational Database Schemata. TODS 6(1), 1–47 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, c/ Jordi Girona, 1-3, 08034, Barcelona

    Jaume Baixeries & José Luis Balcázar

Authors
  1. Jaume Baixeries
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Luis Balcázar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Algebra, University of Technology, Dresden, Germany

    Bernhard Ganter

  2. Département d’informatique, UQAM, P.O. Box, Montréal, (Qc), Canada

    Robert Godin

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baixeries, J., Balcázar, J.L. (2005). Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis. In: Ganter, B., Godin, R. (eds) Formal Concept Analysis. ICFCA 2005. Lecture Notes in Computer Science(), vol 3403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32262-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-32262-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24525-4

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation