Relevant representations for the inference of rational stochastic tree languages
Channel: Laboratoire Hubert Curien
Date: 2016-09-20

Talk by Amaury Habrard at ICGI 2008

Relevant representations for the inference of rational stochastic tree languages (F. Denis, E. Gilbert, A. Habrard, F. Ouardi, M. Tommasi) 

Download the paper : https://hal.archives-ouvertes.fr/file/index/docid/320186/filename/RelevantRepRSTL.pdf

Abstract: Recently, an algorithm - DEES - was proposed for learning rational stochastic tree languages. Given a sample of trees independently and identically drawn according to a distribution defined by a rational stochastic language, DEES outputs a linear representation of a rational series which converges to the target. DEES can then be used to identify in the limit with probability one rational stochastic tree languages. However, when DEES deals with finite samples, it often outputs a rational tree series which does not define a stochastic language. Moreover, the linear representation can not be directly used as a generative model. In this paper, we show that any representation of a rational stochastic tree language can be transformed in a reduced normalised representation that can be used to generate trees from the underlying distribution. We also study some properties of consistency for rational stochastic tree languages and discuss their implication for the inference. We finally consider the applicability of DEES to trees built over an unranked alphabet.

License: Creative Commons CC BY-NC-ND 3.0
More information at http://videolectures.net/site/about/
More talks at http://videolectures.net/