Advertisement

Formal Concept Analysis

4th International Conference, ICFCA 2006, Dresden, Germany, February 13-17, 2006. Proceedings

  • Rokia Missaoui
  • Jürg Schmidt
Conference proceedings

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3874)

Also part of the Lecture Notes in Artificial Intelligence book sub series (LNAI, volume 3874)

Table of contents

  1. Front Matter
    PDF

  2. Invited Lectures

    1. Methods of Conceptual Knowledge Processing
      Rudolf Wille
      Pages 1-29
    2. An Enumeration Problem in Ordered Sets Leads to Possible Benchmarks for Run-Time Prediction Algorithms
      Tushar S. Kulkarni, Bernd S. W. Schröder
      Pages 30-44
    3. Attribute Implications in a Fuzzy Setting
      Radim Bělohlávek, Vilém Vychodil
      Pages 45-60
    4. The Assessment of Knowledge, in Theory and in Practice
      Jean-Claude Falmagne, Eric Cosyn, Jean-Paul Doignon, Nicolas Thiéry
      Pages 61-79

  3. Regular Papers

    1. The Basic Theorem on Preconcept Lattices
      Christian Burgmann, Rudolf Wille
      Pages 80-88
    2. The Tensor Product as a Lattice of Regular Galois Connections
      Markus Krötzsch, Grit Malik
      Pages 89-104
    3. Two Instances of Peirce’s Reduction Thesis
      Frithjof Dau, Joachim Hereth Correia
      Pages 105-118
    4. Very Fast Instances for Concept Generation
      Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad
      Pages 119-129
    5. Negation, Opposition, and Possibility in Logical Concept Analysis
      Sébastien Ferré
      Pages 130-145
    6. A Note on Negation: A PCS-Completion of Semilattices
      Léonard Kwuida
      Pages 146-160
    7. Towards a Generalisation of Formal Concept Analysis for Data Mining Purposes
      Francisco J. Valverde-Albacete, Carmen Peláez-Moreno
      Pages 161-176
    8. Interactive Association Rules Discovery
      Raoul Medina, Lhouari Nourine, Olivier Raynaud
      Pages 177-190
    9. About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base
      Alain Gély, Lhouari Nourine
      Pages 191-204
    10. Spatial Indexing for Scalability in FCA
      Ben Martin, Peter Eklund
      Pages 205-220
    11. Homograph Disambiguation Using Formal Concept Analysis
      L. John Old
      Pages 221-232
    12. Using Concept Lattices to Uncover Causal Dependencies in Software
      John L. Pfaltz
      Pages 233-247
    13. An FCA Interpretation of Relation Algebra
      Uta Priss
      Pages 248-263
    14. Spring-Based Lattice Drawing Highlighting Conceptual Similarity
      Tim Hannan, Alex Pogel
      Pages 264-279
    15. Characterizing Planar Lattices Using Left-Relations
      Christian Zschalig
      Pages 280-290
    16. Automated Layout of Small Lattices Using Layer Diagrams
      Richard Cole, Jon Ducrou, Peter Eklund
      Pages 291-305
    17. Counting Pseudo-intents and #P-completeness
      Sergei O. Kuznetsov, Sergei Obiedkov
      Pages 306-308
  4. Back Matter
    PDF

About these proceedings

Keywords

Fuzzy Scala algorithms calculus concept algebra concept lattices conceptual hierarchies contextual logics data semantics data visualization formal conept analysis knowledge management learning machine learning visualization

Editors and affiliations

  • Rokia Missaoui
    • 1
  • Jürg Schmidt
    • 2
  1. 1.Département d’informatique et d’ingénierieUniversité du Québec en OutaouaisGatineauCanada
  2. 2.Mathematisches InstitutUniversität BernBernSwitzerland

Bibliographic information

Industry Sectors
Pharma
Materials & Steel
Automotive
Chemical Manufacturing
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Law
Consumer Packaged Goods
Energy, Utilities & Environment
Aerospace
Oil, Gas & Geosciences
Engineering