Results 11 to 20 of about 2,805,373 (250)
Sampling and Recovery of Graph Signals [PDF]
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 +4 more sources
Graph products of groups [PDF]
In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems, employing length arguments on the elements of these groups.
Green, E.R, Green, Elisabeth Ruth
core +7 more sources
Sampling large data on graphs [PDF]
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 +3 more sources
Large Graph Sampling Algorithm for Frequent Subgraph Mining
Large graph networks frequently appear in the latest applications. Their graph structures are very large, and the interaction among the vertices makes it difficult to split the structures into separate multiple structures, thus increasing the difficulty ...
Tianyu Zheng, Li Wang
doaj +1 more source
Near-Optimal Graph Signal Sampling by Pareto Optimization
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
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
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]
5 pages, 1 ...
Nicolas Tremblay +2 more
openaire +4 more sources
In recent years, deep learning has drawn increasing attention in the field of hyperspectral remote sensing image classification and has achieved great success.
Xibing Zuo +5 more
doaj +1 more source
Kinematic Graph for Motion Planning of Robotic Manipulators
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

