Formal concept analysis : 17th International Conference, ICFCA 2023, Kassel, Germany, July 17-21, 2023, proceedings
Author(s)
Bibliographic Information
Formal concept analysis : 17th International Conference, ICFCA 2023, Kassel, Germany, July 17-21, 2023, proceedings
(Lecture notes in computer science, 13934. Lecture notes in artificial intelligence)
Springer, c2023
Available at 1 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references and index
"LNCS sublibrary : SL7 - Artificial intelligence"--T.p. verso
Description and Table of Contents
Description
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".
Table of Contents
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.
by "Nielsen BookData"