# How to learn a graph from smooth signals

@article{Kalofolias2016HowTL,
title={How to learn a graph from smooth signals},
author={Vassilis Kalofolias},
journal={ArXiv},
year={2016},
volume={abs/1601.02513}
}
We propose a framework that learns the graph structure underlying a set of smooth signals. Given $X\in\mathbb{R}^{m\times n}$ whose rows reside on the vertices of an unknown graph, we learn the edge weights $w\in\mathbb{R}_+^{m(m-1)/2}$ under the smoothness assumption that $\text{tr}{X^\top LX}$ is small. We show that the problem is a weighted $\ell$-1 minimization that leads to naturally sparse solutions. We point out how known graph learning or construction techniques fall within our… CONTINUE READING

#### Citations

##### Publications citing this paper.
SHOWING 1-10 OF 95 CITATIONS

## Connecting the Dots: Identifying Network Structure via Graph Signal Processing

• IEEE Signal Processing Magazine
• 2019
VIEW 8 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

## Energy Efficient WSN: a Cross-layer Graph Signal Processing Solution to Information Redundancy

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

## Graph Learning Based on Spatiotemporal Smoothness for Time-Varying Graph Signal

• IEEE Access
• 2019
VIEW 6 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

## Graph Topology Inference Based on Sparsifying Transform Learning

• IEEE Transactions on Signal Processing
• 2019
VIEW 15 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

## Graph-time signal processing: Filtering and sampling strategies

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

## Time-varying Graph Learning Based on Sparseness of Temporal Variation

• ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
• 2019
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

## Why Graph Shift ?

Gonzalo Mateos, Santiago Segarra, Antonio G. Marques, Alejandro Ribeiro
• 2019
VIEW 8 EXCERPTS
HIGHLY INFLUENCED

## Graph Laplacian mixture model

• ArXiv
• 2018
VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

## Graph learning for regularized low rank matrix completion

VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

## Evaluating graph signal processing for neuroimaging through classification and dimensionality reduction

• 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP)
• 2017
VIEW 6 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

2016
2019

### CITATION STATISTICS

• 27 Highly Influenced Citations

• Averaged 28 Citations per year from 2017 through 2019

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

## 2015a To obtain Algorithm 1 (for our model), we need the following: K = S

Dong
• 2015
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

## Laplacian matrix learning for smooth graph signal representation

• 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
• 2015

## 2014b). “GSPBOX: A

Perraudin, Nathanaël
• 2014

## UNLocBoX A matlab

N Perraudin
• cessing systems
• 2014
VIEW 2 EXCERPTS

## Graph-Laplacian PCA: Closed-Form Solution and Robustness

• 2013 IEEE Conference on Computer Vision and Pattern Recognition
• 2013

AAAI. Zheng, Miao
• 2011
VIEW 1 EXCERPT

## Graph Regularized Nonnegative Matrix Factorization for Data Representation

• IEEE Transactions on Pattern Analysis and Machine Intelligence
• 2011

## Model Selection Through Sparse Maximum Likelihood Estimation for Multivariate Gaussian or Binary Data

• J. Mach. Learn. Res.
• 2008