arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.13573eess.SP
收藏

基于结构因子分析的低秩激励图信号中心节点检测

Detecting Central Nodes from Low-rank Excited Graph Signals via Structured Factor Analysis

Yiran He, Hoi-To Wai

摘要:

本文讨论了一个盲检测问题,以确定在一个图中的中心节点,从过滤的图形信号。不像以前的作品,对数据模型施加了很强的限制,我们只需要底层的图形过滤器,以满足低通属性与通用的低秩激励模型。我们根据低通图滤波器的强度处理两种情况。当图形滤波器是强低通时,即,它具有在高频处急剧下降的频率响应,我们表明主成分分析(PCA)方法以高精度检测中心节点。对于一般的低通图滤波器,我们表明,图形信号可以描述的结构化因子模型之间的产品具有低秩加稀疏因子和非结构化因子。我们提出了一个两阶段的分解算法来学习结构化因子模型,通过一个明智的组合的非负矩阵分解和强大的PCA算法。我们分析了该模型的可识别性条件,从而实现准确的中心节点检测。合成和真实数据的数值实验,以支持我们的研究结果。我们表现出显着的性能增益比以前的作品。

英文摘要:

This paper treats a blind detection problem to identify the central nodes in a graph from filtered graph signals. Unlike prior works which impose strong restrictions on the data model, we only require the underlying graph filter to satisfy a low pass property with a generic low-rank excitation model. We treat two cases depending on the low pass graph filter's strength. When the graph filter is strong low pass, i.e., it has a frequency response that drops sharply at the high frequencies, we show that the principal component analysis (PCA) method detects central nodes with high accuracy. For general low pass graph filter, we show that the graph signals can be described by a structured factor model featuring the product between a low-rank plus sparse factor and an unstructured factor. We propose a two-stage decomposition algorithm to learn the structured factor model via a judicious combination of the non-negative matrix factorization and robust PCA algorithms. We analyze the identifiability conditions for the model which lead to accurate central nodes detection. Numerical experiments on synthetic and real data are provided to support our findings. We demonstrate significant performance gains over prior works.

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

↑