Graph Fourier MMD for Signals on Graphs.
Samuel LeoneAarthi VenkatGuillaume HuguetAlexander TongGuy WolfSmita KrishnaswamyPublished in: CoRR (2023)
Keyphrases
- graph representation
- graph theory
- graph structure
- graph matching
- graph databases
- graph construction
- weighted graph
- directed graph
- graph mining
- adjacency matrix
- labeled graphs
- graph structures
- graph theoretic
- graph model
- series parallel
- graph clustering
- graph theoretical
- graph properties
- graph classification
- undirected graph
- fourier analysis
- bipartite graph
- subgraph isomorphism
- graph data
- graph kernels
- structural pattern recognition
- inexact graph matching
- graph partitioning
- graph isomorphism
- random graphs
- maximum cardinality
- graph transformation
- spanning tree
- dynamic graph
- directed acyclic
- graph representations
- random walk
- maximum common subgraph
- evolving graphs
- disk resident
- fourier transform
- graph search
- planar graphs
- finding the shortest path
- frequent subgraphs
- adjacency graph
- neighborhood graph
- proximity graph
- graph drawing
- graph layout
- graph patterns
- real world graphs
- maximum clique
- association graph
- connected graphs
- signal processing
- frequency domain
- structured data
- image reconstruction
- connected components
- shortest path
- connected dominating set
- polynomial time complexity
- reachability queries
- edge weights
- bounded treewidth
- hilbert transform
- average degree
- small world
- graph embedding
- maximal cliques
- dense subgraphs
- vertex set
- attributed graphs
- attributed relational graph
- community discovery