Skip to main content
SpringerLink
Log in

Formal Concept Analysis

6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008, Proceedings

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Raoul Medina
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Sergei Obiedkov
    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 4933)

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

Included in the following conference series:

Conference proceedings info: ICFCA 2008.

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 (23 papers)

  1. Front Matter

    Download chapter PDF

  2. Communicative Rationality, Logic, and Mathematics

    • Rudolf Wille
    Pages 1-13

  3. Actionability and Formal Concepts: A Data Mining Perspective

    • Jean-François Boulicaut, Jérémy Besson
    Pages 14-31

  4. Acquiring Generalized Domain-Range Restrictions

    • Sebastian Rudolph
    Pages 32-45

  5. A Finite Basis for the Set of \(\mathcal{EL}\)-Implications Holding in a Finite Model

    • Franz Baader, Felix Distel
    Pages 46-61

  6. Lexico-Logical Acquisition of OWL DL Axioms

    • Johanna Völker, Sebastian Rudolph
    Pages 62-77

  7. From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit

    • Ben Martin, Peter Eklund
    Pages 78-89

  8. A Formal Context for Symmetric Dependencies

    • Jaume Baixeries
    Pages 90-105

  9. The Number of Plane Diagrams of a Lattice

    • Christian Zschalig
    Pages 106-123

  10. Spectral Lattices of \(\mathbb{\overline R}_{\rm max,+}\)-Formal Contexts

    • Francisco J. Valverde-Albacete, Carmen Peláez-Moreno
    Pages 124-139

  11. About Keys of Formal Context and Conformal Hypergraph

    • Pierre Colomb, Lhouari Nourine
    Pages 140-149

  12. An Algebraization of Linear Continuum Structures

    • Rudolf Wille
    Pages 150-157

  13. On the Complexity of Computing Generators of Closed Sets

    • Miki Hermann, Barış Sertkaya
    Pages 158-168

  14. Generating Positive and Negative Exact Rules Using Formal Concept Analysis: Problems and Solutions

    • Rokia Missaoui, Lhouari Nourine, Yoan Renaud
    Pages 169-181

  15. On the Merge of Factor Canonical Bases

    • Petko Valtchev, Vincent Duquenne
    Pages 182-198

  16. Lattices of Rough Set Abstractions as P-Products

    • Bernhard Ganter
    Pages 199-216

  17. Scale Coarsening as Feature Selection

    • Bernhard Ganter, Sergei O. Kuznetsov
    Pages 217-228

  18. Formal Concept Analysis for the Identification of Combinatorial Biomarkers in Breast Cancer

    • Susanne Motameny, Beatrix Versmold, Rita Schmutzler
    Pages 229-240

  19. Handling Spatial Relations in Logical Concept Analysis to Explore Geographical Data

    • Olivier Bedel, Sébastien Ferré, Olivier Ridoux
    Pages 241-257

  20. Analysis of Social Communities with Iceberg and Stability-Based Concept Lattices

    • Nicolas Jay, François Kohler, Amedeo Napoli
    Pages 258-272
Back to top

Other volumes

  1. Formal Concept Analysis

Keywords

About this book

Formal Concept Analysis (FCA) is a mathematical theory of concepts and c- ceptualhierarchyleadingtomethodsforconceptuallyanalyzingdataandkno- edge. The theoryitselfstronglyreliesonorderandlatticetheory,whichhasbeen studied by mathematicians over decades. FCA proved itself highly relevant in several applications from the beginning, and, over the last years, the range of applicationshaskeptgrowing. The mainreasonfor this comesfromthe fact that our modern society has turned into an “information” society. After years and years of using computers, companies realized they had stored gigantic amounts of data. Then, they realized that this data, just rough information for them, might become a real treasure if turned into knowledge. FCA is particularly well suited for this purpose. From relational data, FCA can extract implications, - pendencies, concepts and hierarchies of concepts, and thus capture part of the knowledge hidden in the data. The ICFCA conference series gathers researchers from all over the world, being the main forum to present new results in FCA and related ?elds. These results range from theoretical novelties to advances in FCA-related algorithmic issues, as well as application domains of FCA. ICFCA 2008 was in the same vein as its predecessors: high-quality papers and presentations, the place of real debate and exchange of ideas. ICFCA 2008 contributed to strengthening the links between theory and applications. The high quality of the presentations was the result of the remarkable work of the authors and the reviewers. We wish to thank the reviewers for all their valuable comments, which helped the authors to improve their presentations.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation