Results 1 to 10 of about 48,825 (164)
Nonintrusive Power Load Decomposition Based on Adaptive Graph Convolutional Neural Network [PDF]
SensorsTo fully exploit the correlation between the operating states of appliances, an adaptive graph convolutional neural network (AChebNet) for nonintrusive power load decomposition is proposed.
Pinzhang Zhao +3 more
doaj +2 more sources
Density-Friendly Graph Decomposition [PDF]
ACM Transactions on Knowledge Discovery From Data, 2019 Decomposing a graph into a hierarchical structure via k -core analysis is a standard operation in any modern graph-mining toolkit. k -core decomposition is a simple and efficient method that allows to analyze a graph beyond its mere degree distribution.
Nikolaj Tatti
exaly +4 more sources
SparsePool: A Graph Pooling Framework via Sparse Representation for Graph Classification [PDF]
SensorsGraph neural networks (GNNs) have achieved great success in graph classification, with graph pooling methods being widely adopted for related tasks. Existing approaches typically rely on node ranking or clustering to coarsen graphs, but often fail to ...
Zehan Li +4 more
doaj +2 more sources
GSD: An R package for graph signal decomposition
SoftwareXGraph signals residing on the vertices of a graph have recently gained prominence in research of various fields, including neural networks, social networks, traffic patterns, and sensors.
Hyeonglae Cho, Hee-Seok Oh, Donghoh Kim
doaj +3 more sources
Graph Decompositions and Factorizing Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 A factorizing permutation of a given graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. It is applied here
Christian Capelle +2 more
doaj +2 more sources
Knowledge Graph Reasoning Based on Tensor Decomposition and MHRP-Learning
Advances in Multimedia, 2021 In the process of learning and reasoning knowledge graph, the existing tensor decomposition technology only considers the direct relationship between entities in knowledge graph. However, it ignores the characteristics of the graph structure of knowledge
Tangsen Huang +3 more
doaj +1 more source
An Efficient Subgraph Isomorphism Solver for Large Graphs
IEEE Access, 2021 For a given pair of pattern and data graphs, the subgraph isomorphism finding problem locates all instances of the pattern graph into the data graph. For a given subgraph isomorphic image of the pattern graph in a data graph, the set of all ordered pairs
Zubair Ali Ansari +2 more
doaj +1 more source
Eulerian Cycle Decomposition Conjecture for the line graph of complete graphs
AKCE International Journal of Graphs and Combinatorics, 2019 The Eulerian Cycle Decomposition Conjecture, by Chartrand, Jordon and Zhang, states that if the minimum number of odd cycles in a cycle decomposition of an Eulerian graph G of size m is a, the maximum number of odd cycles in such a cycle decomposition is
R. Rajarajachozhan, R. Sampathkumar
doaj +2 more sources
Constrained ear decompositions in graphs and digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a ...
Frédéric Havet, Nicolas Nisse
doaj +1 more source
Capturing Polynomial Time using Modular Decomposition [PDF]
Logical Methods in Computer Science, 2019 The question of whether there is a logic that captures polynomial time is one of the main open problems in descriptive complexity theory and database theory.
Berit Grußien
doaj +1 more source