arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.03266eess.SP
收藏

网络过程的拓扑感知联合图滤波与边权辨识

Topology-Aware Joint Graph Filter and Edge Weight Identification for Network Processes

Alberto Natali, Mario Coutino, Geert Leus

摘要:

定义在网络上的数据已成功地通过图形过滤器建模。然而,尽管在许多场景中网络的连接性是已知的,例如,智能电网、社交网络等,缺乏明确定义的交互权重阻碍了使用图过滤器对观察到的联网数据进行建模的能力。因此,在本文中,我们专注于联合识别的系数和图形权重定义的图形滤波器,最好的模型所观察到的输入/输出网络数据。虽然这两个问题主要是单独解决,我们在这里提出了一种迭代方法,利用知识的支持图的联合识别图滤波器系数和边缘权重。我们进一步表明,我们的迭代方案保证在每次迭代的成本不增加,确保全局收敛的行为。数值实验证实了我们所提出的方法的适用性。

英文摘要:

Data defined over a network have been successfully modelled by means of graph filters. However, although in many scenarios the connectivity of the network is known, e.g., smart grids, social networks, etc., the lack of well-defined interaction weights hinders the ability to model the observed networked data using graph filters. Therefore, in this paper, we focus on the joint identification of coefficients and graph weights defining the graph filter that best models the observed input/output network data. While these two problems have been mostly addressed separately, we here propose an iterative method that exploits the knowledge of the support of the graph for the joint identification of graph filter coefficients and edge weights. We further show that our iterative scheme guarantees a non-increasing cost at every iteration, ensuring a globally-convergent behavior. Numerical experiments confirm the applicability of our proposed approach.

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

↑