CLA 2018 The International Conference on Concept Lattices and Their Applications

Olomouc

Fort science
interactive science center of
Palacký University Olomouc

Program

June 12

13:00–13:45	REGISTRATION / COFFEE BREAK
13:45–14:00	OPENING
14:00–15:00	Invited talk: Filip Železný (Czech Technical University in Prague, Czech Republic), Relational Machine Learning. Chair: Sergei O. Kuznetsov
15:00–15:50	Session 1. Embedding and dimension. Chair: Leonard Kwuida Christian Jäkel and Stefan Schmidt. CoverProblems, Dimensions and the Tensor Product of Complete Lattices. Bernhard Ganter. Order-embedded Complete Lattices.
15:50–16:20	COFFEE BREAK
16:20–18:25	Session 2. Implications. Chair: Bernhard Ganter 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. Radim Belohlavek and Martin Trnecka. The 8M Algorithm from Today's Perspective. 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. Tim Pattison. Interactive Query Refinement using Formal Concept Analysis.
18:35	Video projection. CLA 2006 invited talk (Hammamet, Tunisia) Rudol Wille. Formal Concept Analysis as Applied Lattice Theory.

June 13

8:00–8:45	BREAKFAST
8:45–9:45	Invited talk: Edouard Machery (University of Pittsburgh, USA), Psychological theories of concepts. Chair: Radim Belohlavek
9:45–10:15	COFFEE BREAK
10:15–11:30	Session 3. Lattice properties. Chair: Amedeo Napoli Alain Gély, Miguel Couceiro and Amedeo Napoli. Steps Towards Achieving Distributivity in Formal Concept Analysis. Alexandre Bazin and Aurélie Bertaux. k-Partite Graphs as Contexts. Bogdan Chornomaz. K-chains Problem and Why it Matters for Extremal Contexts.
11:30–13:30	LUNCH (at conference place)
12:30–13:30	Poster session Tim Pattison, Aaron Ceglar and Derek Weber. Efficient Formal Concept Analysis through Recursive Context Partitioning. 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. Aimene Belfodil, Sergei Kuznetsov and Mehdi Kaytoue. Pattern Setups and Their Completions. 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. Víctor Codocedo, Mehdi Kaytoue, Jaume Baixeries and Amedeo Napoli. Characterizing Covers of Functional Dependencies using FCA.
13:30–14:30	Invited talk: Lakhdar Sais (Cril, France), Towards Cross-Fertilization between Data Mining and Constraints. Chair: Lhouari Nourine
14:30–15:20	Session 4. Factors application. Chair: Stefan Schmidt 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?
15:20	COFFEE BREAK
17:00	SOCIAL EVENT

June 14

8:00–8:45	BREAKFAST
8:45–9:45	Invited talk: Pauli Miettinen (Max-Planck-Institut, Germany), Boolean tensor factorizations – and beyond. Chair: Dmitry I. Ignatov
9:45–10:15	COFFEE BREAK
10:15–12:20	Session 5. FCA and Data Mining. Chair: Jan Outrata Tatyana Makhalova, Sergei O. Kuznetsov and Amedeo Napoli. A First Study on What MDL Can Do for FCA. Sebastien Ferre and Peggy Cellier. How Hierarchies of Concept Graphs can Facilitate the Interpretation of RCA Lattices? Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo and Heyu Liu. Finding Concepts with Unexpected Multi-Label Objects Based on Shared Subspace Method. Rostand Kuitché S., Romuald E. A. Temgoua and Léonard Kwuida. A Similarity Measure to Generalize Attributes. Hirohisa Seki and Masahiro Nagao. Mining Correlated Association Rules from Multi-Relational Data using Interval Patterns.
12:20	CLOSING SESSION, LUNCH (at the conference place), VISIT OF FORT SCIENCE (free tour)