Logo - springer
Slogan - springer

Engineering - Computational Intelligence and Complexity | Formal Methods for Mining Structured Objects

Formal Methods for Mining Structured Objects

Garriga, Gemma C

2013, X, 109 p. 51 illus.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-642-36681-9

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-642-36680-2

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

  • Recent research on Mining Structured Objects
  • State-of-the art of Formal Methods for Mining Structured Objects
  • Written by a leading expert in the field

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.

Content Level » Research

Keywords » Computational Intelligence - Formal Methods - Mining Structured Objects

Related subjects » Artificial Intelligence - Computational Intelligence and Complexity

Table of contents 

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

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Computational Intelligence.