Results 41 to 50 of about 845,204 (303)
Scalable Robust Graph Embedding with Spark
Graph embedding aims at learning a vector-based representation of vertices that incorporates the structure of the graph. This representation then enables inference of graph properties.
Weidlich, Matthias +5 more
core +1 more source
Exploring the Semantic Content of Unsupervised Graph Embeddings: An Empirical Study
Graph embeddings have become a key and widely used technique within the field of graph mining, proving to be successful across a broad range of domains including social, citation, transportation and biological. Unsupervised graph embedding techniques aim
Stephen Bonner +5 more
doaj +1 more source
Real-Time Semantic Data Flow Reasoning Based on Improved Multi-Embedding Space [PDF]
The joint use of semantic data flow processing engine and knowledge graph embedding representation learning can effectively improve the performance of real-time data stream reasoning and query.The existing knowledge representation learning models pay ...
GAO Feng, YAO Guangtao, GU Jinguang
doaj +1 more source
Isometric embeddings of graphs [PDF]
We prove that any finite undirected graph can be canonically embedded isometrically into a maximum cartesian product of irreducible factors.
Graham, R. L., Winkler, P. M.
openaire +3 more sources
Enriching Translation-Based Knowledge Graph Embeddings Through Continual Learning
This paper addresses an enrichment of translation-based knowledge graph embeddings. When new knowledge triples become available after a knowledge graph is embedded onto a vector space, the embedding should be enriched with the new triples, but without ...
Hyun-Je Song, Seong-Bae Park
doaj +1 more source
SAGES: Scalable Attributed Graph Embedding With Sampling for Unsupervised Learning
Unsupervised graph embedding method generates node embeddings to preserve structural and content features in a graph without human labeling burden. However, most unsupervised graph representation learning methods suffer issues like poor scalability or ...
Wang, Jialin +5 more
core +1 more source
Enumeration of graph embeddings
Let \(G\) be a finite connected simple graph, with \(\Gamma\) a subgroup of \(\Aut G\). Two 2-cell imbeddings \(i: G\to S\) and \(j: G\to S\) of \(G\) into a closed surface \(S\) (orientable or nonorientable) are said to be congruent with respect to \(\Gamma\) if there exist a surface homeomorphism \(h: S\to S\) and a \(\gamma\in \Gamma\) such that \(h\
KWAK, JH, LEE, J
openaire +3 more sources
whole-graph-embedding-us-city-polycentricity
Conventional polycentricity scores and embedding vectors of US ...
Cheng Fu (8354925)
core +1 more source
The author surveys some recent results about graphs embedded on higher surfaces or in general topological spaces. He begins by examining the relationship between the Jordan Curve Theorem and Kuratowski's Theorem. In particular, he discusses his result that in an arbitrary arcwise connected Hausdorff space which is not a simple closed curve and in which
openaire +2 more sources
Attention-Aware Heterogeneous Graph Neural Network
As a powerful tool for elucidating the embedding representation of graph-structured data, Graph Neural Networks (GNNs), which are a series of powerful tools built on homogeneous networks, have been widely used in various data mining tasks.
Jintao Zhang, Quan Xu
doaj +1 more source

