Learning tree patterns from example graphs

Sara Cohen, Yaacov Y. Weiss

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

This paper investigates the problem of learning tree patterns that return nodes with a given set of labels, from example graphs provided by the user. Example graphs are annotated by the user as being either positive or negative. The goal is then to determine whether there exists a tree pattern returning tuples of nodes with the given labels in each of the positive examples, but in none of the negative examples, and, furthermore, to find one such pattern if it exists. These are called the satisfiability and learning problems, respectively. This paper thoroughly investigates the satisfiability and learning problems in a variety of settings. In particular, we consider example sets that (1) may contain only positive examples, or both positive and negative examples, (2) may contain directed or undirected graphs, and (3) may have multiple occurrences of labels or be uniquely labeled (to some degree). In addition, we consider tree patterns of different types that can allow, or prohibit, wildcard labeled nodes and descendant edges. We also consider two different semantics for mapping tree patterns to graphs. The complexity of satisfiability is determined for the different combinations of settings. For cases in which satisfiability is polynomial, it is also shown that learning is polynomial. (This is non-trivial as satisfying patterns may be exponential in size.) Finally, the minimal learning problem, i.e., that of finding a minimal-sized satisfying pattern, is studied for cases in which satisfiability is polynomial.

Original languageAmerican English
Title of host publication18th International Conference on Database Theory, ICDT 2015
EditorsMarcelo Arenas, Martin Ugarte
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages127-143
Number of pages17
ISBN (Electronic)9783939897798
DOIs
StatePublished - 2015
Event18th International Conference on Database Theory, ICDT 2015 - Brussels, Belgium
Duration: 23 Mar 201527 Mar 2015

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume31
ISSN (Print)1868-8969

Conference

Conference18th International Conference on Database Theory, ICDT 2015
Country/TerritoryBelgium
CityBrussels
Period23/03/1527/03/15

Bibliographical note

Publisher Copyright:
© Sara Cohen and Yaacov Weiss.

Keywords

  • Examples
  • Learning
  • Tree patterns

Fingerprint

Dive into the research topics of 'Learning tree patterns from example graphs'. Together they form a unique fingerprint.

Cite this