Fetching the paper…
Reading the bibliography…
The construction of a meaningful graph topology plays a crucial role in the effective representation, processing, analysis and visualization of structured data.
A. P. Dempster, “Covariance selection,” Biometrics , vol. 28, no. 1, pp. 157–175, 1972
1972
Earlier work this paper cites.
G. Poole and T. Boullion, “A survey on m-matrices,” SIAM Review , vol. 16, no. 4, pp. 419–427, 1974
1974
Earlier work this paper cites.
B. A. Cipra, “An introduction to the Ising model,” The American Mathematical Monthly , vol. 94, no. 10, pp. 937–959, 1987
1987
Earlier work this paper cites.
K. J. Friston, “Functional and effective connectivity in neuroimaging: A synthesis,” Human Brain Mapping , vol. 2, no. 1-2, p. 56–78, 1994
1994
Earlier work this paper cites.
A. McLntosh and F. Gonzalez-Lima, “Structural equation modeling and its application to network analysis in functional brain imaging,” Human Brain Mapping , vol. 2, no. 1-2, p. 2–22, 1994
1994
Earlier work this paper cites.
D. Heckerman, “A tutorial on learning bayesian networks,” Technical Report MSR-TR-95-06, Microsoft Research , 1995
1995
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the Lasso,” Journal of the Royal Statistical Society, Series B , vol. 58, no. 1, pp. 267–288, 1995
1995
Earlier work this paper cites.
S. Ratnasamy and S. McCanne, “Inference of multicast routing trees and bottleneck bandwidths using end-to-end measurements,” in Proceedigns of IEEE Infocom , vol. 1, 1999, pp. 353–360
1999
Earlier work this paper cites.
S. T. Roweis and L. K. Saul, “Nonlinear dimensionality reduction by locally linear embedding,” The American Mathematical Monthly , vol. 290, no. 5500, pp. 2323–2326, 2000
2000
Earlier work this paper cites.
R. Goebel, A. Roebroeck, D.-S. Kim, and E. Formisano, “Investigating directed cortical interactions in time-resolved fMRI data using vector autoregressive modeling and Granger causality mapping,” Magnetic Resonance Imaging , vol. 21, no. 10, p. 1251–1261, 2003
2003
Earlier work this paper cites.
R. Castro, M. Coates, G. Liang, R. Nowak, and B. Yu, “Network tomography: Recent developments,” Statistical Science , vol. 19, no. 3, pp. 499–517, 2004
2004
Earlier work this paper cites.
X. Zhu, “Semi-supervised learning with graphs,” PhD thesis, Carnegie Mellon University, CMU-LTI-05-192 , 2005
2005
Earlier work this paper cites.
A. Roebroeck, E. Formisano, and R. Goebel, “Mapping directed influence over the brain using Granger causality and fMRI,” NeuroImage , vol. 25, no. 1, p. 230–242, 2005
2005
Earlier work this paper cites.
N. Meinshausen and P. Bühlmann, “High-dimensional graphs and variable selection with the Lasso,” Annals of Statistics , vol. 34, no. 3, pp. 1436–1462, 2006
2006
Earlier work this paper cites.
M. Yuan and Y. Lin, “Model selection and estimation in regression with grouped variables,” Journal of the Royal Statistical Society, Series B , vol. 68, no. 1, pp. 49–67, 2006
2006
Earlier work this paper cites.
M. Rabbat, M. Coates, and R. Nowak, “Multiple-source internet tomography,” IEEE Journal of Selected Areas in Communications , vol. 24, no. 12, pp. 2221–2234, 2006
2006
Earlier work this paper cites.
F. Chung, “The heat kernel as the pagerank of a graph,” Proceedings of the National Academy of Sciences , vol. 104, no. 50, pp. 19 735–19 740, 2007
2007
Earlier work this paper cites.
O. Banerjee, L. E. Ghaoui, and A. d’Aspremont, “Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data,” The Journal of Machine Learning Research , vol. 9, pp. 485–516, 2008
2008
Earlier work this paper cites.
J. Friedman, T. Hastie, and R. Tibshirani, “Sparse inverse covariance estimation with the graphical Lasso,” Biostatistics , vol. 9, no. 3, pp. 432–441, 2008
2008
Earlier work this paper cites.
H. Ma, H. Yang, M. R. Lyu, and I. King, “Mining social networks using heat diffusion processes for marketing candidates selection,” in 17th ACM Conference on Information and Knowledge Management , 2008, pp. 233–242
2008
Earlier work this paper cites.
D. Koller and N. Friedman, Probabilistic graphical models: Principles and techniques . MIT Press, 2009
2009
Earlier work this paper cites.
S. I. Daitch, J. A. Kelner, and D. A. Spielman, “Fitting a graph to vector data,” in Proceedings of the International Conference on Machine Learning , 2009, pp. 201–208
2009
Earlier work this paper cites.
D. W. Kaplan, Structural equation modeling: Foundations and extensions (2nd ed.) . Newbury Park, CA, USA: Sage, 2009
2009
Earlier work this paper cites.
S. Fortunato, “Community detection in graphs,” Physics Reports , vol. 486, no. 3-5, pp. 75–174, 2010
2010
Earlier work this paper cites.
M. Gomez-Rodriguez, J. Leskovec, and A. Krause, “Inferring networks of diffusion and influence,” in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , Washington, DC, USA, 2010, pp. 1019–1028
2010
Earlier work this paper cites.
S. A. Myers and J. Leskovec, “On the convexity of latent social network inference,” in Proceedings of Neural Information Processing Systems , Vancouver, British Columbia, 2010, pp. 1741–1749
2010
Earlier work this paper cites.
P. Ravikumar, M. J. Wainwright, and J. Lafferty, “High-dimensional Ising model selection using l1-regularized logistic regression,” Annals of Statistics , vol. 38, no. 3, pp. 1287–1319, 2010
2010
Earlier work this paper cites.
B. Lake and J. Tenenbaum, “Discovering structure by learning sparse graph,” in Proceedings of the Annual Cognitive Science Conference , 2010
2010
Earlier work this paper cites.
R. Rubinstein, A. M. Bruckstein, and M. Elad, “Dictionaries for sparse representation modeling,” Proceedings of the IEEE , vol. 98, no. 6, pp. 1045–1057, 2010
2010
Earlier work this paper cites.
J. Songsiri and L. Vandenberghe, “Topology selection in graphical models of autoregressive processes,” Journal of Machine Learning Research , vol. 11, pp. 2671–2705, 2010
2010
Cited alongside, same era.
C. Groendyke, D. Welch, and D. R. Hunter, “Bayesian inference for contact networks given epidemic data,” Scandinavian Journal of Statistics , vol. 38, no. 3, p. 600–616, 2011
2011
Cited alongside, same era.
C.-J. Hsieh, I. S. Dhillon, P. K. Ravikumar, and M. A. Sustik, “Sparse inverse covariance matrix estimation using quadratic approximation,” in Advances in Neural Information Processing Systems , 2011, pp. 2330–2338
2011
Cited alongside, same era.
D. K. Hammond, P. Vandergheynst, and R. Gribonval, “Wavelets on graphs via spectral graph theory,” Applied and Computational Harmonic Analysis , vol. 30, no. 2, pp. 129–150, 2011
2011
Cited alongside, same era.
H. E. Egilmez, E. Pavez, and A. Ortega, “Graph learning from data under structural and Laplacian constraints,” IEEE Journal of Selected Topics in Signal Processing , vol. 11, no. 6, pp. 825–841, 2017
2017
Later among the works it cites.
S. P. Chepuri, S. Liu, G. Leus, and A. O. Hero, “Learning sparse graphs under smoothness prior,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing , 2017, pp. 6508–6512
2017
Later among the works it cites.
S. Segarra, A. G. Marques, G. Mateos, and A. Ribeiro, “Network topology inference from spectral templates,” IEEE Transactions on Signal and Information Processing over Networks , vol. 3, no. 3, pp. 467–483, 2017
2017
Later among the works it cites.
D. Thanou, X. Dong, D. Kressner, and P. Frossard, “Learning heat diffusion graphs,” IEEE Transactions on Signal and Information Processing over Networks , vol. 3, no. 3, pp. 484 – 499, 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
I. Tosic and P. Frossard, “Dictionary Learning,” IEEE Signal Processing Magazine , vol. 28, no. 2, pp. 27–38, 2011
2011
Cited alongside, same era.
A. Bolstad, B. D. V. Veen, and R. Nowak, “Causal network inference via group sparse regularization,” IEEE Transactions on Signal Processing , vol. 59, no. 6, pp. 2628–2641, 2011
2011
Cited alongside, same era.
G. Chen, D. R. Glen, Z. S. Saad, J. P. Hamilton, M. E. Thomason, I. H. Gotlib, and R. W. Cox, “Vector autoregression, structural equation modeling, and their synthesis in neuroimaging data analysis,” Computers in Biology and Medicine , vol. 41, no. 12, p. 1142–1155, 2011
2011
Cited alongside, same era.
N. Du, L. Song, A. J. Smola, and M. Yuan, “Learning networks of heterogeneous influence,” in Proceedings of Neural Information Processing Systems , 2012, pp. 2789–2797
2012
Cited alongside, same era.
X. Zhang, X. Dong, and P. Frossard, “Learning of structured graph dictionaries,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing , 2012, pp. 3373–3376
2012
Cited alongside, same era.
D. I Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, “The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,” IEEE Signal Processing Magazine , vol. 30, no. 3, pp. 83–98, 2013
2013
Cited alongside, same era.
J. Richiardi, S. Achard, H. Bunke, and D. V. D. Ville, “Machine learning with brain graphs: Predictive modeling approaches for functional imaging in systems neuroscience,” IEEE Signal Processing Magazine , vol. 30, no. 3, pp. 58–70, 2013
2013
Cited alongside, same era.
A. Sandryhaila and J. M. F. Moura, “Discrete signal processing on graphs,” IEEE Transactions on Signal Processing , vol. 61, no. 7, pp. 1644–1656, 2013
2013
Cited alongside, same era.
H. P. Maretic, D. Thanou, and P. Frossard, “Graph learning under sparsity priors,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing , 2017, pp. 6523–6527
2017
Later among the works it cites.
J. Mei and J. M. F. Moura, “Signal processing on graphs: Causal modeling of unstructured data,” IEEE Transactions on Signal Processing , vol. 65, no. 8, pp. 2077–2092, 2017
2017
Later among the works it cites.
B. Baingana and G. B. Giannakis, “Tracking switched dynamic network topologies from information cascades,” IEEE Transactions on Signal Processing , vol. 65, no. 4, pp. 985–997, 2017
2017
Later among the works it cites.
P. A. Traganitis, Y. Shen, and G. B. Giannakis, “Network topology inference via elastic net structural equation models,” in Proceedings of European Signal Processing Conference , 146-150, 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
V. Kalofolias, A. Loukas, D. Thanou, and P. Frossard, “Learning time varying graphs,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing , 2017, pp. 2826–2830
2017
Later among the works it cites.
K.-S. Lu and A. Ortega, “A graph Laplacian matrix learning method for fast implementation of graph Fourier transform,” in Proceedings of the IEEE International Conference on Image Processing , 2017
2017
Later among the works it cites.
I. Jablonski, “Graph signal processing in applications to sensor networks, smart grids, and smart cities,” IEEE Sensors Journal , vol. 17, no. 23, pp. 7659–7666, 2017
2017
Later among the works it cites.
S. Sardellitti, S. Barbarossa, and P. D. Lorenzo, “On the graph Fourier transform for directed graphs,” IEEE Journal of Selected Topics in Signal Processing , vol. 11, no. 6, p. 796–811, 2017
2017
Later among the works it cites.
M. Sundin, A. Venkitaraman, M. Jansson, and S. Chatterjee, “A connectedness constraint for learning sparse graphs,” in Proceedings of European Signal Processing Conference , 151-155, 2017
2017
Later among the works it cites.
S. Segarra, G. Mateos, A. G. Marques, and A. Ribeiro, “Blind identification of graph filters,” IEEE Transactions on Signal Processing , vol. 65, no. 5, p. 1146–1159, 2017
2017
Later among the works it cites.
A. Ortega, P. Frossard, J. Kovačević, J. M. F. Moura, and P. Vandergheynst, “Graph signal processing: Overview, challenges and applications,” Proceedings of the IEEE , vol. 106, no. 5, pp. 808–828, 2018
2018
Closest in time.
B. Pasdeloup, V. Gripon, G. Mercier, D. Pastor, and M. G. Rabbat, “Characterization and inference of graph diffusion processes from observations of stationary signals,” IEEE Transactions on Signal and Information Processing over Networks , vol. 4, no. 3, pp. 481–496, 2018
2018
Closest in time.
2018
Closest in time.
G. B. Giannakis, Y. Shen, and G. V. Karanikolas, “Topology identification and learning over graphs: Accounting for nonlinearities and dynamics,” Proceedings of the IEEE , vol. 106, no. 5, pp. 787–807, 2018
2018
Closest in time.
G. Cheung, E. Magli, Y. Tanaka, and M. Ng, “Graph spectral image processing,” Proceedings of the IEEE , vol. 106, no. 5, pp. 907–930, 2018
2018
Closest in time.
W. Huang, T. A. W. Bolton, J. D. Medaglia, D. S. Bassett, A. Ribeiro, and D. V. D. Ville, “A graph signal processing perspective on functional brain imaging,” Proceedings of the IEEE , vol. 106, no. 5, pp. 907–930, 2018
2018
Closest in time.
2018
Closest in time.
S. Vlaski, H. Maretic, R. Nassif, P. Frossard, and A. H. Sayed, “Online graph learning from sequential data,” in Proceedings of IEEE Data Science Workshop , 2018, pp. 190–194
2018
Closest in time.
H. N. Mhaskar, “A unified framework for harmonic analysis of functions on directed graphs and changing data,” Applied and Computational Harmonic Analysis , vol. 44, no. 3, p. 611–644, 2018
2018
Closest in time.
B. Girault, A. Ortega, and S. Narayanan, “Irregularity-aware graph fourier transforms,” IEEE Transactions on Signal Processing , vol. 66, no. 21, pp. 5746–5761, 2018
2018
Closest in time.
2018
Closest in time.
A. D. Col, P. Valdivia, F. Petronetto, F. Dias, C. T. Silva, and L. G. Nonato, “Wavelet-based visual analysis of dynamic networks,” IEEE Transactions on Visualization and Computer Graphics , vol. 24, no. 8, pp. 2456–2469, 2018
2018
Closest in time.
E. Pavez, H. E. Egilmez, and A. Ortega, “Learning graphs with monotone topology properties and multiple connected components,” IEEE Transactions on Signal Processing , vol. 66, no. 9, pp. 2399–2413, 2018
2018
Closest in time.