Formal Methods for Mining Structured Objects

Gemma C Garriga

ISBN 10: 3642366805 / ISBN 13: 9783642366802

Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 2013, 2013

Riguardo questo articolo

Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 120 pp. Englisch.

Codice articolo 9783642366802

Dati bibliografici

• Titolo: Formal Methods for Mining Structured Objects
• Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 2013
• Data di pubblicazione: 2013
• Lingua: Inglese
• ISBN 10: 3642366805
• ISBN 13: 9783642366802
• Rilegatura: Buch
• Condizione: Neu
• Dimensioni: 241 L x 160 A x 12 P (millimetri) 241 millimetri di larghezza per 160 millimetri di altezza per 12 millimetri di profondità
• Peso: 354 grammi

Descrizione articolo

Riassunto

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.