Eigendecomposition-Free Sampling Set Selection for Graph Signals

DOI10.1109/TSP.2019.2908129zbMath1458.94123arXiv1809.01827OpenAlexW2890403598WikidataQ128143307 ScholiaQ128143307MaRDI QIDQ5238811

Toshihisa Tanaka, Antonio Ortega, Akie Sakiyama, Yu-ichi Tanaka

Publication date: 28 October 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.01827

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Related Items (3)

Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ A low discrepancy sequence on graphs

This page was built for publication: Eigendecomposition-Free Sampling Set Selection for Graph Signals