Results 21 to 30 of about 11,677,433 (308)

Modeling multiple latent information graph structures via graph convolutional network for aspect-based sentiment analysis

open access: yesComplex & Intelligent Systems, 2022
Aspect-based sentiment analysis (ABSA) aims to determine the sentiment polarity of aspects in a sentence. Recently, graph convolution network (GCN) model combined with attention mechanism has been used for ABSA task over graph structures, achieving ...
Jiajun Wang, Xiaoge Li, Xiaochun An
doaj   +1 more source

Using Games to Investigate Movement for Graph Comprehension [PDF]

open access: yes, 2004
We describe the results of empirical investigations that explore the effectiveness of moving graph diagrams to improve the comprehension of their structure.
Bovey, John D.   +5 more
core   +1 more source

Enabling inductive knowledge graph completion via structure-aware attention network

open access: yes, 2023
: Knowledge graph completion (KGC) aims at complementing missing entities and relations in a knowledge graph (KG). Popular KGC approaches based on KG embedding are typically limited to the transductive setting, i.e., all entities must be seen during ...
Jin, Qun   +9 more
core   +1 more source

Complete graph invariant and algorithm of its computation

open access: yesИзвестия Томского политехнического университета: Инжиниринг георесурсов, 2019
The relevance of the discussed issue is caused by the fact, that in graph theory, since the mid of the last century, all attempts to find the form of complete invariant and to develop the effective algorithm for it computation have been failed.
Andrey Pogrebnoy
doaj   +2 more sources

Coalition structure generation over graphs [PDF]

open access: yes, 2012
We give the analysis of the computational complexity of coalition structure generation over graphs. Given an undirected graph G = (N,E) and a valuation function v : P(N) → R over the subsets of nodes, the problem is to find a partition of N into ...
Polukarov, Maria   +5 more
core   +1 more source

Polynomial algorithm of computing complete graph invariant on the basis of integral structure descriptor

open access: yesИзвестия Томского политехнического университета: Инжиниринг георесурсов, 2019
The relevance of the research is caused by the unsolved problem of searching for the complete graph invariant and polynomial algorithm for its computing.
V. K. Pogrebnoy, A. V. Pogrebnoy
doaj   +2 more sources

Ideal Graph of a Graph [PDF]

open access: yes, 2011
In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core   +1 more source

An efficient self-attention network for skeleton-based action recognition

open access: yesScientific Reports, 2022
There has been significant progress in skeleton-based action recognition. Human skeleton can be naturally structured into graph, so graph convolution networks have become the most popular method in this task.
Xiaofei Qin   +4 more
doaj   +1 more source

Graphical Encoding of a Spatial Logic for the pi-Calculus [PDF]

open access: yes, 2007
This paper extends our graph-based approach to the verification of spatial properties of π-calculus specifications. The mechanism is based on an encoding for mobile calculi where each process is mapped into a graph (with interfaces) such that the ...
Gadducci, Fabio   +4 more
core   +1 more source

Polynomiality of method for computing graph structure integral descriptor

open access: yesИзвестия Томского политехнического университета: Инжиниринг георесурсов, 2019
The relevance of the research is caused by the necessity of developing the efficient method of invariant description and analysis of abstract structures of graph models.
V. K. Pogrebnoy, A. V. Pogrebnoy
doaj   +2 more sources

Home - About - Disclaimer - Privacy