Skip to main content
SpringerLink
Log in

Formal Concept Analysis

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

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Rokia Missaoui

    1. Département d’informatique et d’ingénierie, Université du Québec en Outaouais, Gatineau, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jürg Schmidt

    1. Mathematisches Institut, Universität Bern, Bern, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

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

Access this book

Log in via an institution
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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (21 papers)

  1. Front Matter

    Download chapter 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
Back to top

Keywords

Editors and Affiliations

  • Département d’informatique et d’ingénierie, Université du Québec en Outaouais, Gatineau, Canada

    Rokia Missaoui

  • Mathematisches Institut, Universität Bern, Bern, Switzerland

    Jürg Schmidt

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation