Results 31 to 40 of about 904,948 (308)
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
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
Oriented gain graphs, line graphs and eigenvalues [PDF]
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
Matroids of Gain Graphs in Applied Discrete Geometry [PDF]
A Γ \Gamma -gain graph is a graph whose oriented edges are labeled invertibly from a group Γ \Gamma . Zaslavsky proposed two matroids associated with Γ \Gamma -gain graphs, called frame matroids and lift matroids, and investigated linear representations of them.
Shin‐ichi Tanigawa
openalex +4 more sources
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
Bayesian graph edit distance [PDF]
This paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1].
Hancock, E.R., Myers, R., Wilson, R.C.
core +1 more source
The graph grabbing game on {0,1}-weighted graphs
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
Independence ratio and random eigenvectors in transitive graphs [PDF]
A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\lambda_{\min}$ of the spectrum of the adjacency matrix.
Harangi, Viktor, Virág, Bálint
core +2 more sources
A stochastic model for the evolution of the web allowing link deletion [PDF]
Recently several authors have proposed stochastic evolutionary models for the growth of the web graph and other networks that give rise to power-law distributions.
Albert R. +16 more
core +4 more sources
Feature-Enhanced Latent Summarization Model of Heterogeneous Network [PDF]
With the rapid growth of network data, large-scale heterogeneous network data storage and network repre-sentation have become hot research topics. This paper proposes two different tasks, generating graph summarization and generating node representations
XU Zhengxiang, WANG Ying, WANG Hongji, WANG Xin
doaj +1 more source

