联系网络的三元分析
Triadic analysis of affiliation networks
摘要：
三元封闭已经被概念化，并以各种方式测量，最著名的是聚类系数。现有的扩展关系网络，但是，是敏感的重复组出席，这表现在二分模型作为biclique扩散。然而这种敏感性并不反映在社交网络的三元封闭的共同解释，本文提出了一种措施，三元封闭的隶属网络设计来控制it.To避免任意性，本文介绍了一个三元框架的隶属网络，在其中的措施范围可以定义，然后提出了一组基本公理，足以缩小这个范围的一个措施。工具评估比较了建议和现有的两种措施的可靠性，有效性，冗余性和实用性。所有这三种措施，然后参加调查的三个经验社交网络，这说明了他们的差异。
英文摘要：
Triadic closure has been conceptualized and measured in a variety of ways, most famously the clustering coefficient. Existing extensions to affiliation networks, however, are sensitive to repeat group attendance, which manifests in bipartite models as biclique proliferation. Whereas this sensitivity does not reflect common interpretations of triadic closure in social networks, this paper proposes a measure of triadic closure in affiliation networks designed to control for it. To avoid arbitrariness, the paper introduces a triadic framework for affiliation networks, within which a range of measures can be defined; it then presents a set of basic axioms that suffice to narrow this range to the one measure. An instrumental assessment compares the proposed and two existing measures for reliability, validity, redundancy, and practicality. All three measures then take part in an investigation of three empirical social networks, which illustrates their differences.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
