arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.8088cs.LGcs.DS
收藏

上下文相关独立性约束下Markov网络结构学习的Grow-Shrink策略

The Grow-Shrink strategy for learning Markov network structures constrained by context-specific independences

Universidad Tecnológica Nacional(国家理工大学)

Alejandro Edera, Yanela Strappa, Facundo Bromberg

摘要:

马尔可夫网络是表示复杂概率分布的计算机模型。它们由一个结构和一组数值权重组成。该结构定性地描述了分布中的独立性,这可以用来将分布分解为一组紧凑的函数。从数据中学习结构的一个关键应用是自动发现知识。在实践中,专注于“知识发现”的结构学习算法存在一个局限性:它们使用结构的粗粒度表示。因此,这种表示不能描述特定于上下文的独立性。最近,设计了一种称为CSPC的算法来克服这种限制,但它具有高计算复杂性。这项工作试图减轻这个缺点,提出CSGS,一种算法,使用增长收缩策略,以减少不必要的计算。在经验评估上,通过CSGS学习的结构相对于通过CSPC获得的结构实现了具有竞争力的精度和较低的计算复杂性。

英文摘要:

Markov networks are models for compactly representing complex probability distributions. They are composed by a structure and a set of numerical weights. The structure qualitatively describes independences in the distribution, which can be exploited to factorize the distribution into a set of compact functions. A key application for learning structures from data is to automatically discover knowledge. In practice, structure learning algorithms focused on "knowledge discovery" present a limitation: they use a coarse-grained representation of the structure. As a result, this representation cannot describe context-specific independences. Very recently, an algorithm called CSPC was designed to overcome this limitation, but it has a high computational complexity. This work tries to mitigate this downside presenting CSGS, an algorithm that uses the Grow-Shrink strategy for reducing unnecessary computations. On an empirical evaluation, the structures learned by CSGS achieve competitive accuracies and lower computational complexity with respect to those obtained by CSPC.

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

↑