什么时候网络是网络?路径和时序网络中的多阶图模型选择
When is a Network a Network? Multi-Order Graphical Model Selection in Pathways and Temporal Networks
摘要:
我们介绍了一个框架,用于建模的连续数据捕获路径中观察到的网络长度不同。这些数据很重要,例如,在研究信息网络中的点击流、交通系统中的旅行模式、社交网络中的信息级联、生物路径或带时间戳的社交互动时,虽然通常将图分析和网络分析应用于此类数据,但最近的工作表明,时间相关性可能会使此类方法的结果无效。这就提出了一个基本的问题:什么时候才能证明连续数据的网络抽象是合理的?为了解决这个悬而未决的问题,我们提出了一个框架,它结合了马尔可夫链的多个,更高的订单到一个多层的图形模型,捕捉时间相关性的途径,同时在多个长度尺度。我们开发了一种模型选择技术来推断这种模型的最佳层数,并表明它优于以前使用的马尔可夫顺序检测技术。八个真实世界的数据集上的路径和时间网络的应用程序表明,它可以推断图形模型,捕捉这些数据的拓扑和时间特性。我们的工作强调了网络抽象的谬误,并在合理的情况下为悬而未决的问题提供了原则性的答案。将网络表示推广到多阶图形模型,它为新的数据采掘和知识发现算法开辟了前景。
英文摘要:
We introduce a framework for the modeling of sequential data capturing pathways of varying lengths observed in a network. Such data are important, e.g., when studying click streams in information networks, travel patterns in transportation systems, information cascades in social networks, biological pathways or time-stamped social interactions. While it is common to apply graph analytics and network analysis to such data, recent works have shown that temporal correlations can invalidate the results of such methods. This raises a fundamental question: when is a network abstraction of sequential data justified? Addressing this open question, we propose a framework which combines Markov chains of multiple, higher orders into a multi-layer graphical model that captures temporal correlations in pathways at multiple length scales simultaneously. We develop a model selection technique to infer the optimal number of layers of such a model and show that it outperforms previously used Markov order detection techniques. An application to eight real-world data sets on pathways and temporal networks shows that it allows to infer graphical models which capture both topological and temporal characteristics of such data. Our work highlights fallacies of network abstractions and provides a principled answer to the open question when they are justified. Generalizing network representations to multi-order graphical models, it opens perspectives for new data mining and knowledge discovery algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。