Results 11 to 20 of about 184,942 (303)
Sampling and Recovery of Graph Signals [PDF]
, 2018 The aim of this chapter is to give an overview of the recent advances related to sampling and recovery of signals defined over graphs. First, we illustrate the conditions for perfect recovery of bandlimited graph signals from samples collected over a selected set of vertexes. Then, we describe some sampling design criteria proposed in the literature to
Paolo Di Lorenzo +2 more
openaire +3 more sources
Graph Neural Thompson Sampling
CoRRWe consider an online decision-making problem with a reward function defined over graph-structured data. We formally formulate the problem as an instance of graph action bandit. We then propose \texttt{GNN-TS}, a Graph Neural Network (GNN) powered Thompson Sampling (TS) algorithm which employs a GNN approximator for estimating the mean reward function ...
Shuang Wu, Arash A. Amini
openaire +4 more sources
Sampling large data on graphs [PDF]
2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP), 2014 We consider the problem of sampling from data defined on the nodes of a weighted graph, where the edge weights capture the data correlation structure. As shown recently, using spectral graph theory one can define a cut-off frequency for the bandlimited graph signals that can be reconstructed from a given set of samples (i.e., graph nodes). In this work,
Ilan Shomorony, Amir Salman Avestimehr
openaire +2 more sources
Graph Sampling for Map Comparison
ACM Transactions on Spatial Algorithms and Systems, 2023 Comparing two road maps is a basic operation that arises in a variety of situations. A map comparison method that is commonly used, mainly in the context of comparing reconstructed maps to ground-truth maps, is based on graph sampling .
Jordi Aguilar +5 more
openaire +2 more sources
Graph isomorphism and Gaussian boson sampling
Special Matrices, 2021 We introduce a connection between a near-term quantum computing device, specifically a Gaussian boson sampler, and the graph isomorphism problem. We propose a scheme where graphs are encoded into quantum states of light, whose properties are then probed ...
Brádler Kamil +4 more
doaj +1 more source
Near-Optimal Graph Signal Sampling by Pareto Optimization
Sensors, 2021 In this paper, we focus on the bandlimited graph signal sampling problem. To sample graph signals, we need to find small-sized subset of nodes with the minimal optimal reconstruction error.
Dongqi Luo +4 more
doaj +1 more source
BC tree-based spectral sampling for big complex network visualization
Applied Network Science, 2021 Graph sampling methods have been used to reduce the size and complexity of big complex networks for graph mining and visualization. However, existing graph sampling methods often fail to preserve the connectivity and important structures of the original ...
Jingming Hu +7 more
doaj +1 more source
Continuous Latent Spaces Sampling for Graph Autoencoder
Applied Sciences, 2023 This paper proposes colaGAE, a self-supervised learning framework for graph-structured data. While graph autoencoders (GAEs) commonly use graph reconstruction as a pretext task, this simple approach often yields poor model performance.
Zhongyu Li +4 more
doaj +1 more source
Graph sampling with determinantal processes [PDF]
2017 25th European Signal Processing Conference (EUSIPCO), 2017 5 pages, 1 ...
Nicolas Tremblay +2 more
openaire +3 more sources
Kinematic Graph for Motion Planning of Robotic Manipulators
Robotics, 2022 We introduce a kinematic graph in this article. A kinematic graph results from structuring the data obtained from the sampling method for sampling-based motion planning algorithms in robotics with the motivation to adapt the method to the positioning ...
Burkhard Corves, Amir Shahidi
doaj +1 more source