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 7 of 7 for “"Subgraph Matching"”.
-
A comprehensive and efficient framework for subgraph matching
… aims to develop a comprehensive and efficient subgraph matching framework to support graph analytic tasks. In the era of information technology, graphs, consisting of vertices and edges, are widely used to model real-world entities and their relationships, offering new opportunities to …
-
Efficient structure search in large data sets
… the structure search in graph data and focus on subgraph matching over large data graphs, which extracts all subgraph isomorphic embeddings of a query graph q in a large data graph G. For the first time we address the issue of unpromising results by Cartesian products from "dissimilar" vertices. …
-
Scalability and interpretability of graph neural networks for small molecules
… graph neural network architecture, called a subgraph matching neural network (SMNN), which is designed to have all feature representations and weights be human interpretable. I show that this network can achieve competitive performance with common graph neural network baselines. I also show …
-
Graph similarity and matching
… application of our similarity measure to graph matching. We attempt to correctly position a subgraph GB within a graph GA using a maximum weight matching algorithm applied to the similarity scores between GA and GB. Significant performance improvements are observed when the topological …
-
Outlier detection for information networks
… The major challenge lies in performing cluster matching across snapshots so as to obtain temporal patterns. Another challenge is to define the outlier score once the patterns have been discovered. We propose algorithms and demonstrate the effectiveness of our algorithms in finding such outliers …
-
Algoritmi avanzati per il Subgraph Isomorphism, Motif Discovery, e Graph Embedding su reti complesse
… al problema dell'isomorfismo di sottografi, al matching in multigrafi, alla scoperta di motivi in grafi temporali e all'embedding di grafi multiplex. Presentiamo ArcMatch, un nuovo algoritmo per il matching efficiente di sottografi in grafi etichettati, che permette di ottenere informazioni …
-
Accelerating graph pattern mining algorithms on modern graphics processing units
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms