CLA 2018
The 14th International Conference
on Concept Lattices and Their Applications

Olomouc, Czech Republic, June 12–14, 2018
Olomouc
Fort science
interactive science center of
Palacký University Olomouc

Accepted papers

Regular papers

  • Christian Jäkel and Stefan Schmidt. Cover Problems, Dimensions and the Tensor Product of Complete Lattices.
  • Bernhard Ganter. Order-embedded complete lattices.
  • Giacomo Kahn and Alexandre Bazin. Average Size of Implicational Bases.
  • Angel Mora Bonilla, Pablo Cordero, Manuel Enciso and Vilem Vychodil. Towards Simplification Logic for Graded Attribute Implications with General Semantics.
  • Rostand Kuitché S., Romuald E. A. Temgoua and Léonard Kwuida. A Similarity Measure to Generalize Attributes.
  • Radim Belohlavek and Martin Trnecka. The 8M algorithm from today's perspective.
  • Eduard Bartl, Radim Belohlavek and Alex Scharaschkin. Toward Factor Analysis of Educational Data.
  • Martin Trnecka and Marketa Trneckova. Can we measure the interpretability of factors?.
  • Alexandre Bazin and Aurélie Bertaux. k-Partite Graphs as Contexts.
  • Sebastien Ferre and Peggy Cellier. How Hierarchies of Concept Graphs can Facilitate the Interpretation of RCA Lattices?.
  • Francisco J. Valverde-Albacete, Carmen Peláez-Moreno, Inma P. Cabrera, Pablo Cordero and Manuel Ojeda-Aciego. A Data Analysis Application of Formal Independence Analysis.
  • Hirohisa Seki and Masahiro Nagao. Mining Correlated Association Rules from Multi-Relational Data using Interval Patterns.
  • Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo and Heyu Liu. Finding Concepts with Unexpected Multi-Label Objects Based on Shared Subspace Method.
  • Alain Gély, Miguel Couceiro and Amedeo Napoli. Steps towards achieving distributivity in Formal Concept Analysis.
  • Tim Pattison. Interactive Query Refinement using Formal Concept Analysis.
  • Bogdan Chornomaz. K-chains problem and why it matters for extremal contexts.
  • Tatyana Makhalova, Sergei O. Kuznetsov and Amedeo Napoli. A first study on what MDL can do for FCA.

Papers with short presentation

  • Simon Andrews. A new method for inheriting canonicity test failures in Close-by-One type algorithms.
  • Francesco Kriegel. The Distributive, Graded, Metric Lattice of EL Concept Descriptions.
  • Nyoman Juniarta, Miguel Couceiro, Amedeo Napoli and Chedy Raïssi. Sequential Pattern Mining using FCA and Pattern Structures for Analyzing Visitor Trajectories in a Museum.
  • Lucas Bourneuf. An Answer Set Programming environment for high-level specification and visualization of FCA.
  • Henry Soldano, Guillaume Santini, Sophie Bary and Dominique Bouthinon. Formal Bi-concept Analysis to Investigate Attributed Two Mode Networks.
  • Tim Pattison, Aaron Ceglar and Derek Weber. Efficient Formal Concept Analysis through Recursive Context Partitioning.
  • Aimene Belfodil, Sergei Kuznetsov and Mehdi Kaytoue. Pattern Setups and Their Completions.
  • Víctor Codocedo, Mehdi Kaytoue, Jaume Baixeries and Amedeo Napoli. Characterizing Covers of Functional Dependencies using FCA.
  • Alexandre Bazin, Jessie Carbonnel, Marianne Huchard and Giacomo Kahn. On-demand Relational Concept Analysis.