Results 21 to 30 of about 649,217 (300)
Joint Embedding of Graphs [PDF]
Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a method to jointly embed multiple undirected graphs.
Shangsi Wang +3 more
openaire +3 more sources
Knowledge Graph Embedding-Based Domain Adaptation for Musical Instrument Recognition
Convolutional neural networks raised the bar for machine learning and artificial intelligence applications, mainly due to the abundance of data and computations.
Victoria Eyharabide +2 more
doaj +1 more source
Corrigendum to "Embedding Graphs into Colored Graphs" [PDF]
The authors give a corrected exposition of the proof of Theorem 12 of their quoted paper [ibid. 307, No. 1, 395-409 (1988; Zbl 0659.03029)].
Hajnal, András, Komjáth, P.
openaire +2 more sources
A Toroidal Maxwell–Cremona–Delaunay Correspondence
We consider three classes of geodesic embeddings of graphs on Euclidean flat tori: • A toroidal graph embedding Γ is positive equilibrium if it is possible to place positive weights on the edges, such that the weighted edge vectors incident to each ...
Jeff Erickson, Patrick Lin
doaj +1 more source
Genus Distribution for a Graph [PDF]
In this paper we develop the technique of a distribution decomposition for a graph. A formula is given to determine genus distribution of a cubic graph.
Liangxia, Wan +2 more
core +1 more source
A Novel Global Prototype-Based Node Embedding Technique
Node embedding refers to learning or generating low-dimensional representations for nodes in a given graph. In the era of big data and large graphs, there has been a growing interest in node embedding across a wide range of applications, ranging from ...
Zyad Alkayem +4 more
doaj +1 more source
Graph Embedding With Data Uncertainty [PDF]
20 pages, 4 ...
Laakom, Firas +5 more
openaire +10 more sources
Hyperbolic Knowledge Graph Embeddings for Knowledge Base Completion [PDF]
Alexandros Kalousis, Dimitris Kiritsis
exaly +1 more source
Intersection Graphs in Simultaneous Embedding with Fixed Edges
We examine the problem for two planar graphs G1 and G2 with the focus on their intersection S = G1∩G2. In particular, we will present the complete set of intersection graphs S that guarantee a for (G1,G2).
Michael Jünger, Michael Schulz
doaj +1 more source
Attribute Graph Clustering Based on Self-Supervised Spectral Embedding Network
Attribute graph clustering requires joint modeling of both graph structure and node properties, which is challenging. In recent years, graph neural networks have been utilized to mine deep information on attribute graphs through feature aggregation ...
Xiaolin Ning +3 more
doaj +1 more source

