arrow
返回

Temporal Multiresolution Graph Learning

delete2021-01-01
delete1
delete
OA
AI
K
K. Yamada *
Y
Yuichi Tanaka
DOI:10.1109/ACCESS.2021.3120994delete
delete原文链接
delete分享
delete收藏
摘要

摘要

En 中文
Estimating time-varying graphs, i.e., a set of graphs in which one graph represents the relationship among nodes in a certain time slot, from observed data is a crucial problem in signal processing, machine learning, and data mining. Although many existing methods only estimate graphs with a single temporal resolution, the actual graphs often demonstrate different relationships in different temporal resolutions. In this study, we propose an approach for time-varying graph learning by leveraging a multiresolution property. The proposed method assumes that time-varying graphs can be decomposed by a linear combination of graphs localized at different temporal resolutions. We formulate a convex optimization problem for temporal multiresolution graph learning. In experiments using synthetic and real data, the proposed method demonstrates the promising objective performances for synthetic data, and obtains reasonable temporal multiresolution graphs from real data.
Keyword:
Signal resolution
Laplace equations
Spatial resolution
Optimization
Brain modeling
Mathematical models
Licenses
Graph inference
graph learning
time-varying graph
temporal multiresolution graph

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

暂无机构信息
引用论文

引用论文

Connecting the Dots
err2019-05-01
err246
errOAAI
errMateos, Gonzalo; Segarra, Santiago; Marques, Antonio G.; Ribeiro, Alejandro
err分享
err收藏
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
err分享
err收藏
Graph Signal Processing: Overview, Challenges, and Applications图信号处理: 概述、挑战与应用
err2018-05-01
err1.1K
errOAAI
errOrtega, Antonio; Frossard, Pascal; Kovacevic, Jelena; Moura, Jose M. F.; Vandergheynst, Pierre
err分享
err收藏
学者 查看更多内容