Laplacian matrix learning for smooth graph signal representation

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn 2015-August, Issue , 2015, Pages 3736-3740

  Dong, Xiaowen ^a   Thanou, Dorina ^b   Frossard, Pascal ^b   Vandergheynst, Pierre ^b  

^a MIT MEDIA LAB   (United States)

^b EPFL   (Switzerland)

Author keywords

factor analysis; Gaussian prior; Graph learning; graph signal processing; representation theory

Indexed keywords

AUDIO SIGNAL PROCESSING; FACTOR ANALYSIS; GAUSSIAN DISTRIBUTION; LEARNING ALGORITHMS; MATRIX ALGEBRA; MULTIVARIANT ANALYSIS; SPEECH COMMUNICATION;

FACTOR ANALYSIS MODEL; GAUSSIAN PRIORS; GRAPH LEARNING; LAPLACIAN MATRICES; LEARNING GRAPHS; REPRESENTATION THEORY; SIGNAL PROCESSING ON GRAPHS; SIGNAL REPRESENTATIONS;

TOPOLOGY;

EID: 84946097309     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2015.7178669     Document Type: Conference Paper

References (18)

1. D. I Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst,The emerging field of signal processing ongraphs: Extending high-dimensional data analysis to networksand other irregular domains, IEEE Signal Processing Magazine,vol. 30, no. 3, pp. 83-98, May 2013
2. A. Sandryhaila and J. M. F. Moura, Discrete signal processingon graphs, IEEE Transactions on Signal Processing, vol. 61,no. 7, pp. 1644-1656, Apr 2013
3. Y. Bengio, A. Courville, and P. Vincent, Representation learning:A review and new perspectives, IEEE Transactions onPattern Analysis and Machine Intelligence, vol. 35, no. 8, pp. 1798-1828, Aug 2013
4. A. Ng, M. Jordan, and Y. Weiss, On spectral clustering: Analysisand an algorithm, in Advances in Neural InformationProcessing Systems 14 (NIPS), 2001, pp. 849-856
5. O. Banerjee, L. E. Ghaoui, and A. d'Aspremont, Model selectionthrough sparse maximum likelihood estimation for multivariateGaussian or binary data, Journal of Machine LearningResearch, vol. 9, pp. 485-516, Jun 2008
6. J. Friedman, T. Hastie, and R. Tibshirani, Sparse inverse covarianceestimation with the graphical lasso, Biostatistics, vol. 9, no. 3, pp. 432-441, Jul 2008
7. B. Lake and J. Tenenbaum, Discovering structure by learningsparse graph, in Proceedings of the 33rd Annual CognitiveScience Conference, 2010
8. D. J. Bartholomew, M. Knott, and I. Moustaki, Latent variablemodels and factor analysis: A unified approach, 3rd Edition,Wiley, Jul 2011
9. A. Basilevsky, Statistical factor analysis and related methods,Wiley, Jun 1994
10. F. R. K. Chung, Spectral graph theory, American MathematicalSociety, 1997
11. R. Gribonval, Should penalized least squares regression be interpretedas maximum a posteriori estimation?, IEEE Transactionson Signal Processing, vol. 59, no. 5, pp. 2405-2410,May 2011
12. D. Zhou and B. Scholkopf, A regularization framework forlearning from graph data, in ICML Workshop on StatisticalRelational Learning, 2004, pp. 132-137
13. X. Dong, D. Thanou, P. Frossard, and P. Vandergheynst,Learning Graphs from Signal Observations under SmoothnessPrior, in arXiv:1406. 7842, 2014
14. C. Hu, L. Cheng, J. Sepulcre, G. E. Fakhri, Y. M. Lu, and Q. Li,A graph theoretical regression model for brain connectivitylearning of Alzheimer's disease, in Proceedings of the IEEEInternational Symposium on Biomedical Imaging (ISBI), 2013
15. M. Grant and S. Boyd, CVX: Matlab software for disciplinedconvex programming, version 2. 0 beta, http://cvxr. com/cvx, September 2013
16. M. Grant and S. Boyd, Graph implementations for nonsmoothconvex programs, in Recent Advances in Learning and Control,V. Blondel, S. Boyd, and H. Kimura, Eds., Lecture Notesin Control and Information Sciences, pp. 95-110. Springer-Verlag Limited, 2008, http://stanford. edu/boyd/graph-dcp. html
17. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, Distributedoptimization and statistical learning via the alternatingdirection method of multipliers, Foundations and Trends inMachine Learning, vol. 3, no. 1, pp. 1-122, 2011
18. C. D. Manning, P. Raghavan, and H. Schutze, Introduction toinformation retrieval, Cambridge University Press, 2008