Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Formal Concept Analysis

Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Bernhard Ganter

    1. Institute of Algebra, University of Technology, Dresden, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Robert Godin

    1. Département d’informatique, UQAM, Montréal, Canada

    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 3403)

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

Included in the following conference series:

Conference proceedings info: ICFCA 2005.

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

  1. Front Matter

    Download chapter PDF

  2. Towards Generic Pattern Mining

    • Mohammed J. Zaki, Nagender Parimi, Nilanjana De, Feng Gao, Benjarath Phoophakdee, Joe Urban et al.
    Pages 1-20

  3. Conceptual Exploration of Semantic Mirrors

    • Uta Priss, L. John Old
    Pages 21-32

  4. Towards a Formal Concept Analysis Approach to Exploring Communities on the World Wide Web

    • Jayson E. Rome, Robert M. Haralick
    Pages 33-48

  5. Automatic Selection of Noun Phrases as Document Descriptors in an FCA-Based Information Retrieval System

    • Juan M. Cigarrán, Anselmo Peñas, Julio Gonzalo, Felisa Verdejo
    Pages 49-63

  6. Combining Spatial and Lattice-Based Information Landscapes

    • Jon Ducrou, Peter Eklund
    Pages 64-78

  7. Explaining the Structure of FrameNet with Concept Lattices

    • Francisco J. Valverde-Albacete
    Pages 79-94

  8. Lessons Learned in Applying Formal Concept Analysis to Reverse Engineering

    • Gabriela Arévalo, Stéphane Ducasse, Oscar Nierstrasz
    Pages 95-112

  9. Navigation Spaces for the Conceptual Analysis of Software Structure

    • Richard Cole, Peter Becker
    Pages 113-128

  10. Restructuring Help Systems Using Formal Concept Analysis

    • Peter Eklund, Bastian Wormuth
    Pages 129-144

  11. An Application of FCA to the Analysis of Aeronautical Incidents

    • Nicolas Maille, Irving C. Statler, Laurent Chaudron
    Pages 145-161

  12. Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis

    • Jaume Baixeries, José Luis Balcázar
    Pages 162-175

  13. Formal Concept Analysis Constrained by Attribute-Dependency Formulas

    • Radim Bělohlávek, Vladimír Sklenář
    Pages 176-191

  14. On Computing the Minimal Generator Family for Concept Lattices and Icebergs

    • Kamal Nehmé, Petko Valtchev, Mohamed H. Rouane, Robert Godin
    Pages 192-207

  15. Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice

    • Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad
    Pages 208-222

  16. A Generic Algorithm for Generating Closed Sets of a Binary Relation

    • Alain Gély
    Pages 223-234

  17. Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases

    • A. Gély, R. Medina, L. Nourine, Y. Renaud
    Pages 235-248

  18. A Parallel Algorithm for Lattice Construction

    • Jean François Djoufak Kengue, Petko Valtchev, Clémentin Tayou Djamegni
    Pages 249-264

  19. Using Intermediate Representation Systems to Interact with Concept Lattices

    • Peter Becker
    Pages 265-268

  20. Crisply Generated Fuzzy Concepts

    • Radim Bělohlávek, Vladimír Sklenář, Jiří Zacpal
    Pages 269-284
Back to top

Other volumes

  1. Formal Concept Analysis

Keywords

About this book

This volume contains the Proceedings of ICFCA 2005, the 3rd International Conference on Formal Concept Analysis. The ICFCA conference series aims to be the premier forum for the publication of advances in applied lattice and order theory, and in particular scienti?c advances related to formal concept analysis. Formal concept analysis is a ?eld of applied mathematics with its mat- matical root in order theory, in particular in the theory of complete lattices. Researchers had long been aware of the fact that these ?elds have many - tential applications. Formal concept analysis emerged in the 1980s from e?orts to restructure lattice theory to promote better communication between lattice theorists and potential users of lattice theory. The key theme was the mathe- tization of concept and conceptual hierarchy. Since then, the ?eld has developed into a growing research area in its own right with a thriving theoretical com- nity and an increasing number of applications in data and knowledge processing, including data visualization, information retrieval, machine learning, data an- ysis and knowledge management. ICFCA2005re?ectedbothpracticalbene?tsandprogressinthefoundational theory of formal concept analysis. Algorithmic aspects were discussed as well as e?orts to broaden the ?eld. All regular papers appearing in this volume were refereed by at least two, in most cases three independent reviewers. The ?nal decision to accept the papers was arbitrated by the Program Chairs based on the referee reports. It was the involvement of the Program Committee and the Editorial Board that ensured the scienti?c quality of these proceedings.

Editors and Affiliations

  • Institute of Algebra, University of Technology, Dresden, Germany

    Bernhard Ganter

  • Département d’informatique, UQAM, Montréal, Canada

    Robert Godin

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation