{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T14:39:15Z","timestamp":1790779155953,"version":"4.1.0"},"reference-count":173,"publisher":"Emerald","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,12,22]]},"abstract":"<jats:p>Modern data analytics applications on graphs often operate on domains where graph topology is not known a priori, and hence its determination becomes part of the problem definition, rather than serving as prior knowledge which aids the problem solution. Part III of this monograph starts by a comprehensive account of ways to learn the pertinent graph topology, ranging from the simplest case where the physics of the problem already suggest a possible graph structure, through to general cases where the graph structure is to be learned from the data observed on a graph. A particular emphasis is placed on the use of standard \u201crelationship measures\u201d in this context, including the correlation and precision matrices, together with the ways to combine these with the available prior knowledge and structural conditions, such as the smoothness of the graph signals or sparsity of graph connections. Next, for learning sparse graphs (that is, graphs with a small number of edges), the utility of the least absolute shrinkage and selection operator, known as (LASSO) is addressed, along with its graph specific variant, the graphical LASSO. For completeness, both variants of LASSO are derived in an intuitive way, starting from basic principles. An in-depth elaboration of the graph topology learning paradigm is provided through examples on physically well defined graphs, such as electric circuits, linear heat transfer, social and computer networks, and spring-mass systems. We also review main trends in graph neural networks (GNN) and graph convolutional networks (GCN) from the perspective of graph signal filtering. Particular insight is given to the role of diffusion processes over graphs, to show that GCNs can be understood from the graph diffusion perspective. Given the largely heuristic nature of the existing GCNs, their treatment through graph diffusion processes may also serve as a basis for new designs of GCNs. Tensor representation of lattice-structured graphs is next considered, and it is shown that tensors (multidimensional data arrays) can be treated as a special class of graph signals, whereby the graph vertices reside on a high-dimensional regular lattice structure. Finally, the concept of graph tensor networks is shown to provide a unifying framework for learning of big data on irregular domains. This part of monograph concludes with an in-dept account of emerging applications in financial data processing and underground transportation network modeling. More specifically, by means of portfolio cuts of an asset graph, we show how domain knowledge can be meaningfully incorporated into investment analysis, while the underground transportation example addresses vulnerability of stations in the London underground network to traffic disruption.<\/jats:p>","DOI":"10.1561\/2200000078-3","type":"journal-article","created":{"date-parts":[[2020,12,2]],"date-time":"2020-12-02T12:36:14Z","timestamp":1606912574000},"page":"332-530","source":"Crossref","is-referenced-by-count":61,"title":["Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications"],"prefix":"10.1108","volume":"13","author":[{"given":"Ljubi\u0161a","family":"Stankovi\u0107","sequence":"first","affiliation":[{"name":"University of Montenegro ,","place":["Montenegro"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danilo","family":"Mandic","sequence":"additional","affiliation":[{"name":"Imperial College London ,","place":["UK"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Milo\u0161","family":"Dakovi\u0107","sequence":"additional","affiliation":[{"name":"University of Montenegro ,","place":["Montenegro"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Milo\u0161","family":"Brajovi\u0107","sequence":"additional","affiliation":[{"name":"University of Montenegro ,","place":["Montenegro"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruno","family":"Scalzo","sequence":"additional","affiliation":[{"name":"Imperial College London ,","place":["UK"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengxi","family":"Li","sequence":"additional","affiliation":[{"name":"Imperial College London ,","place":["UK"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anthony G.","family":"Constantinides","sequence":"additional","affiliation":[{"name":"Imperial College London ,","place":["UK"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2020,12,22]]},"reference":[{"key":"2026033012314263400_ref001","first-page":"1993","article-title":"Diffusion-convolutional neural networks","volume-title":"Advances in Neural Information Processing Systems","author":"Atwood","year":"2016"},{"issue":"4","key":"2026033012314263400_ref002","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1111\/j.1467-842X.2004.00360.x","article-title":"Partial correlation and conditional correlation as measures of conditional independence","volume":"46","author":"Baba","year":"2004","journal-title":"Australian & New Zealand Journal of Statistics"},{"key":"2026033012314263400_ref003","first-page":"294","volume-title":"A non-negative factorization approach to node pooling in graph convolutional neural networks","author":"Bacciu","year":"2019"},{"key":"2026033012314263400_ref004","volume-title":"Contextual graph Markov model: A deep and generative approach to graph processing","author":"Bacciu","year":"2018"},{"key":"2026033012314263400_ref005","first-page":"441","volume-title":"Tensor decompositions in deep learning","author":"Bacciu","year":"2020"},{"issue":"4","key":"2026033012314263400_ref006","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1109\/TSP.2016.2628354","article-title":"Tracking switched dynamic network topologies from information cascades","volume":"65","author":"Baingana","year":"2016","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026033012314263400_ref007","first-page":"485","article-title":"Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data","volume":"9","author":"Banerjee","year":"2008","journal-title":"Journal of Machine Learning Research"},{"issue":"6","key":"2026033012314263400_ref008","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1162\/089976603321780317","article-title":"Laplacian eigenmaps for dimensionality reduction and data representation","volume":"15","author":"Belkin","year":"2003","journal-title":"Neural Computation"},{"issue":"8","key":"2026033012314263400_ref009","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1016\/j.jcss.2007.08.006","article-title":"Towards a theoretical foundation for Laplacian-based manifold methods","volume":"74","author":"Belkin","year":"2008","journal-title":"Journal of Computer and System Sciences"},{"key":"2026033012314263400_ref010","volume-title":"Hypergraphs: Combinatorics of Finite Sets","author":"Berge","year":"1984"},{"issue":"5","key":"2026033012314263400_ref011","doi-asserted-by":"crossref","first-page":"280","DOI":"10.2469\/faj.v48.n5.28","article-title":"Global portfolio optimization","volume":"48","author":"Black","year":"1992","journal-title":"Financial Analysts Journal"},{"key":"2026033012314263400_ref012","doi-asserted-by":"crossref","first-page":"29","DOI":"10.4337\/9781035304998.00010","volume-title":"Innovations in Financial and Economic Networks","author":"Boginski","year":"2003"},{"issue":"2","key":"2026033012314263400_ref013","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/j.csda.2004.02.004","article-title":"Statistical analysis of financial networks","volume":"48","author":"Boginski","year":"2005","journal-title":"Computational Statistics & Data Analysis"},{"issue":"11","key":"2026033012314263400_ref014","doi-asserted-by":"crossref","first-page":"3171","DOI":"10.1016\/j.cor.2005.01.027","article-title":"Mining market data: A network approach","volume":"33","author":"Boginski","year":"2006","journal-title":"Computers & Operations Research"},{"key":"2026033012314263400_ref015","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-013-1395-3","article-title":"A network-based data mining approach to portfolio selection via weighted clique relaxations","volume":"216","author":"Boginski","year":"2014","journal-title":"Annals of Operations Research"},{"key":"2026033012314263400_ref016","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/978-3-030-03574-7_10","volume-title":"Vertex-Frequency Analysis of Graph Signals","author":"Bohannon","year":"2019"},{"key":"2026033012314263400_ref017","volume-title":"NetGAN: Generating graphs via random walks","author":"Bojchevski","year":"2018"},{"key":"2026033012314263400_ref018","doi-asserted-by":"crossref","DOI":"10.1007\/b106453","volume-title":"Network Analysis: Methodological Foundations","author":"Brandes","year":"2005"},{"key":"2026033012314263400_ref019","volume-title":"Spectral networks and locally connected networks on graphs","author":"Bruna","year":"2013"},{"issue":"6","key":"2026033012314263400_ref020","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","article-title":"Learning graph matching","volume":"31","author":"Caetano","year":"2009","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1-2","key":"2026033012314263400_ref021","doi-asserted-by":"crossref","first-page":"21","DOI":"10.3233\/AF-140032","article-title":"Stochastic flow diagrams","volume":"3","author":"Calkin","year":"2014","journal-title":"Algorithmic Finance"},{"issue":"1","key":"2026033012314263400_ref022","doi-asserted-by":"crossref","first-page":"43","DOI":"10.3233\/AF-140033","article-title":"The topology of macro financial flows: An application of stochastic flow diagrams","volume":"3","author":"Calkin","year":"2014","journal-title":"Algorithmic Finance"},{"issue":"4","key":"2026033012314263400_ref023","first-page":"59","article-title":"Building diversified portfolios that outperform out of sample","volume":"42","author":"Calkin","year":"2016","journal-title":"The Journal of Portfolio Management"},{"key":"2026033012314263400_ref024","volume-title":"Compression and interpretability of deep neural networks via Tucker tensor layer: From first principles to tensor valued back-propagation","author":"Calvi","year":"2019"},{"key":"2026033012314263400_ref025","doi-asserted-by":"crossref","DOI":"10.1155\/2015\/876862","article-title":"Models and algorithms for optimal piecewise-linear function approximation","volume-title":"Mathematical Problems in Engineering","author":"Camponogara","year":"2015"},{"issue":"2","key":"2026033012314263400_ref026","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","article-title":"Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information","volume":"52","author":"Cand\u00e8s","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033012314263400_ref027","volume-title":"Machine learning on graphs: A model and comprehensive taxonomy","author":"Chami","year":"2020"},{"issue":"12","key":"2026033012314263400_ref028","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1016\/j.compbiomed.2011.09.004","article-title":"Vector autoregression, structural equation modeling, and their synthesis in neuroimaging data analysis","volume":"41","author":"Chen","year":"2011","journal-title":"Computers in Biology and Medicine"},{"issue":"17","key":"2026033012314263400_ref029","doi-asserted-by":"crossref","first-page":"4609","DOI":"10.1109\/TSP.2015.2441042","article-title":"Signal recovery on graphs: Variation minimization","volume":"63","author":"Chen","year":"2015","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"2026033012314263400_ref030","first-page":"539","article-title":"Signal recovery on graphs: Fundamental limits of sampling strategies","volume":"2","author":"Chen","year":"2016","journal-title":"IEEE Transactions on Signal and Information Processing Over Networks"},{"key":"2026033012314263400_ref031","first-page":"6508","volume-title":"Learning sparse graphs under smoothness prior","author":"Chepuri","year":"2017"},{"issue":"4-5","key":"2026033012314263400_ref032","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1561\/2200000059","article-title":"Tensor networks for dimensionality reduction and large-scale optimization. Part 1: Low-rank tensor decompositions","volume":"9","author":"Cichocki","year":"2016","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"issue":"6","key":"2026033012314263400_ref033","first-page":"431","article-title":"Tensor networks for dimensionality reduction and large-scale optimization. Part 2: Applications and future perspectives","volume":"9","author":"Cichocki","year":"2017","journal-title":"Foundations and Trends\u2019\u00ae in Machine Learning"},{"key":"2026033012314263400_ref034","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/978-3-030-03574-7_15","volume-title":"Vertex-Frequency Analysis of Graph Signals","author":"Cioac\u00e4","year":"2019"},{"key":"2026033012314263400_ref035","doi-asserted-by":"crossref","first-page":"48","DOI":"10.2469\/faj.v58.n5.2468","article-title":"Portfolio constraints and the fundamental law of active management","volume":"58","author":"Clarke","year":"2002","journal-title":"Financial Analysts Journal"},{"issue":"9","key":"2026033012314263400_ref036","doi-asserted-by":"crossref","first-page":"3268","DOI":"10.1016\/j.laa.2011.11.018","article-title":"Spectra of uniform hypergraphs","volume":"436","author":"Cooper","year":"2012","journal-title":"Linear Algebra and Its Applications"},{"key":"2026033012314263400_ref037","first-page":"1114","volume-title":"Learning steady-states of iterative algorithms over graphs","author":"Dai","year":"2018"},{"key":"2026033012314263400_ref038","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/978-3-030-03574-7_14","volume-title":"Vertex-Frequency Analysis of Graph Signals","author":"Dal Col","year":"2019"},{"issue":"3","key":"2026033012314263400_ref039","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1162\/NECO_a_00936","article-title":"Interpretation of the precision matrix and its application in estimating sparse brain connectivity during sleep spindles from human electrocorticography recordings","volume":"29","author":"Das","year":"2017","journal-title":"Neural Computation"},{"key":"2026033012314263400_ref040","volume-title":"MolGAN: An implicit generative model for small molecular graphs","author":"De Cao","year":"2018"},{"key":"2026033012314263400_ref041","doi-asserted-by":"crossref","first-page":"1915","DOI":"10.1093\/rfs\/hhm075","article-title":"Optimal versus naive diversification: How inefficient is the 1\/N portfolio strategy?","volume":"22","author":"De Miguel","year":"2009","journal-title":"Review of Financial Studies"},{"key":"2026033012314263400_ref042","volume-title":"Graph theory and metro traffic modelling","author":"Dees","year":"2019"},{"key":"2026033012314263400_ref043","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Advances in Neural Information Processing Systems","author":"Defferrard","year":"2016"},{"key":"2026033012314263400_ref044","first-page":"157","article-title":"Covariance selection","volume-title":"Biometrics:","author":"Dempster","year":"1972"},{"key":"2026033012314263400_ref045","volume-title":"Tutorial on variational autoencoders","author":"Doersch","year":"2016"},{"key":"2026033012314263400_ref046","unstructured":"Dong, X., D.Thanou, P.Frossard, and P.Vandergheynst (2015). \u201cLearning graphs from signal observations under smoothness prior\u201d. June [online]. Available: URL: http:\/\/arXiv.org\/abs\/1406.7842."},{"issue":"23","key":"2026033012314263400_ref047","doi-asserted-by":"crossref","first-page":"6160","DOI":"10.1109\/TSP.2016.2602809","article-title":"Learning Laplacian matrix in smooth graph signal representations","volume":"64","author":"Dong","year":"2016","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"3","key":"2026033012314263400_ref048","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/MSP.2018.2887284","article-title":"Learning graphs from data: A signal representation perspective","volume":"36","author":"Dong","year":"2019","journal-title":"IEEE Signal Processing Magazine"},{"issue":"1","key":"2026033012314263400_ref049","first-page":"150","article-title":"Kron reduction of graphs with applications to electrical networks","volume":"60","author":"Dorfler","year":"2012","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"issue":"4","key":"2026033012314263400_ref050","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1037\/met0000167","article-title":"A tutorial on regularized partial correlation networks","volume":"23","author":"Epskamp","year":"2018","journal-title":"Psychological Methods"},{"issue":"2","key":"2026033012314263400_ref051","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"Fiedler","year":"1973","journal-title":"Czechoslovak Mathematical Journal"},{"key":"2026033012314263400_ref052","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","article-title":"A set of measures of centrality based on be-tweenness","volume":"40","author":"Freeman","year":"1977","journal-title":"Sociometry"},{"issue":"3","key":"2026033012314263400_ref053","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1093\/biostatistics\/kxm045","article-title":"Sparse inverse covariance estimation with the graphical LASSO","volume":"9","author":"Friedman","year":"2008","journal-title":"Biostatistics"},{"issue":"1","key":"2026033012314263400_ref054","doi-asserted-by":"crossref","first-page":"e86028","DOI":"10.1371\/journal.pone.0086028","article-title":"Detecting the community structure and activity patterns of temporal networks: A nonnegative tensor factorization approach","volume":"9","author":"Gauvin","year":"2014","journal-title":"PLOS ONE"},{"key":"2026033012314263400_ref055","first-page":"787","article-title":"Topology identification and learning over graphs: Accounting for nonlinearities and dynamics","author":"Giannakis","year":"2018"},{"key":"2026033012314263400_ref056","first-page":"1263","volume-title":"Neural message passing for quantum chemistry","author":"Gilmer","year":"2017"},{"key":"2026033012314263400_ref057","first-page":"729","volume-title":"A new model for learning in graph domains","author":"Gori","year":"2005"},{"issue":"8","key":"2026033012314263400_ref058","doi-asserted-by":"crossref","first-page":"2036","DOI":"10.1109\/TSP.2019.2901356","article-title":"Power systems topology and state estimation by graph blind source separation","volume":"67","author":"Grotas","year":"2019","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026033012314263400_ref059","first-page":"855","volume-title":"Node2Vec: Scalable feature learning for networks","author":"Grover","year":"2016"},{"key":"2026033012314263400_ref060","first-page":"2434","volume-title":"Graphite: Iterative generative modeling of graphs","author":"Grover","year":"2019"},{"key":"2026033012314263400_ref061","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/978-3-030-03574-7_7","volume-title":"Vertex-Frequency Analysis of Graph Signals","author":"Gu","year":"2019"},{"key":"2026033012314263400_ref062","first-page":"281","volume-title":"Optimal selection of an independent set of cliques in a market graph","author":"Gunawardena","year":"2012"},{"issue":"9","key":"2026033012314263400_ref063","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1109\/43.159993","article-title":"New spectral methods for ratio cut partitioning and clustering","volume":"11","author":"Hagen","year":"1992","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"2026033012314263400_ref064","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Advances in Neural Information Processing Systems","author":"Hamilton","year":"2017"},{"issue":"2","key":"2026033012314263400_ref065","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.acha.2010.04.005","article-title":"Wavelets on graphs via spectral graph theory","volume":"30","author":"Hammond","year":"2011","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"2026033012314263400_ref066","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-030-03574-7_2","volume-title":"Vertex-Frequency Analysis of Graph Signals","author":"Hamon","year":"2019"},{"key":"2026033012314263400_ref067","first-page":"10712","article-title":"Semi-implicit graph variational auto-encoders","volume-title":"Advances in Neural Information Processing Systems","author":"Hasanzadeh","year":"2019"},{"key":"2026033012314263400_ref068","volume-title":"Graph-SAC: Detecting anomalies in large-scale graphs","author":"Ioannidis","year":"2019"},{"issue":"9","key":"2026033012314263400_ref069","doi-asserted-by":"crossref","first-page":"2263","DOI":"10.1109\/TSP.2019.2903025","article-title":"Semi-blind inference of topologies and dynamical processes over dynamic graphs","volume":"67","author":"Ioannidis","year":"2019","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026033012314263400_ref070","first-page":"538","volume-title":"SIMRANK: A measure of structural-context similarity","author":"Jeh","year":"2002"},{"key":"2026033012314263400_ref071","first-page":"920","volume-title":"How to learn a graph from smooth signals","author":"Kalofolias","year":"2016"},{"key":"2026033012314263400_ref072","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4939-0808-0_15","volume-title":"Optimization in Science and Engineering","author":"Kalyagin","year":"2014"},{"key":"2026033012314263400_ref073","volume-title":"Structural Equation Modeling: Foundations and Extensions","author":"Kaplan","year":"2008"},{"issue":"2","key":"2026033012314263400_ref074","doi-asserted-by":"crossref","first-page":"102068","DOI":"10.1016\/j.ipm.2019.102068","article-title":"Class-aware tensor factorization for multi-relational classification","volume":"57","author":"Katsimpras","year":"2020","journal-title":"Information Processing & Management"},{"key":"2026033012314263400_ref075","volume-title":"Auto-encoding variational Bayes","author":"Kingma","year":"2013"},{"key":"2026033012314263400_ref076","volume-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"key":"2026033012314263400_ref077","volume-title":"Variational graph auto-encoders","author":"Kipf","year":"2016"},{"key":"2026033012314263400_ref078","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-88146-1","volume-title":"Statistical Analysis of Network Data - Methods and Models","author":"Kolaczyk","year":"2009"},{"issue":"2","key":"2026033012314263400_ref079","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.ejor.2013.10.060","article-title":"60 years of portfolio optimization: Practical challenges and current trends","volume":"234","author":"Kolm","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"2026033012314263400_ref080","first-page":"2278","article-title":"Gradient-based learning applied to document recognition","author":"LeCun","year":"1998"},{"issue":"5","key":"2026033012314263400_ref081","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/S0927-5398(03)00007-0","article-title":"Improved estimation of the covariance matrix of stock returns with an application to portfolio selection","volume":"10","author":"Ledoit","year":"2003","journal-title":"Journal of Empirical Finance"},{"key":"2026033012314263400_ref082","volume-title":"Reciprocal adversarial learning via characteristic functions","author":"Li","year":"2020"},{"key":"2026033012314263400_ref083","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/j.physa.2018.10.014","article-title":"Portfolio optimization based on network topology","volume":"515","author":"Li","year":"2019","journal-title":"Physica A"},{"key":"2026033012314263400_ref084","volume-title":"Gated graph sequence neural networks","author":"Li","year":"2015"},{"key":"2026033012314263400_ref085","volume-title":"Learning deep generative models of graphs","author":"Li","year":"2018"},{"issue":"7","key":"2026033012314263400_ref086","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","article-title":"The link-prediction problem for social networks","volume":"58","author":"Liben-Nowell","year":"2007","journal-title":"Journal of the American Society for Information Science and Technology"},{"key":"2026033012314263400_ref087","first-page":"685","volume-title":"Facetnet: A framework for analyzing communities and their evolutions in dynamic networks","author":"Lin","year":"2008"},{"key":"2026033012314263400_ref088","first-page":"527","volume-title":"MetaFac: Community discovery via relational hypergraph factorization","author":"Lin","year":"2009"},{"key":"2026033012314263400_ref089","first-page":"7113","article-title":"Constrained generation of se-mantically valid graphs via regularizing variational autoencoders","volume-title":"Advances in Neural Information Processing Systems","author":"Ma","year":"2018"},{"key":"2026033012314263400_ref090","article-title":"Machine learning and signal processing applications of fixed point theory","volume-title":"Tutorial in IEEE ICASSP, 2007","author":"Mandic","year":"2007"},{"key":"2026033012314263400_ref091","doi-asserted-by":"crossref","DOI":"10.1002\/047084535X","volume-title":"Recurrent Neural Networks for Prediction: Learning Algorithms, Architectures and Stability","author":"Mandic","year":"2001"},{"key":"2026033012314263400_ref092","doi-asserted-by":"crossref","DOI":"10.1002\/9780470742624","volume-title":"Complex Valued Nonlinear Adaptive Filters: Noncircularity, Widely Linear and Neural Models","author":"Mandic","year":"2009"},{"key":"2026033012314263400_ref093","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-3-030-03574-7_8","volume-title":"Vertex-Frequency Analysis of Graph Signals","author":"Mao","year":"2019"},{"issue":"1","key":"2026033012314263400_ref094","first-page":"77","article-title":"Portfolio selection","volume":"7","author":"Markowitz","year":"1952","journal-title":"Journal of Finance"},{"key":"2026033012314263400_ref095","volume-title":"Graph signal processing: Fundamentals and applications to diffusion processes","author":"Marques","year":"2017"},{"key":"2026033012314263400_ref096","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2017.07.007","article-title":"Random walks and diffusion on networks","volume":"716","author":"Masuda","year":"2017","journal-title":"Physics Reports"},{"issue":"3","key":"2026033012314263400_ref097","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/MSP.2018.2890143","article-title":"Connecting the dots: Identifying network structure via graph signal processing","volume":"36","author":"Mateos","year":"2019","journal-title":"IEEE Signal Processing Magazine"},{"issue":"8","key":"2026033012314263400_ref098","doi-asserted-by":"crossref","first-page":"2077","DOI":"10.1109\/TSP.2016.2634543","article-title":"Signal processing on graphs: Causal modeling of unstructured data","volume":"65","author":"Mei","year":"2016","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"3","key":"2026033012314263400_ref099","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1214\/009053606000000281","article-title":"High-dimensional graphs and variable selection with the LASSO","volume":"34","author":"Meinshausen","year":"2006","journal-title":"The Annals of Statistics"},{"issue":"3","key":"2026033012314263400_ref100","doi-asserted-by":"crossref","first-page":"498511","DOI":"10.1109\/TNN.2008.2010350","article-title":"Neural network for graphs: A contextual constructive approach","volume":"20","author":"Micheli","year":"2009","journal-title":"IEEE Transactions on Neural Networks"},{"key":"2026033012314263400_ref101","first-page":"5115","volume-title":"Geometric deep learning on graphs and manifolds using mixture model CNNs","author":"Monti","year":"2017"},{"key":"2026033012314263400_ref102","volume-title":"The CTU prague relational learning repository","author":"Motl","year":"2015"},{"key":"2026033012314263400_ref103","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","volume":"2002","author":"Ng","year":"2002","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026033012314263400_ref104","first-page":"809","volume-title":"A three-way model for collective learning on multi-relational data","author":"Nickel","year":"2011"},{"key":"2026033012314263400_ref105","first-page":"442","article-title":"Tensorizing neural networks","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"Novikov","year":"2015"},{"key":"2026033012314263400_ref106","doi-asserted-by":"crossref","DOI":"10.24963\/ijcai.2018\/362","volume-title":"Adversarially regularized graph autoencoder for graph embedding","author":"Pan","year":"2018"},{"key":"2026033012314263400_ref107","first-page":"899","volume-title":"Do more views of a graph help? Community detection and clustering in multi-graphs","author":"Papalexakis","year":"2013"},{"key":"2026033012314263400_ref108","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/978-3-030-03574-7_9","volume-title":"Vertex-Frequency Analysis of Graph Signals","author":"Pasdeloup","year":"2019"},{"key":"2026033012314263400_ref109","first-page":"6350","volume-title":"Generalized Laplacian precision matrix estimation for graph signal processing","author":"Pavez","year":"2016"},{"key":"2026033012314263400_ref110","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.jempfin.2016.06.003","article-title":"A network approach to portfolio selection","volume":"38","author":"Peralta","year":"2016","journal-title":"Journal of Empirical Finance"},{"key":"2026033012314263400_ref111","first-page":"701","volume-title":"Deepwalk: Online learning of social representations","author":"Perozzi","year":"2014"},{"key":"2026033012314263400_ref112","first-page":"369","article-title":"Covariance estimation: The GLM and regu-larization perspectives","volume-title":"Statistical Science:","author":"Pourahmadi","year":"2011"},{"key":"2026033012314263400_ref113","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/978-3-030-03574-7_13","volume-title":"Vertex-Frequency Analysis of Graph Signals","author":"Rabiei","year":"2019"},{"issue":"2","key":"2026033012314263400_ref114","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3905\/jpm.2018.44.2.089","article-title":"Hierarchical clustering-based asset allocation","volume":"44","author":"Raffinot","year":"2017","journal-title":"The Journal of Portfolio Management"},{"key":"2026033012314263400_ref115","first-page":"1250","article-title":"Graph sparsifica-tion approaches for Laplacian smoothing","volume-title":"Artificial Intelligence and Statistics","author":"Sadhanala","year":"2016"},{"key":"2026033012314263400_ref116","first-page":"3984","volume-title":"Hypergraph p-Laplacian: A differential geometry view","author":"Saito","year":"2018"},{"issue":"10","key":"2026033012314263400_ref117","doi-asserted-by":"crossref","first-page":"2679","DOI":"10.1109\/TSP.2019.2908129","article-title":"Eigen-decomposition-free sampling set selection for graph signals","volume":"67","author":"Sakiyama","year":"2019","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026033012314263400_ref118","first-page":"8454","volume-title":"Portfolio cuts: A graph-theoretic framework to diversification","author":"Scalzo","year":"2020"},{"issue":"1","key":"2026033012314263400_ref119","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","article-title":"The graph neural network model","volume":"20","author":"Scarselli","year":"2008","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"1","key":"2026033012314263400_ref120","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","article-title":"Graph clustering","volume":"1","author":"Schaeffer","year":"2007","journal-title":"Computer Science Review"},{"key":"2026033012314263400_ref121","first-page":"4099","article-title":"Blind identification of graph filters with multiple sparse inputs","author":"Segarra","year":"2016"},{"issue":"3","key":"2026033012314263400_ref122","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1109\/TSIPN.2017.2731051","article-title":"Network topology inference from spectral templates","volume":"3","author":"Segarra","year":"2017","journal-title":"IEEE Transactions on Signal and Information Processing Over Networks"},{"issue":"3","key":"2026033012314263400_ref123","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1609\/aimag.v29i3.2157","article-title":"Collective classification in network data","volume":"29","author":"Sen","year":"2008","journal-title":"AI Magazine"},{"key":"2026033012314263400_ref124","first-page":"107","article-title":"Normalized cuts and image segmentation","volume-title":"Departmental Papers (CIS):","author":"Shi","year":"2000"},{"key":"2026033012314263400_ref125","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/978-1-4899-0718-9_31","volume-title":"Facets of Systems Science","author":"Simon","year":"1991"},{"key":"2026033012314263400_ref126","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.laa.2014.04.020","article-title":"Estimation of positive definite M-matrices and structure learning for attractive Gaussian Markov random fields","volume":"473","author":"Slawski","year":"2015","journal-title":"Linear Algebra and Its Applications"},{"issue":"2-3","key":"2026033012314263400_ref127","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.laa.2006.07.020","article-title":"Spectral partitioning works: Planar graphs and finite element meshes","volume":"421","author":"Spielman","year":"2007","journal-title":"Linear Algebra and its Applications"},{"issue":"3","key":"2026033012314263400_ref128","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/S0165-1684(00)00236-X","article-title":"A measure of some time-frequency distributions concentration","volume":"81","author":"Stankovic","year":"2001","journal-title":"Signal Processing"},{"key":"2026033012314263400_ref129","volume-title":"Digital Signal Processing with Selected Topics","author":"Stankovic","year":"2015"},{"key":"2026033012314263400_ref130","first-page":"5340","volume-title":"A low-dimensionality method for data-driven graph learning","author":"Stankovic","year":"2020"},{"issue":"4","key":"2026033012314263400_ref131","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/MSP.2017.2696572","article-title":"Vertex-frequency analysis: A way to localize graph spectral components [Lecture Notes]","volume":"34","author":"Stankovic","year":"2017","journal-title":"IEEE Signal Processing Magazine"},{"key":"2026033012314263400_ref132","volume-title":"Graph signal processing - Part I: Graphs, graph spectra, and spectral clustering","author":"Stankovic","year":"2019"},{"issue":"6","key":"2026033012314263400_ref133","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/MSP.2019.2929832","article-title":"Understanding the basis of graph signal processing via an intuitive example-driven approach [Lecture Notes]","volume":"36","author":"Stankovic","year":"2019","journal-title":"IEEE Signal Processing Magazine"},{"issue":"1","key":"2026033012314263400_ref134","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1109\/MSP.2019.2945080","article-title":"Demystifying the coherence index in compressive sensing [Lecture Notes]","volume":"37","author":"Stankovic","year":"2020","journal-title":"IEEE Signal Processing Magazine"},{"key":"2026033012314263400_ref135","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-03574-7","volume-title":"Vertex-Frequency Analysis of Graph Signals","author":"Stankovic","year":"2019"},{"issue":"9","key":"2026033012314263400_ref136","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1109\/LSP.2018.2860250","article-title":"Reduced interference vertex-frequency distributions","volume":"25","author":"Stankovic","year":"2018","journal-title":"IEEE Signal Processing Letters"},{"issue":"3","key":"2026033012314263400_ref137","doi-asserted-by":"crossref","first-page":"1206","DOI":"10.1007\/s00034-018-0909-2","article-title":"A tutorial on sparse signal reconstruction and its applications in signal processing","volume":"38","author":"Stankovic","year":"2019","journal-title":"Circuits, Systems, and Signal Processing"},{"issue":"4","key":"2026033012314263400_ref138","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1145\/263867.263872","article-title":"A simple min-cut algorithm","volume":"44","author":"Stoer","year":"1997","journal-title":"Journal of the ACM (JACM)"},{"key":"2026033012314263400_ref139","volume-title":"Generalized sampling on graphs with subspace and smoothness priors","author":"Tanaka","year":"2019"},{"key":"2026033012314263400_ref140","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/978-3-030-03574-7_6","volume-title":"Vertex-Frequency Analysis of Graph Signals","author":"Tanaka","year":"2019"},{"key":"2026033012314263400_ref141","first-page":"1067","volume-title":"Line: Large-scale information network embedding","author":"Tang","year":"2015"},{"issue":"3","key":"2026033012314263400_ref142","doi-asserted-by":"crossref","first-page":"447478","DOI":"10.1007\/s10618-010-0210-x","article-title":"Leveraging social media networks for classification","volume":"23","author":"Tang","year":"2011","journal-title":"Data Mining and Knowledge Discovery"},{"key":"2026033012314263400_ref143","first-page":"1016","volume-title":"Clustering with multiple graphs","author":"Tang","year":"2009"},{"issue":"15","key":"2026033012314263400_ref144","doi-asserted-by":"crossref","first-page":"3849","DOI":"10.1109\/TSP.2014.2332441","article-title":"Learning parametric dictionaries for signals on graphs","volume":"62","author":"Thanou","year":"2014","journal-title":"IEEE Transactions Signal Processessing"},{"issue":"3","key":"2026033012314263400_ref145","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1109\/TSIPN.2017.2731164","article-title":"Learning heat diffusion graphs","volume":"3","author":"Thanou","year":"2017","journal-title":"IEEE Transactions on Signal and Information Processing Over Networks"},{"key":"2026033012314263400_ref146","unstructured":"Transport for London\n           (n.d.). URL: https:\/\/tfl.gov.uk\/."},{"issue":"4","key":"2026033012314263400_ref147","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1137\/16M1104974","article-title":"Fast estimation of tr(f(A)) via stochastic Lanczos quadrature","volume":"38","author":"Ubaru","year":"2017","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"2026033012314263400_ref148","volume-title":"Graph attention networks","author":"Velickovic","year":"2017"},{"key":"2026033012314263400_ref149","first-page":"1","article-title":"A comparative study based on tensor factorization and clustering techniques for community mining in heterogeneous social network","author":"Verma","year":"2017"},{"issue":"1","key":"2026033012314263400_ref150","first-page":"1","article-title":"Identifying community structure in a multi-relational network employing non-negative tensor factorization and GA k-means clustering","volume":"7","author":"Verma","year":"2017","journal-title":"Wires: Data Mining and Knowledge Discovery"},{"issue":"4","key":"2026033012314263400_ref151","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","article-title":"A tutorial on spectral clustering","volume":"17","author":"Von Luxburg","year":"2007","journal-title":"Statistics and Computing"},{"key":"2026033012314263400_ref152","first-page":"744","volume-title":"Between min cut and graph bisection","author":"Wagner","year":"1993"},{"key":"2026033012314263400_ref153","first-page":"4948","volume-title":"Community inference from graph signals with hidden nodes","author":"Wai","year":"2019"},{"key":"2026033012314263400_ref154","volume-title":"GraphGAN: Graph representation learning with generative adversarial nets","author":"Wang","year":"2017"},{"issue":"4","key":"2026033012314263400_ref155","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/TIP.2003.819861","article-title":"Image quality assessment: From error visibility to structural similarity","volume":"13","author":"Wang","year":"2004","journal-title":"IEEE Transactions on Image Processing"},{"key":"2026033012314263400_ref156","volume-title":"A comprehensive survey on graph neural networks","author":"Wu","year":"2019"},{"key":"2026033012314263400_ref157","volume-title":"Recurrent graph tensor networks","author":"Xu","year":"2020"},{"key":"2026033012314263400_ref158","article-title":"Multi-graph tensor networks","volume-title":"Advances in Neural Information Processing Systems","author":"Xu","year":"2020"},{"issue":"4","key":"2026033012314263400_ref159","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/TSIPN.2016.2605763","article-title":"Dual graph regularized dictionary learning","volume":"2","author":"Yankelevsky","year":"2016","journal-title":"IEEE Transactions on Signal and Information Processing Over Networks"},{"key":"2026033012314263400_ref160","volume-title":"GraphRNN: Generating realistic graphs with deep auto-regressive models","author":"You","year":"2018"},{"key":"2026033012314263400_ref161","first-page":"2663","volume-title":"Learning deep network representations with adversarially regularized autoencoders","author":"Yu","year":"2018"},{"issue":"1","key":"2026033012314263400_ref162","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","article-title":"Model selection and estimation in regression with grouped variables","volume":"68","author":"Yuan","year":"2006","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"issue":"1","key":"2026033012314263400_ref163","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1093\/biomet\/asm018","article-title":"Model selection and estimation in the Gaussian graphical model","volume":"94","author":"Yuan","year":"2007","journal-title":"Biometrika"},{"key":"2026033012314263400_ref164","volume-title":"GAAN: Gated attention networks for learning on large and spa-tiotemporal graphs","author":"Zhang","year":"2018"},{"key":"2026033012314263400_ref165","volume-title":"STAR-GCN: Stacked and reconstructed graph convolutional networks for recommender systems","author":"Zhang","year":"2019"},{"key":"2026033012314263400_ref166","first-page":"5165","article-title":"Link prediction based on graph neural networks","volume-title":"Advances in Neural Information Processing Systems","author":"Zhang","year":"2018"},{"key":"2026033012314263400_ref167","first-page":"1588","article-title":"D-VAE: A variational autoencoder for directed acyclic graphs","volume-title":"Advances in Neural Information Processing Systems","author":"Zhang","year":"2019"},{"key":"2026033012314263400_ref168","volume-title":"Deep learning on graphs: A survey","author":"Zhang","year":"2018"},{"key":"2026033012314263400_ref169","first-page":"1059","article-title":"The huge package for high-dimensional undirected graph estimation in R","volume":"13","author":"Zhao","year":"2012","journal-title":"Journal of Machine Learning Research"},{"issue":"5","key":"2026033012314263400_ref170","doi-asserted-by":"crossref","first-page":"1327","DOI":"10.1109\/TIP.2010.2090535","article-title":"Graph regularized sparse coding for image representation","volume":"20","author":"Zheng","year":"2011","journal-title":"IEEE Transactions on Image Processing"},{"key":"2026033012314263400_ref171","first-page":"1601","article-title":"Learning with hyper-graphs: Clustering, classification, and embedding","volume-title":"Advances in Neural Information Processing Systems","author":"Zhou","year":"2007"},{"key":"2026033012314263400_ref172","volume-title":"Graph neural networks: A review of methods and applications","author":"Zhou","year":"2018"},{"key":"2026033012314263400_ref173","volume-title":"Tech. rep","author":"Zhu","year":"2005"}],"container-title":["Foundations and Trends\u00ae in Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftmal\/article-pdf\/13\/4\/332\/11147494\/2200000078-3en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftmal\/article-pdf\/13\/4\/332\/11147494\/2200000078-3en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T18:10:49Z","timestamp":1777486249000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftmal\/article\/13\/4\/332\/1332171\/Data-Analytics-on-Graphs-Part-III-Machine-Learning"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,22]]},"references-count":173,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12,22]]}},"URL":"https:\/\/doi.org\/10.1561\/2200000078-3","relation":{},"ISSN":["1935-8237","1935-8245"],"issn-type":[{"value":"1935-8237","type":"print"},{"value":"1935-8245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12,22]]}}}