Braud / Buzmakov / Hanika Formal Concept Analysis

16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings
1. Auflage 2021
ISBN: 978-3-030-77867-5
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 291 Seiten, eBook

Reihe: Lecture Notes in Artificial Intelligence

This book constitutes the proceedings of the 16th International Conference on Formal Concept Analysis, ICFCA 2021, held in Strasbourg, France, in June/July 2021.The 14 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 32 submissions. The book also contains four invited contributions in full paper length. The research part of this volume is divided in five different sections. First, "Theory" contains compiled works that discuss advances on theoretical aspects of FCA. Second, the section "Rules" consists of contributions devoted to implications and association rules. The third section "Methods and Applications" is composed of results that are concerned with new algorithms and their applications. "Exploration and Visualization" introduces different approaches to data exploration.

Zielgruppe

Research

Autoren/Hrsg.

Braud, Agnès

Buzmakov, Aleksey

Hanika, Tom

Le Ber, Florence

Inhaltsverzeichnis

Representing partition lattices through FCA.- Fixed-Point Semantics for Barebone Relational Concept Analysis.- Boolean Substructures in Formal Concept Analysis.- Enumerating Maximal Consistent Closed Sets in Closure Systems.- A new Kind of Implication to Reason with Unknown Information.- Pruning Techniques in LinCbO for Computation of the Duquenne-Guigues Basis.- Approximate Computation of Exact Association Rules.- An Incremental Recomputation of From-Below Boolean Matrix Factorization.- Clustering and Identification of Core Implications for Grouping Objects.- Extracting Relations in Texts with Concepts of Neighbours.- Triadic Exploration and Exploration with Multiple Experts.- Towards Interactive Transition from AOC Poset to Concept Lattice.- Visualization of Statistical Information in Concept Lattice Diagrams.- Force-Directed Layout of Order Diagrams Using Dimensional Reduction.- Sandwich: an Algorithm for Discovering Relevant Link Keys in an LKPS Concept Lattice.- Decision Concept Lattice vs Decision Trees and Random Forests.- Exploring Scale-Measures of Data Sets.- Filters, Ideals and Congruence on Double Boolean Algebras.- Diagrammatic Representations of Conceptual Structures.