Formal Concept Analysis [electronic resource] : 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, Proceedings / edited by Karell Bertet, Daniel Borchmann, Peggy Cellier, Sébastien Ferré.

Contributor(s): Bertet, Karell [editor.] | Borchmann, Daniel [editor.] | Cellier, Peggy [editor.] | Ferré, Sébastien [editor.] | SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 10308Publisher: Cham : Springer International Publishing : Imprint: Springer, 2017Description: XVIII, 243 p. 79 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783319592718Subject(s): Computer science | Software engineering | Data mining | Artificial intelligence | Application software | Management information systems | Computer Science | Artificial Intelligence (incl. Robotics) | Data Mining and Knowledge Discovery | Computer Appl. in Administrative Data Processing | Software Engineering | Management of Computing and Information SystemsAdditional physical formats: Printed edition:: No titleDDC classification: 006.3 LOC classification: Q334-342TJ210.2-211.495Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

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.

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.

There are no comments on this title.

to post a comment.

Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha