CLA 2018
Concept Lattices and Their Applications

Table of Contents

• Preface
  
  

Invited Talks

• Relational Machine Learning 1
  Filip Železný
• Psychological Theories of Concepts 3
  Edouard Machery
• Towards Cross-Fertilization between Data Mining and Constraints 5
  Lakhdar Sais
• Boolean Tensor Factorizations and Beyond 7
  Pauli Miettinen

Regular Papers

• K-Chains Problem and Why it Matters for Extremal Contexts 9-24
  Bogdan Chornomaz
• A First Study on What MDL Can Do for FCA 25-36
  Tatiana Makhalova, Sergei O. Kuznetsov, Amedeo Napoli
• Average Size of Implicational Bases 37-46
  Giacomo Kahn, Alexandre Bazin
• Mining Correlated Association Rules from Multi-Relational Data using Interval Patterns 47-58
  Hirohisa Seki, Masahiro Nagao
• k-Partite Graphs as Contexts 59-67
  Alexandre Bazin, Aurélie Bertaux
• How Hierarchies of Concept Graphs Can Facilitate the Interpretation of RCA Lattices? 69-80
  Sébastien Ferré, Peggy Cellier
• Cover Problems, Dimensions And The Tensor Product Of Complete Lattices 81-92
  Christian Jäkel, Stefan E. Schmidt
• Finding Concepts with Unexpected Multi-Label Objects Based on Shared Subspace Method 93-104
  HongJie Zhai, Makoto Haraguchi, Yoshiaki Okubo, HeYu Liu
• Steps Towards Achieving Distributivity in Formal Concept Analysis 105-116
  Alain Gély, Miguel Couceiro, Amedeo Napoli
• A Data Analysis Application of Formal Independence Analysis 117-128
  Francisco J. Valverde-Albacete, Carmen Peláez-Moreno, Inma P. Cabrera, Pablo Cordero, Manuel Ojeda-Aciego
• Towards Simplification Logic for Graded Attribute Implications with General Semantics 129-140
  Pablo Cordero, Manuel Enciso, Angel Mora, Vilem Vychodil
• A Similarity Measure to Generalize Attributes 141-152
  Rostand S. Kuitché, Romuald E. A. Temgoua, Léonard Kwuida
• Order-embedded Complete Lattices 153-165
  Bernhard Ganter
• The 8M Algorithm from Today's Perspective 167-178
  Radim Belohlavek, Martin Trnecka
• Can We Measure the Interpretability of Factors? 179-190
  Martin Trnecka, Marketa Trneckova
• Toward Factor Analysis of Educational Data 191-206
  Eduard Bartl, Radim Belohlavek, Alex Scharaschkin
• Interactive Query Refinement using Formal Concept Analysis 207-218
  Tim Pattison

Papers with Short Presentation

• Efficient Formal Concept Analysis through Recursive Context Partitioning 219-230
  Tim Pattison, Aaron Ceglar, Derek Weber
• Sequential Pattern Mining using FCA and Pattern Structures for Analyzing Visitor Trajectories in a Museum 231-242
  Nyoman Juniarta, Miguel Couceiro, Amedeo Napoli, Chedy Raïssi
• Pattern Setups and Their Completions 243-253
  Aimene Belfodil, Sergei O. Kuznetsov, Mehdi Kaytoue
• A New Method for Inheriting Canonicity Test Failures in Close-by-One Type Algorithms 255-266
  Simon Andrews
• The Distributive, Graded Lattice of EL Concept Descriptions and its Neighborhood Relation 267-278
  Francesco Kriegel
• Characterizing Covers of Functional Dependencies using FCA 279-290
  Víctor Codocedo, Jaume Baixeries, Mehdi Kaytoue, Amedeo Napoli

Full Proceedings

• The complete CLA 2018 proceedings in one ZIP file