Data Analytics on Graphs Part I: Graphs and Spectra on Graphs

DOI10.1561/2200000078-1OpenAlexW3107724517MaRDI QIDQ5094176

Shengxi Li, Miloš Brajović, Miloš Daković, Ljubisa Stanković, Bruno Scalzo, A. G. Constantinides, Danilo P. Mandic

Publication date: 2 August 2022

Published in: Foundations and Trends® in Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1561/2200000078-1

zbMATH Keywords

graph theorysystems on graphssignal processing on graphsgraph neural networksmachine learning on graphsbig data on graphsgraph topology learninggraphs and tensorsrandom data on graphsvertex-frequency estimation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (3)

A class of doubly stochastic shift operators for random graph signals and their boundedness ⋮ Spectral graph wavelet packets frames ⋮ Diffusion optical tomography reconstruction based on convex–nonconvex graph total variation regularization

Uses Software

• t-SNE
• BRAPH
• Brain Connectivity Toolbox
• UMAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph clustering
• Spectra of graphs
• Spectral distances of graphs
• Eigenvectors of random matrices: A survey
• Spectral partitioning works: planar graphs and finite element meshes
• Non-negative and sparse spectral clustering
• Singular value decompositions of complex symmetric matrices
• Eigenvalues and expanders
• The electrical resistance of a graph captures its commute and cover times
• Which graphs are determined by their spectrum?
• Vertex-frequency analysis of graph signals
• Laplacians and the Cheeger inequality for directed graphs
• A combinatorial Laplacian with vertex weights
• Diffusion maps
• Bounds for the least Laplacian eigenvalue of a signed graph
• Isoperimetric numbers of graphs
• On the notion of balance of a signed graph
• Geometrical Structure of Laplacian Eigenfunctions
• Approximating Spectral Clustering via Sampling: A Review
• Spectrum of the 1-Laplacian and Cheeger's Constant on Graphs
• Discrete Calculus
• Graphical Models, Exponential Families, and Variational Inference
• A simple min-cut algorithm
• Clustering With Multi-Layer Graphs: A Spectral Perspective
• Discrete Signal Processing on Graphs
• Discrete Signal Processing on Graphs: Frequency Analysis
• On the Shift Operator, Graph Frequency, and Optimal Filtering in Graph Signal Processing
• Developments in the theory of graph spectra
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Eigenvalues of Laplacians on a Closed Riemannian Manifold and Its Nets
• Kron Reduction of Graphs With Applications to Electrical Networks
• Geometric Methods in Signal and Image Analysis
• On the Laplacian spectra of product graphs
• Graphical models
• Contour and texture analysis for image segmentation
• Graph Sparsification by Effective Resistances

This page was built for publication: Data Analytics on Graphs Part I: Graphs and Spectra on Graphs