Skip to main content

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

Included in the following conference series:

Abstract

Formal Concept Analysis is an algebraic model based on a Galois connection that is used for symbolic knowledge exploration from an elementary form of the representation of data (“formal context”). The aim of this paper is to design the theoretical models required for the extension of Formal Concept Analysis to any kind of lattice-structured set of properties (“generalized formal concept”), and especially the case of predicates. Beyond their theoretical interest, the models aim at better solving real applied problems thanks to an improvement of the knowledge representation skills.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Arnaud, A., Nicole, P.: La logique ou I’art de penser. Gallimard, Paris (1992) (in French) (original publication 1662 )

    Google Scholar 

  2. Barbut, M., Monjardet, B.: Ordre et classification: Algébre et combinatoire. Collection Hachette Université. Hachette, Paris (1970) (in French)

    Google Scholar 

  3. Birkhoff, G.: Lattice Theory. ACM, New York (1940)

    Google Scholar 

  4. Boyer, M., Chaudron, L.: Airport noise/annoyance analysis. In: ICAS Congress. Intl. Coouncil for the Aeronautical Sciences, August 27 - September 1 (2000)

    Google Scholar 

  5. Burmeister, P.: Programm zur Formalen Begriffsanalyse einwertiger Kontexte. TH Darmstadt (1987)

    Google Scholar 

  6. Carpineto, C., Romano, G.: A lattice conceptual clustering system and its application to browsing retrievial. Machine Learning 24, 95–122 (1996)

    Google Scholar 

  7. Chaudron, L., Cossart, C., Maille, N., Tessier, C.: A purely symbolic model for dynamic scene interpretation. International Journal on Artificial Intelligence Tools 6(4), 635–664 (1997)

    Article  Google Scholar 

  8. Chaudron, L., Maille, N.: Le modéle des cubes: représentation algébrique des conjonctions de propriétés. Technical Report 1/7601.43 DCSD-T, Onera (1999)

    Google Scholar 

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

    MATH  Google Scholar 

  10. Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical foundations. Springer, Heidelberg (1999) Isbn 3-540-62771-5

    MATH  Google Scholar 

  11. Guigues, J.-L., Duquenne, V.: Familles minimales d’implications informatives résultant d’un tableau de données binaires. Math. Sci. Hum. 95, 5–18 (1986)

    Google Scholar 

  12. Huet, G.P.: Résolution d’équations dans des langages d’ordre 1,2,.... PhD thesis, Université de Paris VII, Thése d’État (1976) (in French)

    Google Scholar 

  13. Ichino, M., Yaguchi, H.: Data Science, Classification and related Methods, chapter Symbolic Pattern Classifiers Based on the Cartesian System Model, pp. 358–369. Springer, Heidelberg (1998)

    Google Scholar 

  14. Lassez, J.-L., Maher, M.J., Marriott, K.: Foundations of Deductive Databases and Logic Programming. In: chapter Unification Revisited J. Minker (1987)

    Google Scholar 

  15. Le Blaye, P., Dehais, F., Wioland, L.: Human activity modeling for flight analysis. In: Proceedings of HCP 1999, Intl. Conf. on Human Centered Processes, Brest, France, September 22-24 (1999) Euro.

    Google Scholar 

  16. Maille, N.: Un modéle logico-algébrique pour la fusion symbolique et l’analyse formelle. PhD thesis, Supaéro, 22 novembre (1999)

    Google Scholar 

  17. Hum. Fact. Lab. Nasa (2000), http://human-factors.arc.nasa.gov/IHS/ASRS/

  18. Plotkin, G.D.: Machine Intelligence. In: Meltzer, B., Michie, D. (eds.) A note on inductive generalization, vol. 5(8), pp. 153–163. Edinburgh University Press, Edinburgh (1970)

    Google Scholar 

  19. Prediger, S.: Logical scaling in formal concept analysis. In: Delugach, H.S., Keeler, M.A., Searle, L., Lukose, D., Sowa, J.F. (eds.) ICCS 1997. LNCS (LNAI), vol. 1257. Springer, Heidelberg (1997)

    Google Scholar 

  20. Skowron, A., Polkowski, L.: Rough Sets in Knowledge Discovery. Physica- Verlag, Heidelberg (1998)

    Google Scholar 

  21. Thayse, A.: Approche logique de l’Intelligence Artificielle. Dunod, Paris (1989) (in french)

    Google Scholar 

  22. Zickwolf, M.: Rule exploration: First Order Logic in Formal Concept Analysis. PhD thesis, THD Darmstadt Univ., 1991. Short English version, nr 1580 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chaudron, L., Maille, N. (2000). Generalized Formal Concept Analysis. In: Ganter, B., Mineau, G.W. (eds) Conceptual Structures: Logical, Linguistic, and Computational Issues. ICCS 2000. Lecture Notes in Computer Science(), vol 1867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722280_25

Download citation

  • DOI: https://doi.org/10.1007/10722280_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67859-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics