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

不考虑三角剖分的聚类

Clustering Without (Thinking About) Triangulation

University of Washington(华盛顿大学)

Denise L. Draper

摘要:

用于评估信念网络的无向技术[Jensen等人,1990年,Lauritzen和Spiegelhalter,1988年]要求将网络中的节点聚类到连接树中。在传统观点中,联合树是从道德化和三角化的信念网络的派系中构建的:三角化被视为原始概念,是任何聚类算法(例如节点消除)的目标。在本文中,我们提出了另一种概念的集群,其中集群和连接树属性扮演的角色的原语:给定一个图(不是树)的集群服从(修改版本)的连接树属性,我们转换这个图,直到我们得到一棵树。这种方法有几个优点:它更清晰,更容易理解,这对构建信念网络的人来说很重要;它允许更广泛的分类,这可能会实现更有效或更好的聚类算法;它作为增量聚类方案的自然基础,我们描述。

英文摘要:

The undirected technique for evaluating belief networks [Jensen, et.al., 1990, Lauritzen and Spiegelhalter, 1988] requires clustering the nodes in the network into a junction tree. In the traditional view, the junction tree is constructed from the cliques of the moralized and triangulated belief network: triangulation is taken to be the primitive concept, the goal towards which any clustering algorithm (e.g. node elimination) is directed. In this paper, we present an alternative conception of clustering, in which clusters and the junction tree property play the role of primitives: given a graph (not a tree) of clusters which obey (a modified version of) the junction tree property, we transform this graph until we have obtained a tree. There are several advantages to this approach: it is much clearer and easier to understand, which is important for humans who are constructing belief networks; it admits a wider range of heuristics which may enable more efficient or superior clustering algorithms; and it serves as the natural basis for an incremental clustering scheme, which we describe.

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

↑