Results 11 to 20 of about 117,362 (280)
PolSAR Image Feature Extraction via Co-Regularized Graph Embedding
Remote Sensing, 2020 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
Remote Sensing, 2020 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
The Electronic Journal of Combinatorics, 2022 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 +3 more sources
IEEE Access, 2014 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
The Electronic Journal of Combinatorics, 2015 An undirected simple graph $G=(V,E)$ is called antimagic if there exists an injective function $f:E\rightarrow\{1,\dots,|E|\}$ such that $\sum_{e\in E(u)} f(e)\neq\sum_{e\in E(v)} f(e)$ for any pair of different nodes $u,v\in V$. In this note we prove — with a slight modification of an argument of Cranston et al. — that $k$-regular graphs are antimagic
Bérczi, Kristóf +2 more
openaire +3 more sources
Abnormal Electricity Behavior Recognition of Graph Regularization Nonlinear Ridge Regression Model [PDF]
Jisuanji gongcheng, 2018 For the detection of abnormal electricity behavior by users,power companies usually adopt manual inspection methods,however,this method requires a lot of manpower and material resources,and is influened by subjective factors.Therefore,an abnormal ...
ZHANG Xiaofei,GENG Juncheng,SUN Yubao
doaj +1 more source
Artist Similarity for Everyone: A Graph Neural Network Approach
Transactions of the International Society for Music Information Retrieval, 2022 Artist similarity plays an important role in organizing, understanding, and subsequently, facilitating discovery in large collections of music. In this paper, we present a hybrid approach to computing similarity between artists using graph neural ...
Filip Korzeniowski +2 more
doaj +1 more source
Regular packings of regular graphs
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amauri Gutiérrez, Anna S. Lladó
openaire +2 more sources
Formalized Mathematics, 2023 Abstract In this article regular graphs, both directed and undirected, are formalized in the Mizar system [7], [2], based on the formalization of graphs as described in [10]. The handshaking lemma is also proven.
openaire +2 more sources
Graph Regularization Methods in Soft Detector Fusion
IEEE Access, 2023 This paper presents a theoretical derivation of two new graph-based regularization methods for fusing the individual results of multiple detectors (two-class classifiers).
Addisson Salazar +3 more
doaj +1 more source