Skip to main content
SpringerLink
Log in
Book cover

Formal Concept Analysis

14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, Proceedings

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. Karell Bertet

    1. Université de La Rochelle, La Rochelle, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Daniel Borchmann

    1. Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Peggy Cellier

    1. Université de Rennes, Rennes, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Sébastien Ferré

    1. Université de Rennes, Rennes, France

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

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

Included in the following conference series:

Conference proceedings info: ICFCA 2017.

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 EPUB and 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 (15 papers)

  1. Front Matter

    Pages I-XVIII
    Download chapter PDF

  2. Invited Contribution

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. An Invitation to Knowledge Space Theory

      • Bernhard Ganter, Michael Bedek, Jürgen Heller, Reinhard Suck
      Pages 3-19

  3. Historical Paper

    1. Front Matter

      Pages 21-21
      Download chapter PDF

    2. Implications and Dependencies Between Attributes

      • Bernhard Ganter, Rudolf Wille, Daniel Borchmann, Juliane Prochaska
      Pages 23-35

  4. Regular Contributions

    1. Front Matter

      Pages 37-37
      Download chapter PDF

    2. The Implication Logic of (n, k)-Extremal Lattices

      • Alexandre Albano
      Pages 39-55

    3. Making Use of Empty Intersections to Improve the Performance of CbO-Type Algorithms

      • Simon Andrews
      Pages 56-71

    4. On the Usability of Probably Approximately Correct Implication Bases

      • Daniel Borchmann, Tom Hanika, Sergei Obiedkov
      Pages 72-88

    5. FCA in a Logical Programming Setting for Visualization-Oriented Graph Compression

      • Lucas Bourneuf, Jacques Nicolas
      Pages 89-105

    6. A Proposition for Sequence Mining Using Pattern Structures

      • Victor Codocedo, Guillaume Bosc, Mehdi Kaytoue, Jean-François Boulicaut, Amedeo Napoli
      Pages 106-121

    7. An Investigation of User Behavior in Educational Platforms Using Temporal Concept Analysis

      • Sanda-Maria Dragoş, Christian Săcărea, Diana-Florina Şotropa
      Pages 122-137

    8. Hierarchies of Weighted Closed Partially-Ordered Patterns for Enhancing Sequential Data Analysis

      • Cristina Nica, Agnès Braud, Florence Le Ber
      Pages 138-154

    9. First Notes on Maximum Entropy Entailment for Quantified Implications

      • Francesco Kriegel
      Pages 155-167

    10. Implications over Probabilistic Attributes

      • Francesco Kriegel
      Pages 168-183

    11. On Overfitting of Classifiers Making a Lattice

      • Tatiana Makhalova, Sergei O. Kuznetsov
      Pages 184-197

    12. Learning Thresholds in Formal Concept Analysis

      • Uta Priss
      Pages 198-210

    13. The Linear Algebra in Extended Formal Concept Analysis Over Idempotent Semifields

      • Francisco José Valverde-Albacete, Carmen Peláez-Moreno
      Pages 211-227

    14. Distributed and Parallel Computation of the Canonical Direct Basis

      • Jean-François Viaud, Karell Bertet, Rokia Missaoui, Christophe Demko
      Pages 228-241

  5. Back Matter

    Pages 243-243
    Download chapter PDF
Back to top

Other volumes

  1. Formal Concept Analysis

Keywords

About this book

This book constitutes the proceedings of the 14th International Conference on Formal Concept Analysis, ICFCA 2017, held in Rennes, France, in June 2017. 
The 13 full papers presented in this volume were carefully reviewed and selected from 37 submissions. The book also contains an invited contribution and a historical paper translated from German and originally published in “Die Klassifkation und ihr Umfeld”, edited by P. O. Degens, H. J. Hermes, and O. Opitz, Indeks-Verlag, Frankfurt, 1986.
The field of Formal Concept Analysis (FCA) originated in the 1980s in Darmstadt as a subfield of mathematical order theory, with prior developments in other research groups. Its original motivation was to consider complete lattices as lattices of concepts, drawing motivation from philosophy and mathematics alike. FCA has since then developed into a wide research area with applications much beyond its original motivation, for example in logic, data mining, learning, and psychology.

Editors and Affiliations

  • Université de La Rochelle, La Rochelle, France

    Karell Bertet

  • Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany

    Daniel Borchmann

  • Université de Rennes, Rennes, France

    Peggy Cellier, Sébastien Ferré

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation