Results 1 to 10 of about 666,730 (159)
Node-Adaptive Regularization for Graph Signal Reconstruction
A critical task in graph signal processing is to estimate the true signal from noisy observations over a subset of nodes, also known as the reconstruction problem.
Maosheng Yang +3 more
doaj +3 more sources
Neural Networks Regularization With Graph-Based Local Resampling
This paper presents the concept of Graph-based Local Resampling of perceptron-like neural networks with random projections (RN-ELM) which aims at regularization of the yielded model.
Alex D. Assis +4 more
doaj +1 more source
Catastrophic Forgetting in Deep Graph Networks: A Graph Classification Benchmark
In this work, we study the phenomenon of catastrophic forgetting in the graph representation learning scenario. The primary objective of the analysis is to understand whether classical continual learning techniques for flat and sequential data have a ...
Antonio Carta +4 more
doaj +1 more source
Regular colorings in regular graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anton Bernshteyn +6 more
openaire +4 more sources
Although a graph-based semisupervised learning (SSL) approach can utilize limited numbers of labeled samples for hyperspectral image (HSI) classification, it is difficult to use the large amount of pixels in an HSI to construct a large-scale graph.
Longshan Yang +4 more
doaj +1 more source
Hyperspectral Image Super-Resolution Algorithm Based on Graph Regular Tensor Ring Decomposition
This paper introduces a novel hyperspectral image super-resolution algorithm based on graph-regularized tensor ring decomposition aimed at resolving the challenges of hyperspectral image super-resolution.
Shasha Sun +5 more
doaj +1 more source
PolSAR Image Feature Extraction via Co-Regularized Graph Embedding
Dimensionality reduction (DR) methods based on graph embedding are widely used for feature extraction. For these methods, the weighted graph plays a vital role in the process of DR because it can characterize the data’s structure information.
Xiayuan Huang, Xiangli Nie, Hong Qiao
doaj +1 more source
We investigated nearest-neighbor density-based clustering for hyperspectral image analysis. Four existing techniques were considered that rely on a K-nearest neighbor (KNN) graph to estimate local density and to propagate labels through algorithm ...
Claude Cariou +2 more
doaj +1 more source
Degrees in Link Graphs of Regular Graphs
We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of $G$ has minimum degree at most $\lfloor{2d/3}\rfloor-1$, and if $G$ is sufficiently large in terms of $d$ then some ...
Benjamini, I, Haslegrave, J
openaire +4 more sources
A new regularization technique for graph Laplacians arising from triangular meshes of closed and open structures is presented. The new technique is based on the analysis of graph Laplacian spectrally equivalent operators in terms of Sobolev norms and on ...
Rajendra Mitharwal +1 more
doaj +1 more source

