Data Analytics on Graphs Part II: Signals on Graphs
DOI10.1561/2200000078-2OpenAlexW3108029334MaRDI QIDQ5094177
Miloš Daković, Ljubisa Stanković, A. G. Constantinides, Miloš Brajović, Shengxi Li, Bruno Scalzo, Danilo P. Mandic
Publication date: 2 August 2022
Published in: Foundations and Trends® in Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/2200000078-2
graph theorysystems on graphssignal processing on graphsgraph neural networksmachine learning on graphsbig data on graphsgraph topology learninggraphs and tensorsrandom data on graphsvertex-frequency estimation
Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (3)
Cites Work
- Unnamed Item
- Wavelets on graphs via spectral graph theory
- A survey of uncertainty principles and some signal processing applications
- Vertex-frequency analysis on graphs
- The restricted isometry property and its implications for compressed sensing
- Random sampling of bandlimited signals on graphs
- Vertex-frequency analysis of graph signals
- Treelets -- an adaptive multi-scale basis for sparse unordered data
- Local smoothness of graph signals
- Diffusion polynomial frames on metric measure spaces
- The Haar wavelet transform of a dendrogram
- Diffusion maps
- Multiscale Methods for Data on Graphs and Irregular Multidimensional Situations
- $\ell_1$ Trend Filtering
- Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
- Discrete Signal Processing on Graphs
- Tight Wavelet Frames on Multislice Graphs
- Discrete Signal Processing on Graphs: Frequency Analysis
- <formula formulatype="inline"><tex Notation="TeX">$M$</tex> </formula>-Channel Oversampled Graph Filter Banks
- Oversampled Graph Laplacian Matrix for Graph Filter Banks
- Downsampling of Signals on Graphs Via Maximum Spanning Trees
- Local-Set-Based Graph Signal Reconstruction
- Signal Recovery on Graphs: Variation Minimization
- Discrete Signal Processing on Graphs: Sampling Theory
- Signal Decomposition by Using the S-Method With Application to the Analysis of HF Radar Signals in Sea-Clutter
- Stability and Continuity of Centrality Measures in Weighted Graphs
- Sampling of Graph Signals With Successive Local Aggregations
- Signals on Graphs: Uncertainty Principle and Sampling
- Signal-Adapted Tight Frames on Graphs
- A Time-Vertex Signal Processing Framework: Scalable Processing and Meaningful Representations for Time-Series on Graphs
- Filtering Random Graph Processes Over Random Time-Varying Graphs
- Stationary Graph Processes and Spectral Estimation
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Subgraph-Based Filterbanks for Graph Signals
- Stationary Signal Processing on Graphs
- On the Shift Operator, Graph Frequency, and Optimal Filtering in Graph Signal Processing
- A generalized uncertainty principle and sparse representation in pairs of bases
- Generalized Sampling on Graphs With Subspace and Smoothness Priors
- Controllability of Bandlimited Graph Processes Over Random Time Varying Graphs
- Scalable $M$-Channel Critically Sampled Filter Banks for Graph Signals
- A Spectral Graph Uncertainty Principle
- A measure of some time-frequency distributions concentration.
This page was built for publication: Data Analytics on Graphs Part II: Signals on Graphs
