arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0909.1819physics.soc-ph
收藏

动态引文网络的距离测度

Distance Measures for Dynamic Citation Networks

Michael J. Bommarito, Daniel Martin Katz, Jon Zelner, James H. Fowler

摘要:

无圈有向图出现在许多自然和人工过程中。在更广泛的集合中,动态引用网络代表了非循环有向图的一种非常重要的形式。例如,对这种网络的研究包括通过学术引用传播思想,通过专利引用传播创新,以及普通法体系中先例的发展。产生这种非循环有向图的特定动力学不仅将它们与其他类别的图区分开来,而且还为有意义的距离度量的发展提供了指导。在这篇文章中,我们开发和应用我们的汇距离测量与单链接层次聚类算法,以两个二维定向偏好连接模型以及来自美国最高法院的决定的第一个季度世纪的经验数据。尽管应用最简单的组合的距离测量和聚类算法,分析表明,更准确和更可解释的聚类产生的这个计划。

英文摘要:

Acyclic digraphs arise in many natural and artificial processes. Among the broader set, dynamic citation networks represent a substantively important form of acyclic digraphs. For example, the study of such networks includes the spread of ideas through academic citations, the spread of innovation through patent citations, and the development of precedent in common law systems. The specific dynamics that produce such acyclic digraphs not only differentiate them from other classes of graphs, but also provide guidance for the development of meaningful distance measures. In this article, we develop and apply our sink distance measure together with the single-linkage hierarchical clustering algorithm to both a two-dimensional directed preferential attachment model as well as empirical data drawn from the first quarter century of decisions of the United States Supreme Court. Despite applying the simplest combination of distance measures and clustering algorithms, analysis reveals that more accurate and more interpretable clusterings are produced by this scheme.

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

↑