Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 70 for “"graph embeddings"”.
-
Knowledge Graph Embeddings for Recommender Systems
L'abstract è presente nell'allegato / the abstract is in the attachment
-
Sufficient degree conditions for graph embeddings
… on the sufficient conditions to guarantee one graph being the subgraph of another. In Chapter 2, we discuss list packing, a modification of the idea of graph packing. This is fitting one graph in the complement of another graph. Sauer and Spencer showed a sufficient bound involving maximum …
-
Improving Dialog Systems Using Knowledge Graph Embeddings
… question to answer in an open-domain. Knowledge graph embedding started as a way to scale question answering to a large, open-domain dataset without the use of hand-crafted rules. This thesis seeks to connect the two, by converting knowledge graph embeddings to word embeddings and evaluating the …
-
Geospatial Query Answering Using Knowledge Graph Embeddings
Τα γραφήματα γεωχωρικής γνώσης πάσχουν από ελλιπή στοιχεία, τα οποία οφείλονται στις όχι πάντα αξιόπιστες πηγές δεδομένων. Αυτό επηρεάζει δραματικά τα αποτελέσματα της απάντησης γεωχωρικών ερωτημάτων με τις παραδοσιακές τεχνικές που χρησιμοποιούν τυποποιημένες γλώσσες ερωτημάτων όπως η stSPARQL ή η …
-
Graph embeddings for low-stretch greedy routing
… success guarantees. Greedy embedding is a graph embedding that makes the simple greedy packet forwarding successful for every source-destination pair. In this dissertation, we consider the problems of designing greedy graph embeddings that also yield low hop stretch of the greedy paths over …
-
Bounds on the maximal number of graph embeddings
… is the branch of mathematics that studies the embeddings (or equivalently realizations) of graphs in an euclidean space or a manifold.If the number of realizations satisfying edge length constraints is finite up to rigid motions, then the embedding is called rigid, otherwise it is called …
-
GRAPH EMBEDDINGS FOR LINK PREDICTION IN SCIENTIFIC COLLABORATION NETWORKS
… and employs a network analysis technique, graph embedding, to study the patterns of scientific collaboration network which considers both network structures and node features. Based on data collected from a major IS research database (AISeL) on the topic of healthcare research, this thesis …
-
Graph Embeddings for the extraction of Compiler Provenance features
This thesis explores the use of graph embedding methods for compiler provenance identification. Graph embedding algorithms are widely used to analyze, compare, or distinguish networks, or similar structures, that are too large to represent visually. Using graph embeddings to address the problem of …
-
Uncovering latent structure in social networks using graph embeddings
… has been one of the commonly studied problems of graph mining, and is recognized as a challenging necessary task, and many open tasks are still poorly understood. We show that user information from social network platforms such as Instagram can be clustered using similarities based independently …
-
Fact-based visual question answering using knowledge graph embeddings
… It must include facts from a diverse knowledge graph (KG) in its reasoning process to produce an answer. Large KGs, especially common-sense KGs, are known to be incomplete, i.e., not all non-existent facts are always incorrect. Therefore, being able to reason over incomplete KGs for QA is a …
-
Graph embeddings for deep learning in general game playing
… positions describing the game states but also a graph-based embedding of the game rules (derived from GDL). The game rules are encoded as either Rule Graphs or Propositional Networks, and then we experiment with several different graph-based embeddings for encoding the graphs. The result shows …
-
Distortion Lower Bounds for Graph Embeddings in the Style of Matoušek
… invariants of spaces which prevent “good” embeddings of various types of graphs. These are known as embedding obstructions. To this end, the primary focus of this dissertation is providing optimal distortion lower bounds for bi-Lipschitz embeddings into spaces satisfying certain embedding …
-
Plane Permutations and their Applications to Graph Embeddings and Genome Rearrangements
… fields. A map is a 2-cell embedding of a graph on an orientable surface. Motivated by a new way to read the information provided by the skeleton of a map, we introduce new objects called plane permutations. Plane permutations not only provide new insight into enumeration of maps and …
-
Unsupervised approaches for time-evolving graph embeddings with application to human microbiome
… Constructing and analyzing time-evolving graphs is needed to understand how microbial ecosystems respond to a range of distinct perturbations, such as antibiotic exposure, diseases, or other general dynamic properties. This becomes especially challenging due to dozens of complex …
-
On Graph Embeddings and a new Minor Monotone Graph Parameter associated with the Algebraic Connectivity of a Graph
… of the weighted Laplacian of a (simple) graph over all nonnegative edge weightings with bounded total weight. We generalize this problem by introducing node significances and edge lengths. We give a formulation of this generalized problem as a semidefinite program. The dual program can be …
-
Towards Learning Powerful Deep Graph Neural Networks and Embeddings
Learning powerful data embeddings has recently become the core of machine learning algorithms especially in natural language processing and computer vision domains. In the graph domain, the applications of learning graph embeddings are vast and have distinguished use-cases across multi-cross …
-
Reproducing and Explaining Entity and Relation Embeddings for Link Prediction in Knowledge Graphs
Embedding knowledge graphs is a common method used to encode information from the graph at hand projected in a low dimensional space. There are two shortcomings in the field of knowledge graph embeddings for link prediction. The first shortcoming is that, as far as we know, current software …
-
Kernel Methods for Graph-structured Data Analysis
Structured data modeled as graphs arise in many application domains, such as computer vision, bioinformatics, and sociology. In this dissertation, we focus on three important topics in graph-structured data analysis: graph comparison, graph embeddings, and graph matching, for all of which we …
-
Tracking uncertainty in knowledge graphs using Kalman filtering
Knowledge graphs (KGs) represent structured knowledge as networks of entities and relations, forming a foundation for reasoning in artificial intelligence. To make these symbolic structures usable by machine learning systems, knowledge graph embeddings (KGEs) map entities and relations into …
Page 1 of 4