Formal Concept Analysis

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

  • Bernhard Ganter
  • Robert Godin
Conference proceedings ICFCA 2005

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

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

Table of contents

  1. Front Matter
  2. Mohammed J. Zaki, Nagender Parimi, Nilanjana De, Feng Gao, Benjarath Phoophakdee, Joe Urban et al.
    Pages 1-20
  3. Uta Priss, L. John Old
    Pages 21-32
  4. Juan M. Cigarrán, Anselmo Peñas, Julio Gonzalo, Felisa Verdejo
    Pages 49-63
  5. Jon Ducrou, Peter Eklund
    Pages 64-78
  6. Francisco J. Valverde-Albacete
    Pages 79-94
  7. Gabriela Arévalo, Stéphane Ducasse, Oscar Nierstrasz
    Pages 95-112
  8. Peter Eklund, Bastian Wormuth
    Pages 129-144
  9. Nicolas Maille, Irving C. Statler, Laurent Chaudron
    Pages 145-161
  10. Radim Bělohlávek, Vladimír Sklenář
    Pages 176-191
  11. Kamal Nehmé, Petko Valtchev, Mohamed H. Rouane, Robert Godin
    Pages 192-207
  12. Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad
    Pages 208-222
  13. A. Gély, R. Medina, L. Nourine, Y. Renaud
    Pages 235-248
  14. Jean François Djoufak Kengue, Petko Valtchev, Clémentin Tayou Djamegni
    Pages 249-264
  15. Radim Bělohlávek, Vladimír Sklenář, Jiří Zacpal
    Pages 269-284

About these proceedings

Introduction

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.

Keywords

Attribut Fuzzy Navigation Pattern Mining Processing algorithms calculus concept algebra concept lattices conceptual graphs contextual logics data analysis data semantics data visualization formal concept analysis

Editors and affiliations

  • Bernhard Ganter
    • 1
  • Robert Godin
    • 2
  1. 1.Institute of AlgebraUniversity of TechnologyDresdenGermany
  2. 2.Département d’informatiqueUQAMMontréalCanada

Bibliographic information

  • DOI https://doi.org/10.1007/b105806
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-24525-4
  • Online ISBN 978-3-540-32262-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Pharma
Automotive
Chemical Manufacturing
Biotechnology
Electronics
Telecommunications
Energy, Utilities & Environment
Aerospace