Mankad Shawn, Michailidis George
Department of Statistics, University of Michigan, Ann Arbor, Michigan 48109-1107, USA.
Phys Rev E Stat Nonlin Soft Matter Phys. 2013 Oct;88(4):042812. doi: 10.1103/PhysRevE.88.042812. Epub 2013 Oct 17.
Time series of graphs are increasingly prevalent in modern data and pose unique challenges to visual exploration and pattern extraction. This paper describes the development and application of matrix factorizations for exploration and time-varying community detection in time-evolving graph sequences. The matrix factorization model allows the user to home in on and display interesting, underlying structure and its evolution over time. The methods are scalable to weighted networks with a large number of time points or nodes and can accommodate sudden changes to graph topology. Our techniques are demonstrated with several dynamic graph series from both synthetic and real-world data, including citation and trade networks. These examples illustrate how users can steer the techniques and combine them with existing methods to discover and display meaningful patterns in sizable graphs over many time points.
图表的时间序列在现代数据中越来越普遍,给视觉探索和模式提取带来了独特的挑战。本文描述了矩阵分解在时间演化图序列中的探索和时变社区检测的开发与应用。矩阵分解模型允许用户关注并展示有趣的潜在结构及其随时间的演变。这些方法可扩展到具有大量时间点或节点的加权网络,并且能够适应图拓扑结构的突然变化。我们用来自合成数据和真实世界数据的几个动态图序列(包括引文网络和贸易网络)展示了我们的技术。这些例子说明了用户如何运用这些技术并将它们与现有方法相结合,以在大量时间点的大型图中发现并展示有意义的模式。