Atnaujinkite slapukų nuostatas

Formal Concept Analysis: 17th International Conference, ICFCA 2023, Kassel, Germany, July 1721, 2023, Proceedings 1st ed. 2023 [Minkštas viršelis]

  • Formatas: Paperback / softback, 199 pages, aukštis x plotis: 235x155 mm, weight: 355 g, 14 Illustrations, color; 33 Illustrations, black and white; XXVIII, 199 p. 47 illus., 14 illus. in color., 1 Paperback / softback
  • Serija: Lecture Notes in Artificial Intelligence 13934
  • Išleidimo metai: 14-Jun-2023
  • Leidėjas: Springer International Publishing AG
  • ISBN-10: 3031359488
  • ISBN-13: 9783031359484
Kitos knygos pagal šią temą:
  • Formatas: Paperback / softback, 199 pages, aukštis x plotis: 235x155 mm, weight: 355 g, 14 Illustrations, color; 33 Illustrations, black and white; XXVIII, 199 p. 47 illus., 14 illus. in color., 1 Paperback / softback
  • Serija: Lecture Notes in Artificial Intelligence 13934
  • Išleidimo metai: 14-Jun-2023
  • Leidėjas: Springer International Publishing AG
  • ISBN-10: 3031359488
  • ISBN-13: 9783031359484
Kitos knygos pagal šią temą:
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".
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.