Skip to main content
SpringerLink
Log in

Formal Concept Analysis Constrained by Attribute-Dependency Formulas

  • Conference paper
Formal Concept Analysis (ICFCA 2005)

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

Included in the following conference series:

Abstract

An important topic in formal concept analysis is to cope with a possibly large number of formal concepts extracted from formal context (input data). We propose a method to reduce the number of extracted formal concepts by means of constraints expressed by particular formulas (attribute-dependency formulas, ADF). ADF represent a form of dependencies specified by a user expressing relative importance of attributes. ADF are considered as additional input accompanying the formal context 〈X, Y, I〉. The reduction consists in considering formal concepts which are compatible with a given set of ADF and leaving out noncompatible concepts. We present basic properties related to ADF, an algorithm for generating the reduced set of formal concepts, and demonstrating examples.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bělohlávek, R., Sklenář, V., Zacpal, J.: Formal concept analysis with hierarchically ordered attributes. Int. J. General Systems 33(4), 283–294 (2004)

    Google Scholar 

  2. Bělohlávek, R., Sklenář, V., Zacpal, J.: Concept lattices constrained by equivalence relations. In: Proc. CLA 2004, Ostrava, Czech Republic, pp. 58–66 (2004)

    Google Scholar 

  3. Bock, H.H.: Automatische Klassifikation. Vandenhoeck & Ruprecht, Göttingen (1974)

    MATH  Google Scholar 

  4. Diognon, J.-P., Falmagne, J.-C.: Knowledge Spaces. Springer, Berlin (1999)

    Google Scholar 

  5. Everitt, B.S.: Cluster Analysis, Arnold, E. (ed.) 4th edn. (2001)

    Google Scholar 

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

    MATH  Google Scholar 

  7. Ganter, W.: Contextual attribute logic. In: Tepfenhart, W., Cyre, W. (eds.) Proceedings of ICCS 2001. Springer, Heidelberg (2001)

    Google Scholar 

  8. Godin, R., Missaoui, R., Alaoui, H.: Incremental concept formation algorithms based on Galois (concept) lattices. Computational Intelligence 11(2), 246–267 (1995)

    Article  Google Scholar 

  9. Kent, R.E.: Rough concept analysis. In: Ziarko, W.P. (ed.) Rough Sets, Fuzzy Sets, and Knowledge Discovery. Proc. of the Intern. Workshop RSKD 1993. Springer, London (1994)

    Google Scholar 

  10. Maier, D.: The Theory of Relational Databases. Computer Science Press, Rockville (1983)

    MATH  Google Scholar 

  11. Van der Merwe, F.J., Obiedkov, S., Kourie, D.G.: AddIntent: A new incremental lattice construction algorithm. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 372–385. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Ore, O.: Galois connections. Trans. Amer. Math. Soc. 55, 493–513 (1944)

    MATH  MathSciNet  Google Scholar 

  13. Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  14. Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. Reidel, Dordrecht (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Computer Science, Palacký University, Tomkova 40, CZ-779 00, Olomouc, Czech Republic

    Radim Bělohlávek & Vladimír Sklenář

Authors
  1. Radim Bělohlávek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimír Sklenář
    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

Bělohlávek, R., Sklenář, V. (2005). Formal Concept Analysis Constrained by Attribute-Dependency Formulas. 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_12

Download citation

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

  • 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