arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.09522cs.ITeess.SPmath.IT
收藏

谱稀疏约束下的图学习

Graph learning under spectral sparsity constraints

B. Subbareddy, Aditya Siripuram, Jingxin Zhang

摘要:

图推理在机器学习、模式识别和分类中起着至关重要的作用。文献中基于信号处理的方法通常假设图上观测数据的某些变分性质。我们做了一个推理的情况下,观察到的数据具有很高的变化图。我们提出了一个基于信号处理的推理模型,允许宽带频率变化的数据,并提出了一个算法图推理。该算法由两个步骤组成:1)从数据中学习图的正交特征向量; 2)从给定的图特征向量中恢复图拓扑的邻接矩阵。第一步是解决了一个封闭形式的解决方案的迭代算法。在第二步中,通过求解凸优化问题从特征向量推断邻接矩阵。在合成数据上的数值结果表明,在宽带假设下,该算法能有效地从观测数据中捕获有意义的图拓扑.

英文摘要:

Graph inference plays an essential role in machine learning, pattern recognition, and classification. Signal processing based approaches in literature generally assume some variational property of the observed data on the graph. We make a case for inferring graphs on which the observed data has high variation. We propose a signal processing based inference model that allows for wideband frequency variation in the data and propose an algorithm for graph inference. The proposed inference algorithm consists of two steps: 1) learning orthogonal eigenvectors of a graph from the data; 2) recovering the adjacency matrix of the graph topology from the given graph eigenvectors. The first step is solved by an iterative algorithm with a closed-form solution. In the second step, the adjacency matrix is inferred from the eigenvectors by solving a convex optimization problem. Numerical results on synthetic data show the proposed inference algorithm can effectively capture the meaningful graph topology from observed data under the wideband assumption.

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

↑