Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/autre/formal-concept-analysis/descriptif_3960855
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=3960855

Formal Concept Analysis, 1st ed. 2017 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, Proceedings Lecture Notes in Artificial Intelligence Series

Langue : Anglais

Coordonnateurs : Bertet Karell, Borchmann Daniel, Cellier Peggy, Ferré Sébastien

Couverture de l’ouvrage Formal Concept Analysis
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.
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.

Includes supplementary material: sn.pub/extras