arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1207.4120cs.AI
收藏

稳定的独立性和表示的复杂性

Stable Independance and Complexity of Representation

Utrecht University(乌得勒支大学)

Peter de Waal, Linda C. van der Gaag

摘要:

独立关系的表示通常建立在著名的独立半图公理之上。最近,已经提出了一种表示,它捕获了一组独立关系的主导陈述,任何其他陈述都可以通过公理生成;这组陈述的基数被用来表示关系的复杂性。基于优势的思想,我们引入了稳定性的概念,以提供一个更紧凑的独立性表示。我们给出了一个相关的算法,建立这样的representation.We表明,与我们的概念的稳定性,许多独立的关系被发现是较低的复杂性比现有的表示。

英文摘要:

The representation of independence relations generally builds upon the well-known semigraphoid axioms of independence. Recently, a representation has been proposed that captures a set of dominant statements of an independence relation from which any other statement can be generated by means of the axioms; the cardinality of this set is taken to indicate the complexity of the relation. Building upon the idea of dominance, we introduce the concept of stability to provide for a more compact representation of independence. We give an associated algorithm for establishing such a representation.We show that, with our concept of stability, many independence relations are found to be of lower complexity than with existing representations.

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

↑