Del i serien Lecture Notes in Computer Science

Formal Concept Analysis

16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings

Häftad, Engelska, 2021

AvAgnès Braud,Aleksey Buzmakov,Tom Hanika,Florence Le Ber

739 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2021-06-02
Mått155 x 235 x undefined mm
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor291
FörlagSpringer Nature Switzerland AG
ISBN9783030778668

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT
Databaser inom Data och IT

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.