Central Library

Normal view MARC view ISBD view

Formal Methods for Mining Structured Objects [electronic resource] / by Gemma C Garriga.

By: Garriga, Gemma C [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Studies in Computational Intelligence: 475Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013Description: X, 109 p. 50 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642366819.Subject(s): Engineering | Artificial intelligence | Computational intelligence | Engineering | Computational Intelligence | Artificial Intelligence (incl. Robotics)Additional physical formats: Printed edition:: No titleDDC classification: 006.3 Online resources: Click here to access online
Contents:
Introduction -- Preliminaries -- Horn Axiomatizations for Sequences -- Transformations on Injective Partial Orders -- Transformations on General Partial Orders -- Towards Other Structured Data.
In: Springer eBooksSummary: In the field of knowledge discovery, graphs of concepts are an expressive and versatile modeling technique providing ways to reason about information implicit in a set of data. Interesting examples of this can be found under the mathematical theory of formal concept analysis, dedicated to the construction of a lattice of concepts by defining a Galois connection on a binary relationship. This book present such graph of concepts under the more complex case of data that comes in a set of structured objects; e.g. a set of sequences, trees or graphs. Nodes of this graph will represent patterns in the data and edges will correspond to relationships of specificity. From this combinatorial object results are derived such as a full characterization of  logical implications and closed partial orders. The results presented in this book are coupled with examples and empirical experiments that illustrate the derived theoretical contributions.
    average rating: 0.0 (0 votes)
No physical items for this record

Introduction -- Preliminaries -- Horn Axiomatizations for Sequences -- Transformations on Injective Partial Orders -- Transformations on General Partial Orders -- Towards Other Structured Data.

In the field of knowledge discovery, graphs of concepts are an expressive and versatile modeling technique providing ways to reason about information implicit in a set of data. Interesting examples of this can be found under the mathematical theory of formal concept analysis, dedicated to the construction of a lattice of concepts by defining a Galois connection on a binary relationship. This book present such graph of concepts under the more complex case of data that comes in a set of structured objects; e.g. a set of sequences, trees or graphs. Nodes of this graph will represent patterns in the data and edges will correspond to relationships of specificity. From this combinatorial object results are derived such as a full characterization of  logical implications and closed partial orders. The results presented in this book are coupled with examples and empirical experiments that illustrate the derived theoretical contributions.

There are no comments for this item.

Log in to your account to post a comment.