Cantitate/Preț
Produs

Formal Concept Analysis: 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, Proceedings: Lecture Notes in Computer Science, cartea 10308

Editat de Karell Bertet, Daniel Borchmann, Peggy Cellier, Sébastien Ferré
en Limba Engleză Paperback – 19 mai 2017
This book constitutes the proceedings of the 14th International Conference on Formal Concept Analysis, ICFCA 2017, held in Rennes, France, in June 2017. 
The 13 full papers presented in this volume were carefully reviewed and selected from 37 submissions. The book also contains an invited contribution and a historical paper translated from German and originally published in “Die Klassifkation und ihr Umfeld”, edited by P. O. Degens, H. J. Hermes, and O. Opitz, Indeks-Verlag, Frankfurt, 1986.
The field of Formal Concept Analysis (FCA) originated in the 1980s in Darmstadt as a subfield of mathematical order theory, with prior developments in other research groups. Its original motivation was to consider complete lattices as lattices of concepts, drawing motivation from philosophy and mathematics alike. FCA has since then developed into a wide research area with applications much beyond its original motivation, for example in logic, data mining, learning, and psychology.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33075 lei

Preț vechi: 41344 lei
-20% Nou

Puncte Express: 496

Preț estimativ în valută:
6330 6530$ 5357£

Carte tipărită la comandă

Livrare economică 04-18 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319592701
ISBN-10: 331959270X
Pagini: 243
Ilustrații: XVIII, 243 p. 79 illus.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.37 kg
Ediția:1st ed. 2017
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Cham, Switzerland

Cuprins

Invited Contribution.- An Invitation to Knowledge Space Theory.- Historical Paper.- Implications and Dependencies between Attributes.- Regular Contributions.- The implication logic of (n,k)-extremal lattices.- Making use of empty intersections to improve the performance of CbO-type algorithms.- On the Usability of Probably Approximately Correct Implication Bases. -Formal Concept Analysis in a Logical Programming Setting for Visualization Oriented (Power) Graph Compression.- A Proposition for Sequence Mining Using Pattern Structures. -An investigation of user behavior in educational platforms using Temporal Concept Analysis. -Hierarchies of Weighted Closed Partially-Ordered Patterns for Enhancing Sequential Data Analysis.- First Notes on Maximum Entropy Entailment for Quantified Implications. - On overfitting of classifiers making a lattice.- Learning Thresholds in Formal Concept Analysis.- The Linear Algebra in Extended Formal Concept Analysis over Idempotent Semifields.- Distributed and Parallel Computation of the Canonical Direct Basis.

Caracteristici

Includes supplementary material: sn.pub/extras