arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.08478stat.MEcs.LGcs.SI
收藏

时间相关分组观测的网络推断

Network Inference from Temporal-Dependent Grouped Observations

Arizona State University(亚利桑那州立大学)

Yunpeng Zhao

摘要:

在社会网络分析中,观察到的数据通常是一些社会行为,如群体的形成,而不是一个明确的网络结构。Zhao和Weko(2017)提出了一种基于模型的方法,称为枢纽模型,用于从分组观察中推断隐式网络。中心模型假设组之间的独立性,这在实践中有时是无效的。在这篇文章中,我们将枢纽模型的思想推广到具有时间依赖性的分组观测的情况。在枢纽模型中,我们假设每个时间点的群体都由一个领导者聚集。与中心模型不同,组长不是独立采样的,而是遵循马尔可夫链,相邻组中的其他成员也可以相关。针对该模型提出了一种期望最大化(EM)算法,并针对E步提出了一种多项式时间算法。新模型的性能进行了评估,在不同的模拟设置。我们将此模型应用于Kibale黑猩猩项目的数据集。

英文摘要:

In social network analysis, the observed data is usually some social behavior, such as the formation of groups, rather than an explicit network structure. Zhao and Weko (2017) propose a model-based approach called the hub model to infer implicit networks from grouped observations. The hub model assumes independence between groups, which sometimes is not valid in practice. In this article, we generalize the idea of the hub model into the case of grouped observations with temporal dependence. As in the hub model, we assume that the group at each time point is gathered by one leader. Unlike in the hub model, the group leaders are not sampled independently but follow a Markov chain, and other members in adjacent groups can also be correlated. An expectation-maximization (EM) algorithm is developed for this model and a polynomial-time algorithm is proposed for the E-step. The performance of the new model is evaluated under different simulation settings. We apply this model to a data set of the Kibale Chimpanzee Project.

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

↑