Cantitate/Preț
Produs

Formal Concept Analysis: 17th International Conference, ICFCA 2023, Kassel, Germany, July 17–21, 2023, Proceedings: Lecture Notes in Computer Science, cartea 13934

Editat de Dominik Dürrschnabel, Domingo López Rodríguez
en Limba Engleză Paperback – 14 iun 2023
This book constitutes the proceedings of the 17th International Conference on Formal Concept Analysis, ICFCA 2023, which took place in Kassel, Germany, in July 2023.

The 13 full papers presented in this volume were carefully reviewed and selected from 19 submissions. The International Conference on Formal Concept Analysis serves as a platform for researchers from FCA and related disciplines to showcase and exchange their research findings. The papers are organized in two topical sections, first "Theory" and second "Applications and Visualization".
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 35039 lei

Preț vechi: 43798 lei
-20% Nou

Puncte Express: 526

Preț estimativ în valută:
6705 7081$ 5580£

Carte tipărită la comandă

Livrare economică 13-27 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031359484
ISBN-10: 3031359488
Ilustrații: XXVIII, 199 p. 47 illus., 14 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.33 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Cham, Switzerland

Cuprins

​Theory: Approximating fuzzy relation equations through concept lattices.- Doubly-Lexical Order Supports Standardisation and Recursive Partitioning of Formal Context.- Graph-FCA Meets Pattern Structures.- On the commutative diagrams among Galois connections involved in closure structures.- Scaling Dimension.- Three Views on Dependency Covers from an FCA Perspective.- A Triadic Generalisation of the Boolean Concept Lattice.- Applications and Visualization: Computing witnesses for centralising monoids on a three-element set.- Description Quivers for Compact Representation of Concept Lattices and Ensembles of Decision Trees.- Examples of clique closure systems.- On the maximal independence polynomial of the covering graph of the hypercube up to n=6.- Relational Concept Analysis in Practice: Capitalizing on Data Modeling using Design Patterns.- Representing Concept Lattices with Euler Diagrams.