Formal Methods for Mining Structured Objects

Gemma C Garriga

ISBN 10: 3642430635 / ISBN 13: 9783642430633

Published by Springer Berlin Heidelberg, 2015

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9783642430633

Bibliographic Details

• Title: Formal Methods for Mining Structured Objects
• Publisher: Springer Berlin Heidelberg
• Publication Date: 2015
• Language: English
• ISBN 10: 3642430635
• ISBN 13: 9783642430633
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 7D millimeters 235 millimeters width by 155 millimeters height by 7 millimeters depth
• Weight: 195 grams

About this title

Synopsis

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.