网络上大时间序列数据的因果路径计数
Counting Causal Paths in Big Times Series Data on Networks
摘要:
图或网络表示是关系数据中数据采掘和机器学习任务的重要基础。许多网络分析工具,如中心性度量、信息排序或聚类检测,都基于这样的假设:链接捕捉直接影响,路径代表可能的间接影响。这种假设在带时间戳的网络数据捕获中是无效的,例如,动态社交网络、生物序列或金融交易。在这样的数据中,对于两个带时间戳的链路(A,B)和(B,C),时间顺序和定时确定是否存在从节点A经由B到C的因果路径。许多工作表明,由于这个原因,网络分析不能直接应用于时间戳网络数据。解决这个问题的现有方法需要对因果路径进行统计,这对于大数据集来说在计算上具有挑战性。为了解决这个问题,我们开发了一个有效的算法来计算因果路径的时间戳网络数据。将其应用于经验数据,我们表明,我们的方法比在开源数据分析包中实现的基线方法更有效。我们的方法可以有效地为不同值的因果路径的连续链接之间的最大时间差,并支持流的情况。有了它,我们正在缩小阻碍复杂网络上大规模时间序列数据有效分析的差距。
英文摘要:
Graph or network representations are an important foundation for data mining and machine learning tasks in relational data. Many tools of network analysis, like centrality measures, information ranking, or cluster detection rest on the assumption that links capture direct influence, and that paths represent possible indirect influence. This assumption is invalidated in time-stamped network data capturing, e.g., dynamic social networks, biological sequences or financial transactions. In such data, for two time-stamped links (A,B) and (B,C) the chronological ordering and timing determines whether a causal path from node A via B to C exists. A number of works has shown that for that reason network analysis cannot be directly applied to time-stamped network data. Existing methods to address this issue require statistics on causal paths, which is computationally challenging for big data sets. Addressing this problem, we develop an efficient algorithm to count causal paths in time-stamped network data. Applying it to empirical data, we show that our method is more efficient than a baseline method implemented in an OpenSource data analytics package. Our method works efficiently for different values of the maximum time difference between consecutive links of a causal path and supports streaming scenarios. With it, we are closing a gap that hinders an efficient analysis of big time series data on complex networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。