Results 51 to 60 of about 70,588 (313)
Exploring the Semantic Content of Unsupervised Graph Embeddings: An Empirical Study
Data Science and Engineering, 2019 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
Simultaneous Graph Embedding with Bends and Circular Arcs [PDF]
, 2007 We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial embeddings for curvilinear simultaneous embeddings of a path and an outerplanar ...
Cappos, Justin +3 more
core +1 more source
Enriching Translation-Based Knowledge Graph Embeddings Through Continual Learning
IEEE Access, 2018 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
Enumeration of graph embeddings
Discrete Mathematics, 1994 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 +2 more sources
Knowledge Graph Embeddings [PDF]
, 2012 With the growing popularity of multi-relational data on the Web, knowledge graphs (KGs) have become a key data source in various application domains, such as Web search, question answering, and natural language understanding. In a typical KG such as Freebase (Bollacker et al.
Rosso, Paolo +2 more
openaire +2 more sources
Graph Embedding with Topological Cycle-Constraints [PDF]
, 1999 This paper concerns graph embedding under topological constraints. We address the problem of finding a planar embedding of a graph satisfying a set of constraints between its vertices and cycles that require embedding a given vertex inside its ...
Dornheim, Christoph, Christoph Dornheim
core +1 more source
Discrete Mathematics, 1994 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
Cross-Graph: Robust and Unsupervised Embedding for Attributed Graphs with Corrupted Structure [PDF]
, 2020 Graph embedding has shown its effectiveness to represent graph information and capture deep relationships in graph data. Most recent graph embedding methods focus on attributed graphs, since they preserve both structure and content information in the ...
Jiang, Jing +11 more
core +1 more source
Ellipsoidal Embeddings of Graphs
SIAM Journal on Applied MathematicsDue to their flexibility to represent almost any kind of relational data, graph-based models have enjoyed a tremendous success over the past decades. While graphs are inherently only combinatorial objects, however, many prominent analysis tools are based on the algebraic representation of graphs via matrices such as the graph Laplacian, or on ...
Michaël Fanuel +3 more
openaire +4 more sources
A survey of two-dimensional graph layout techniques for information visualisation [PDF]
, 2012 Many algorithms for graph layout have been devised over the last 30 years spanning both the graph drawing and information visualisation communities. This article first reviews the advances made in the field of graph drawing that have then often been ...
Vickers, Paul, Gibson, Helen, Faith, Joe
core +1 more source