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 14 of 14 for “"graph embeddings"”.
-
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 …
-
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 …
-
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 …
-
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 …
-
Enumeration of polyhedral graphs
… focuses on specic classes of polyhedra and their graph theoretic properties. This is then compared more broadly to other graph enumeration algorithms that are concerned with the same or a superset which includes these properties. An original and novel algorithm is contributed to this area. The …
-
Learning generalizable device placement algorithms for distributed machine learning
… a device placement for a specific computation graph, Placeto can learn generalizable device placement policies that can be applied to any graph. We propose two key ideas in our approach: (1) we represent the policy as performing iterative placement improvements, rather than outputting a …
-
Topological Operations for Genus Distributions and Embeddings of Graphs
The research of graph embeddings on surfaces started from Euler's equation v e+f = 2. For a connected graph G, v, e and f represent the number of vertices, edges and regions of an embedding on a plane or sphere. Genus embedding of graphs is one of the most studied subjects in topological graph …
-
Drug Repurposing Using Gene Expression Data Mining
… <p>Third, I have applied the knowledge graph model to drug repurposing. The model integrates multiple sources of information from diverse biomedical databases, including genes, drugs, phenotypes, and patients. The knowledge graph embeddings provide representations of biological entities …
-
Graph-Based Machine Learning for Passive Network Reconnaissance within Encrypted Networks
… conditions. In contrast, we devise a bipartite graph-based representation to create network reconnaissance solutions that rely only on a single feature (e.g., the Internet protocol (IP) address field). We exploit a widely available feature set to provide network reconnaissance solutions that are …
-
A Framework for Semantic Enterprise Transformations
… and applies these patterns to an underlying graph structure. By generalizing semantic transformations through patterns and graphs (Chapter 5), it is possible not only to determine a traversal path to find a corresponding code value, but to predict missing nodes through the use of graph …
-
Genus Distributions of Graphs Constructed Through Amalgamations
Graphs are commonly represented as points in space connected by lines. The points in space are the vertices of the graph, and the lines joining them are the edges of the graph. A general definition of a graph is considered here, where multiple edges are allowed between two vertices and an edge is …
-
Topics in trivalent graphs
… most important property of E/Z* is the Unique graph theorem: unlike in E, a list of which reduced vectors are edges uniquely determines graph structure (if edge connectivity is high enough; that covers certain “solid” components every trivalent graph can be decomposed into). Chapter 2 gives a …
-
The resurgence of structure in deep neural networks
… (operating on sparse multimodal and graph-structured data), and a structure-informed learning algorithm for graph neural networks, demonstrating significant outperformance of conventional baseline models and algorithms.