Vol-2668
urn:nbn:de:0074-2668-2

Copyright © 2020 for the individual papers by the papers' authors. Copyright © 2020 for the volume as a collection by its editors. This volume and its papers are published under the Creative Commons License Attribution 4.0 International (CC BY 4.0).

CLA 2020
Concept Lattices and Their Applications

Proceedings of the Fifthteenth International Conference on Concept Lattices and Their Applications

Tallinn, Estonia, June 29–July 1, 2020.

Edited by

Francisco J. Valverde-Albacete *
Martin Trnecka **

* Universidad Carlos III de Madrid, Spain
** Palacký University Olomouc, Czech Republic

Table of Contents

Preface

Invited Talks

The Lattice Computing (LC) Paradigm 1-7
Vassilis G. Kaburlasos
Formal Concept Analysis Techniques Can Help in Intelligent Control, Deep Learning, etc. 9-17
Vladik Kreinovich

Regular Papers

Notes on Integer Partitions 19-31
Bernhard Ganter
Typicality in Conceptual Atructures Within the Framework of Formal Concept Analysis 33-45
Radim Belohlavek, Tomas Mikula
LCM is Well Implemented CbO: Study of LCM from FCA Point of View 47-58
Radek Janostik, Jan Konecny, Petr Krajča
Revisiting the GreCon Algorithm for Boolean Matrix Factorization 59-70
Martin Trnecka, Roman Vyjidacek
A Hybrid Partitioning Strategy for Distributed FCA 71-82
Muneeswaran P, Jyoti, Sriram Kailasam
Remarks on Prime Ideal and Representation Theorems for Double Boolean Algebras 83-94
Prosenjit Howlader, Mohua Banerjee
Simple Structure in Boolean Matrix Factorization 95-106
Martin Trnecka, Marketa Trneckova
AOC-Poset on Discourse and Argumentation Subgraphs: What Can we Learn on Their Dependencies? 107-118
Laurine Huber, Justine Reynaud, Mathilde Dargnat, Yannick Toussaint
Explaining Multicriteria Decision Making with Formal Concept Analysis 119-130
Alexandre Bazin, Miguel Couceiro, Marie-Dominique Devignes, Amedeo Napoli
A Link between Pattern Structures and Random Forests 131-143
Tilo Krause, Lars Lumpe, Stefan E. Schmidt
Gradual Discovery with Closure Structure of a Concept Lattice 145-157
Tatiana Makhalova, Sergei O. Kuznetsov, Amedeo Napoli
Representing Informational Harmoniums using Semifield-Valued Formal Concept Analysis 159-170
Francisco J. Valverde-Albacete, Carmen Peláez-Moreno
Exploratory Data Analysis of Multi-label Classification Tasks with Formal Context Analysis 171-183
Francisco J. Valverde-Albacete, Carmen Peláez-Moreno, Inma P. Cabrera, Pablo Cordero, Manuel Ojeda-Aciego
Optimization Problems on Posets 185-196
Christian Jäkel, Stefan E. Schmidt
Practical Comparison of FCA Extensions to Model Indeterminate Value of Ternary Data 197-208
Priscilla Keip, Sébastien Ferré, Alain Gutierrez, Marianne Huchard, Pierre Silvie, Pierre Martin
Sequence Mining Using FCA and the NextPriorityConcept Algorithm 209-222
Salah Eddine Boukhetta, Christophe Demko, Jérémy Richard, Karell Bertet
A CbO-based Algorithm for Mining Class Relevant Patterns 223-234
Hirohisa Seki, Taiki Yamada
Discovery of Link Keys in RDF Data Based on Pattern Structures: Preliminary Steps 235-246
Nacira Abbas, Jérôme David, Amedeo Napoli
Steps in the Representation of Concept Lattices and Median Graphs 247-258
Alain Gély, Miguel Couceiro, Laurent Miclet, Amedeo Napoli
Shapley and Banzhaf Vectors of a Formal Concept 259-271
Dmitry I. Ignatov, Léonard Kwuida
Quantified Formal-Concept Operators 273-280
M. Eugenia Cornejo, Juan Carlos Díaz-Moreno, Juan López-Rodríguez, Jesús Medina

Papers with Short Presentation

Comparison of Matrix Reordering Algorithms Based on Monotone Systems 281-286
Grete Lind, Rein Kuusik
Towards Stable Significant Subgroup Discovery 287-292
Jyoti, Aleksey Buzmakov, Sriram Kailasam

2020-09-09: submitted by Francisco J. Valverde-Albacete and Martin Trnecka, metadata incl. bibliographic data published under Creative Commons CC0
2020-09-11: published on CEUR Workshop Proceedings (CEUR-WS.org, ISSN 1613-0073) |valid HTML5|