The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.
Learning Laplacian Matrix in Smooth Graph Signal Representations
Open accessAbstract
The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms for handling structured data, especially in the emerging field of graph signal processing. However, a meaningful graph is not always readily available from the data, nor easy to define depending on the application domain. In particular, it is often desirable in graph signal processing applications that a graph is chosen such that the data admit certain regularity or smoothness on the graph. In this paper, we address the problem of learning graph Laplacians, which is equivalent to learning graph topologies, such that the input data form graph signals with smooth variations on the resulting topology. To this end, we adopt a factor analysis model for the graph signals and impose a Gaussian probabilistic prior on the latent variables that control these signals. We show that the Gaussian prior leads to an efficient representation that favors the smoothness property of the graph signals. We then propose an algorithm for learning graphs that enforces such property and is based on minimizing the variations of the signals on the learned graph. Experiments on both synthetic and real world data demonstrate that the proposed graph learning framework can efficiently infer meaningful graph topologies from signal observations under the smoothness prior.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Representation Learning: A Review and New Perspectives
Bengio, Y., Courville, A., & Vincent, P. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.50 · Cited by 13,001
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Introduction to Information Retrieval
Manning, C. D., Raghavan, P., & Schütze, H. (2008) · doi:10.1017/cbo9780511809071 · Cited by 11,288
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Sparse inverse covariance estimation with the graphical lasso
Friedman, J., Hastie, T., & Tibshirani, R. (2008) · Biostatistics · doi:10.1093/biostatistics/kxm045 · Cited by 6,355
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Shuman, D. I., Narang, S. K., Frossard, P., Ortega, A., & Vandergheynst, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2235192 · Cited by 4,421
Self-citationProbabilistic Principal Component Analysis
Tipping, M. E., & Bishop, C. M. (1999) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00196 · Cited by 3,679
Graph Implementations for Nonsmooth Convex Programs
Grant, M. C., & Boyd, S. P. (2007) · Lecture Notes in Control and Information Sciences · doi:10.1007/978-1-84800-155-8_7 · Cited by 2,666
High dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · Cited by 2,539
High-dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · The Annals of Statistics · doi:10.1214/009053606000000281 · Cited by 2,521
Wavelets on graphs via spectral graph theory
Hammond, D. K., Vandergheynst, P., & Gribonval, R. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.04.005 · Cited by 2,171
Self-citationRue, H., & Held, L. (2005) · Chapman & Hall/CRC eBooks · doi:10.1201/9780203492024 · Cited by 1,823
Model selection and estimation in the Gaussian graphical model
Yuan, M., & Lin, Y. (2007) · Biometrika · doi:10.1093/biomet/asm018 · Cited by 1,627
Discrete Signal Processing on Graphs
Sandryhaila, A., & Moura, J. M. F. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2238935 · Cited by 1,531
Banerjee, O., Ghaoui, L. E., & d’Aspremont, A. (2007) · arXiv (Cornell University) · doi:10.1145/1390681.1390696 · Cited by 1,233
Latent Variable Models and Factor Analysis: A Unified Approach
Bartholomew, D., Knott, M., & Moustaki, I. (2011) · Wiley Series in Probability and Statistics · doi:10.1002/9781119970583 · Cited by 842
Kernels and Regularization on Graphs
Smola, A. J., & Kondor, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_12 · Cited by 841
Sparse Permutation Invariant Covariance Estimation
Rothman, A., Bickel, P. J., Levina, E., & Zhu, J. (2007) · Cited by 686
Sparse permutation invariant covariance estimation
Rothman, A. J., Bickel, P. J., Levina, E., & Zhu, J. (2008) · Electronic Journal of Statistics · doi:10.1214/08-ejs176 · Cited by 560
Latent Variable Models and Factor Analysis: A Unified Approach
Bartholomew, D. J., Knott, M. J., & Moustaki, I. (2011) · Cited by 499
Coifman, R. R., & Maggioni, M. (2006) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2006.04.004 · Cited by 491
Towards a theoretical foundation for Laplacian-based manifold methods
Belkin, M., & Niyogi, P. (2008) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.08.006 · Cited by 464
Statistical Factor Analysis and Related Methods: Theory and Applications
Basilevsky, A. (1994) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316894 · Cited by 449
Leonardi, N., Richiardi, J., Gschwind, M., Simioni, S., Annoni, J.-M., Schluep, M., Vuilleumier, P., & Van De Ville, D. (2013) · NeuroImage · doi:10.1016/j.neuroimage.2013.07.019 · Cited by 394
Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
Narang, S. K., & Ortega, A. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2188718 · Cited by 387
Vertex-frequency analysis on graphs
Shuman, D. I., Ricaud, B., & Vandergheynst, P. (2016) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2015.02.005 · Cited by 349
Self-citationFrom graph to manifold Laplacian: The convergence rate
Singer, A. (2006) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2006.03.004 · Cited by 316
From Graphs to Manifolds – Weak and Strong Pointwise Consistency of Graph Laplacians
Hein, M., Audibert, J.-Y., & von Luxburg, U. (2005) · Lecture Notes in Computer Science · doi:10.1007/11503415_32 · Cited by 270
Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation
Hsieh, C., Sustik, M. A., Dhillon, I. S., & Ravikumar, P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1306.3212 · Cited by 251
A Regularization Framework for Learning from Graph Data
Zhou, D., & Schölkopf, B. (2004) · Cited by 212
Loh, P.-L., & Wainwright, M. J. (2013) · The Annals of Statistics · doi:10.1214/13-aos1162 · Cited by 186
Graph Wavelets for Multiscale Community Mining
Tremblay, N., & Borgnat, P. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2345355 · Cited by 170
Gavish, M., Nadler, B., & Coifman, R. R. (2010) · Cited by 169
A Spectral Graph Uncertainty Principle
Agaskar, A., & Lu, Y. M. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2252233 · Cited by 167
Clustering With Multi-Layer Graphs: A Spectral Perspective
Dong, X., Frossard, P., Vandergheynst, P., & Nefedov, N. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2212886 · Cited by 158
Self-citationEdge-adaptive transforms for efficient depth map coding
Shen, G., Kim, W.-S., Narang, S. K., Ortega, A., Lee, J., & Wey, H.-C. (2010) · Picture Coding Symposium · doi:10.1109/pcs.2010.5702565 · Cited by 158
Approximating signals supported on graphs
Zhu, X., & Rabbat, M. (2012) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2012.6288775 · Cited by 149
Spectrum-Adapted Tight Graph Wavelet and Vertex-Frequency Frames
Shuman, D. I., Wiesmeyr, C., Holighaus, N., & Vandergheynst, P. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2424203 · Cited by 146
Self-citationCombining Graph Laplacians for Semi--Supervised Learning
Argyriou, A. A., Herbster, M., & Pontil, M. (2005) · Cited by 123
A windowed graph Fourier transform
Shuman, D. I., Ricaud, B., & Vandergheynst, P. (2012) · IEEE Statistical Signal Processing Workshop (SSP) · doi:10.1109/ssp.2012.6319640 · Cited by 120
Self-citationLearning Parametric Dictionaries for Signals on Graphs
Thanou, D., Shuman, D. I., & Frossard, P. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2332441 · Cited by 119
Self-citationSemi-supervised learning : from Gaussian fields to Gaussian processes
Zhu, X., Lafferty, J., & Ghahramani, Z. (2018) · doi:10.1184/r1/6609434.v1 · Cited by 116
Should Penalized Least Squares Regression be Interpreted as Maximum A Posteriori Estimation?
Gribonval, R. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2107908 · Cited by 116
Fitting a graph to vector data
Daitch, S. I., Kelner, J. A., & Spielman, D. A. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553400 · Cited by 111
Analyzing the Optimality of Predictive Transform Coding Using Graph-Based Models
Zhang, C., & Florencio, D. A. F. (2012) · IEEE Signal Processing Letters · doi:10.1109/lsp.2012.2230165 · Cited by 105
Generalized Tree-Based Wavelet Transform
Ram, I., Elad, M., & Cohen, I. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2158428 · Cited by 87
Laplacian matrix learning for smooth graph signal representation
Dong, X., Thanou, D., Frossard, P., & Vandergheynst, P. (2015) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2015.7178669 · Cited by 58
Self-citationA graph theoretical regression model for brain connectivity learning of Alzheimer'S disease
Hu, C., Cheng, L., Sepulcre, J., Fakhri, G. E., Lu, Y. M., & Li, Q. (2013) · IEEE International Symposium on Biomedical Imaging (ISBI) · doi:10.1109/isbi.2013.6556550 · Cited by 34
Matched Signal Detection on Graphs: Theory and Application to Brain Network Classification
Hu, C., Cheng, L., Sepulcre, J., Fakhri, G. E., Lu, Y. M., & Li, Q. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38868-2_1 · Cited by 12
Shivaswamy, P. K., & Jebara, T. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15939-8_17 · Cited by 10
Cited by
Learning Graphs From Data: A Signal Representation Perspective
Dong, X., Thanou, D., Rabbat, M., & Frossard, P. (2019) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2887284 · Cited by 406
Self-citationConnecting the Dots: Identifying Network Structure via Graph Signal Processing
Mateos, G., Segarra, S., Marques, A. G., & Ribeiro, A. (2019) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2890143 · Cited by 369
Fully Decentralized Joint Learning of Personalized Models and Collaboration Graphs
Zantedeschi, V., Bellet, A., & Tommasi, M. (2019) · arXiv · doi:10.48550/arxiv.1901.08460 · Cited by 38
Metadata
- Authors
- Dong, X., Thanou, D., Frossard, P., & Vandergheynst, P.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2016-12
- Volume
- 64
- Issue
- 23
- Pages
- 6160-6173
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2964012239
- Cited by
- 640
- References
- 57
- FWCI
- 41.22
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.