arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.06294cs.LGstat.ML
收藏

非对称网络的层次聚类

Hierarchical Clustering of Asymmetric Networks

Stanford University(斯坦福大学);Ohio State University(俄亥俄州立大学);University of Pennsylvania(宾夕法尼亚大学)

Gunnar Carlsson, Facundo Mémoli, Alejandro Ribeiro, Santiago Segarra

摘要:

本文考虑的网络中,节点之间的关系表示的有向相异性。目标是研究基于相异度结构输出层次聚类的方法,即,由连接参数索引的嵌套分区族。我们的分层聚类方法的构建是围绕容许方法的概念构建的,容许方法是那些遵守价值公理的方法-具有两个节点的网络中的节点在它们之间的两个相异点中的最大值处聚集在一起-和变换-当相异点减少时,网络可能变得更聚集,但不是更少。两种特定的方法,称为互反聚类和非互反聚类,所示,以提供上界和下界的空间中的容许方法。此外,替代聚类方法和公理被认为是。特别是,修改公理的价值,使集群在两个节点的网络发生在最小的两个相异需要存在一个独特的容许聚类方法。

英文摘要:

This paper considers networks where relationships between nodes are represented by directed dissimilarities. The goal is to study methods that, based on the dissimilarity structure, output hierarchical clusters, i.e., a family of nested partitions indexed by a connectivity parameter. Our construction of hierarchical clustering methods is built around the concept of admissible methods, which are those that abide by the axioms of value - nodes in a network with two nodes are clustered together at the maximum of the two dissimilarities between them - and transformation - when dissimilarities are reduced, the network may become more clustered but not less. Two particular methods, termed reciprocal and nonreciprocal clustering, are shown to provide upper and lower bounds in the space of admissible methods. Furthermore, alternative clustering methodologies and axioms are considered. In particular, modifying the axiom of value such that clustering in two-node networks occurs at the minimum of the two dissimilarities entails the existence of a unique admissible clustering method.

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

↑