Cantitate/Preț
Produs

Formal Concept Analysis: 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings: Lecture Notes in Computer Science, cartea 12733

Editat de Agnès Braud, Aleksey Buzmakov, Tom Hanika, Florence Le Ber
en Limba Engleză Paperback – 2 iun 2021
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32355 lei

Preț vechi: 40444 lei
-20% Nou

Puncte Express: 485

Preț estimativ în valută:
6193 6454$ 5155£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030778668
ISBN-10: 3030778665
Pagini: 291
Ilustrații: XVI, 291 p. 70 illus., 35 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.44 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Cham, Switzerland

Cuprins

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.