Geometric knowledge distillation: Topology compression for graph neural networks

C Yang, Q Wu, J Yan - Advances in Neural Information …, 2022 - proceedings.neurips.cc
We study a new paradigm of knowledge transfer that aims at encoding graph topological
information into graph neural networks (GNNs) by distilling knowledge from a teacher GNN …

Unsupervised metric fusion over multiview data by graph random walk-based cross-view diffusion

Y Wang, W Zhang, L Wu, X Lin… - IEEE transactions on …, 2015 - ieeexplore.ieee.org
Learning an ideal metric is crucial to many tasks in computer vision. Diverse feature
representations may combat this problem from different aspects; as visual data objects …

Graph variational auto-encoder for deriving EEG-based graph embedding

T Behrouzi, D Hatzinakos - Pattern Recognition, 2022 - Elsevier
Graph embedding is an effective method for deriving low-dimensional representations of
graph data. The power of graph deep learning methods to characterize …

Combining graph edit distance and triplet networks for offline signature verification

P Maergner, V Pondenkandath, M Alberti… - Pattern Recognition …, 2019 - Elsevier
Offline signature verification is a challenging pattern recognition task where a writer model is
inferred using only a small number of genuine signatures. A combination of complementary …

Semisupervised hyperspectral band selection via spectral–spatial hypergraph model

X Bai, Z Guo, Y Wang, Z Zhang… - IEEE Journal of Selected …, 2015 - ieeexplore.ieee.org
Band selection is an essential step toward effective and efficient hyperspectral image
classification. Traditional supervised band selection methods are often hindered by the …

Backtrackless walks on a graph

F Aziz, RC Wilson, ER Hancock - IEEE transactions on neural …, 2013 - ieeexplore.ieee.org
The aim of this paper is to explore the use of backtrackless walks and prime cycles for
characterizing both labeled and unlabeled graphs. The reason for using backtrackless walks …

A local structural descriptor for image matching via normalized graph Laplacian embedding

J Tang, L Shao, X Li, K Lu - IEEE transactions on cybernetics, 2015 - ieeexplore.ieee.org
This paper investigates graph spectral approaches to the problem of point pattern matching.
Specifically, we concentrate on the issue of how to effectively use graph spectral properties …

Graph edit distance: Restrictions to be a metric

F Serratosa - Pattern Recognition, 2019 - Elsevier
In the presentation of the graph edit distance in 1983 and other newer bibliography, authors
state that it is necessary to apply the distance restrictions (non-negativity, identity of …

Functional connectivity estimation over large networks at cellular resolution based on electrophysiological recordings and structural prior

S Ullo, TR Nieus, D Sona, A Maccione… - Frontiers in …, 2014 - frontiersin.org
Despite many structural and functional aspects of the brain organization have been
extensively studied in neuroscience, we are still far from a clear understanding of the …

STAR‐Laplacian Spectral Kernels and Distances for Geometry Processing and Shape Analysis

G Patané - Computer Graphics Forum, 2016 - Wiley Online Library
In geometry processing and shape analysis, several applications have been addressed
through the properties of the spectral kernels and distances, such as commute‐time …