arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0807.2983cs.LG
收藏

关于树的概率分布:表示、推理和学习

On Probability Distributions for Trees: Representations, Inference and Learning

Laboratoire d’Informatique Fondamentale de Marseille (L.I.F.)(马赛基础信息实验室);UMR CNRS 6166(法国国家科学研究中心6166联合研究单位);INRIA Futurs(法国国家信息与自动化研究所未来分部);Lille University(里尔大学);ÉNS de Cachan, Brittany extension(卡尚高等师范学院布列塔尼分校)

François Denis, Amaury Habrard, Rémi Gilleron, Marc Tommasi, Édouard Gilbert

摘要:

本文研究树的自由代数上的概率分布。概率分布可以看作是特殊的(形式幂)树序列[Berstel et al 82,Esik et al 03],即从树到半环K的映射。一类被广泛研究的树级数是有理(或可识别)树级数,它可以用代数方法或多重树自动机来定义。我们认为,代数表示是非常方便的模型概率分布的树的自由代数。首先,在字符串的情况下,代数表示允许设计学习算法的概率分布定义的有理树系列的整个类。注意,有理树序列的学习算法对应于加权树自动机的学习算法,其中结构和权重都被学习。其次,代数表示可以很容易地扩展到处理未排名的树(如XML树,其中符号可能有无限数量的子节点)。这两个属性都与应用程序特别相关:非确定性自动机需要推理问题相关(回忆隐马尔可夫模型等价于非确定性字符串自动机);现在Web信息抽取,Web服务和文档处理的应用程序考虑未排名的树。

英文摘要:

We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied class of tree series is the class of rational (or recognizable) tree series which can be defined either in an algebraic way or by means of multiplicity tree automata. We argue that the algebraic representation is very convenient to model probability distributions over a free algebra of trees. First, as in the string case, the algebraic representation allows to design learning algorithms for the whole class of probability distributions defined by rational tree series. Note that learning algorithms for rational tree series correspond to learning algorithms for weighted tree automata where both the structure and the weights are learned. Second, the algebraic representation can be easily extended to deal with unranked trees (like XML trees where a symbol may have an unbounded number of children). Both properties are particularly relevant for applications: nondeterministic automata are required for the inference problem to be relevant (recall that Hidden Markov Models are equivalent to nondeterministic string automata); nowadays applications for Web Information Extraction, Web Services and document processing consider unranked trees.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑