Results 21 to 30 of about 168,521 (260)

Multi-Behavior Enhanced Heterogeneous Graph Convolutional Networks Recommendation Algorithm based on Feature-Interaction

open access: yesApplied Artificial Intelligence, 2023
Graph convolution neural networks have shown powerful ability in recommendation, thanks to extracting the user-item collaboration signal from users’ historical interaction information.
Yang Li   +4 more
doaj   +1 more source

Deeper Exploiting Graph Structure Information by Discrete Ricci Curvature in a Graph Transformer

open access: yesEntropy, 2023
Graph-structured data, operating as an abstraction of data containing nodes and interactions between nodes, is pervasive in the real world. There are numerous ways dedicated to extract graph structure information explicitly or implicitly, but whether it ...
Xin Lai   +4 more
doaj   +1 more source

Coloring permutation-gain graphs

open access: yesContributions to Discrete Mathematics, 2021
Correspondence colorings of graphs were introduced in 2018 by Dvořák and Postle as a generalization of list colorings of graphs which generalizes ordinary graph coloring. Kim and Ozeki observed that correspondence colorings generalize various notions of signed-graph colorings which again generalizes ordinary graph colorings.
openaire   +1 more source

Line graphs of complex unit gain graphs with least eigenvalue -2

open access: yesThe Electronic Journal of Linear Algebra, 2021
Let $\mathbb T$ be the multiplicative group of complex units, and let $\mathcal L (\Phi)$ denote a line graph of a $\mathbb{T}$-gain graph $\Phi$. Similarly to what happens in the context of signed graphs, the real number $\min Spec(A(\mathcal L (\Phi))$, that is, the smallest eigenvalue of the adjacency matrix of $\mathcal L(\Phi)$, is not less than $-
Belardo F., Brunetti M.
openaire   +4 more sources

Oriented gain graphs, line graphs and eigenvalues [PDF]

open access: yesLinear Algebra and its Applications, 2016
A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of gain graphs with complex units, matrix properties are established.
openaire   +3 more sources

NEPS of complex unit gain graphs

open access: yesThe Electronic Journal of Linear Algebra, 2023
A complex unit gain graph (or $\mathbb T$-gain graph) is a gain graph with gains in $\mathbb T$, the multiplicative group of complex units. Extending a classical construction for simple graphs due to Cvektovic, suitably defined noncomplete extended $p$-sums (NEPS, for short) of $\mathbb T$-gain graphs are considered in this paper. Structural properties
Francesco Belardo   +2 more
openaire   +3 more sources

Model Learning Cycle 5E Berbantuan LKPD Berbasis Three-Dimensional Thinking Graph dan Pengaruhnya Terhadap Scientific Reasoning Pada Siswa SMP

open access: yesJurnal Paedagogy, 2023
This study aims to analyze the effect of the 5E learning cycle model assisted by LKPD based on a three-dimensional thinking graph on scientific reasoning and the improvement of scientific reasoning.
Hamidita Putri Ristia   +2 more
doaj   +1 more source

GAIN: Graph Attention & Interaction Network for Inductive Semi-Supervised Learning Over Large-Scale Graphs [PDF]

open access: yesIEEE Transactions on Knowledge and Data Engineering, 2022
Accepted by IEEE Transactions on Knowledge and Data Engineering (TKDE)
Yunpeng Weng   +3 more
openaire   +2 more sources

The graph grabbing game on {0,1}-weighted graphs

open access: yesResults in Applied Mathematics, 2019
The graph grabbing game is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them.
Soogang Eoh, Jihoon Choi
doaj   +1 more source

Spectral properties of complex unit gain graphs [PDF]

open access: yesLinear Algebra and its Applications, 2012
13 pages, 1 figure, to appear in Linear Algebra ...
openaire   +3 more sources

Home - About - Disclaimer - Privacy