Results 1 to 10 of about 180,088 (293)

Multi-Duplicated Characterization of Graph Structures Using Information Gain Ratio for Graph Neural Networks

open access: yesIEEE Access, 2023
Various graph neural networks (GNNs) have been proposed to solve node classification tasks in machine learning for graph data. GNNs use the structural information of graph data by aggregating the feature vectors of neighboring nodes.
Yuga Oishi, Ken Kaneiwa
doaj   +5 more sources

Eigenvalues of complex unit gain graphs and gain regularity [PDF]

open access: yesSpecial Matrices
A complex unit gain graph (or T{\mathbb{T}}-gain graph) Γ=(G,γ)\Gamma =\left(G,\gamma ) is a gain graph with gains in T{\mathbb{T}}, the multiplicative group of complex units.
Brunetti Maurizio
doaj   +4 more sources

On cospectrality of gain graphs

open access: yesSpecial Matrices, 2022
We define GG-cospectrality of two GG-gain graphs (Γ,ψ)\left(\Gamma ,\psi ) and (Γ′,ψ′)\left(\Gamma ^{\prime} ,\psi ^{\prime} ), proving that it is a switching isomorphism invariant.
Cavaleri Matteo, Donno Alfredo
doaj   +4 more sources

On two Laplacian matrices for skew gain graphs [PDF]

open access: yesElectronic Journal of Graph Theory and Applications, 2021
Gain graphs are graphs where the edges are given some orientation and labeled with the elements (called gains) from a group so that gains are inverted when we reverse the direction of the edges.
Roshni T. Roy   +2 more
doaj   +3 more sources

Gain and Pain in Graph Partitioning: Finding Accurate Communities in Complex Networks

open access: yesAlgorithms
This paper presents an approach to community detection in complex networks by simultaneously incorporating a connectivity-based metric and Max-Min Modularity.
Arman Ferdowsi, Maryam Dehghan Chenary
doaj   +2 more sources

Burnside Chromatic Polynomials of Group-Invariant Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2023
We introduce the Burnside chromatic polynomial of a graph that is invariant under a group action. This is a generalization of the Q-chromatic function Zaslavsky introduced for gain graphs.
White Jacob A.
doaj   +1 more source

Domain Entity Extraction Method Based on Graph Sorting and Maximal Information Gain [PDF]

open access: yesJisuanji gongcheng, 2022
Domain knowledge graphs play an important role in various industries, and the acquisition of the domain entity is an important basis for their construction.However, existing approaches frequently rely on human work such as data annotation and the ...
ZHANG Xiaoming, ZHENG Lixin, WANG Huiyong
doaj   +1 more source

On the Fractionalization of the Shift Operator on Graphs

open access: yesIEEE Access, 2022
The theory of graph signal processing has been established with the purpose of generalizing tools from classical digital signal processing to the cases where the signal domain can be modeled by an arbitrary graph.
Guilherme B. Ribeiro   +2 more
doaj   +1 more source

A dual‐modal graph attention interaction network for person Re‐identification

open access: yesIET Computer Vision, 2023
Person Re‐identification (Re‐ID) is a task of matching target pedestrians under cross‐camera surveillance. Learning discriminative feature representations is the main issue for person Re‐ID.
Wen Wang, Gaoyun An, Qiuqi Ruan
doaj   +1 more source

Balancedness and the Least Laplacian Eigenvalue of Some Complex Unit Gain Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2020
Let 𝕋4 = {±1, ±i} be the subgroup of 4-th roots of unity inside 𝕋, the multiplicative group of complex units. A complex unit gain graph Φ is a simple graph Γ = (V (Γ) = {v1, . . .
Belardo Francesco   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy