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

Joint Graph and Vertex Importance Learning

Université de Rennes(雷恩大学);ENSAI(国立统计与信息分析学校);CNRS(法国国家科学研究中心);CREST-UMR 9194;University of Southern California(南加州大学)

Benjamin Girault, Eduardo Pavez, Antonio Ortega

英文摘要:

In this paper, we explore the topic of graph learning from the perspective of the Irregularity-Aware Graph Fourier Transform, with the goal of learning the graph signal space inner product to better model data. We propose a novel method to learn a graph with smaller edge weight upper bounds compared to combinatorial Laplacian approaches. Experimentally, our approach yields much sparser graphs compared to a combinatorial Laplacian approach, with a more interpretable model.

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

↑