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

图聚类的无分辨率限和局部非负矩阵分解质量函数

Resolution-limit-free and local Non-negative Matrix Factorization quality functions for graph clustering

Twan van Laarhoven, Elena Marchiori

摘要:

许多图聚类质量函数受到分辨率限制,无法在大型图中找到小簇。所谓的无分辨率限制的质量函数没有这个限制。此属性以前是为硬聚类(即图分区)引入的。我们研究了硬图和软图聚类的非负矩阵分解(NMF)的无分辨率限制特性。要在硬集群设置中使用NMF,一种常见的方法是将每个节点分配到其最高成员资格集群。我们表明,在这种情况下,对称NMF是不分辨率限制自由,但它成为这样的硬度约束时,作为优化的一部分。由此产生的函数与常数波茨模型密切相关。在软集群中,节点可以属于多个集群,具有不同的成员关系。在这种情况下,无分辨率限制的属性太强了。因此,我们引入局部性,它大致说明改变图的一部分不会影响图的其他部分的聚类。我们认为,这是一个理想的属性,提供条件下,NMF质量函数是本地的,并提出了一种新的本地概率NMF质量函数的软图聚类。

英文摘要:

Many graph clustering quality functions suffer from a resolution limit, the inability to find small clusters in large graphs. So called resolution-limit-free quality functions do not have this limit. This property was previously introduced for hard clustering, that is, graph partitioning. We investigate the resolution-limit-free property in the context of Non-negative Matrix Factorization (NMF) for hard and soft graph clustering. To use NMF in the hard clustering setting, a common approach is to assign each node to its highest membership cluster. We show that in this case symmetric NMF is not resolution-limit-free, but that it becomes so when hardness constraints are used as part of the optimization. The resulting function is strongly linked to the Constant Potts Model. In soft clustering, nodes can belong to more than one cluster, with varying degrees of membership. In this setting resolution-limit-free turns out to be too strong a property. Therefore we introduce locality, which roughly states that changing one part of the graph does not affect the clustering of other parts of the graph. We argue that this is a desirable property, provide conditions under which NMF quality functions are local, and propose a novel class of local probabilistic NMF quality functions for soft graph clustering.

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

↑