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 24 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 …
-
Optimizing graph analyses on GPUs
… In the second part, we present our GPU-based subgraph matching system, DGSM. Current subgraph matching frameworks suer from the need to maintain overly large intermediate states, which is normally far larger than a GPU's main memory . As a result, these frameworks cannot match large queries on …
-
Social Network Data Management
… We propose efficient algorithms to answer subgraph matching queries against network databases and discuss effective pruning strategies to improve performance. We show how adaptive cost models can speed up subgraph matching query answering by assigning budgets to index retrieval operations …
-
Top-K Query Processing in Edge-Labeled Graph Data
… graph on which knowledge inference is performed. Subgraph matching has been extensively used as a query language for patterns in the context of edge-labeled graphs. For example, in social networks, users can specify a subgraph matching query to find all people that have certain neighborhood …
-
Efficient algorithms and system implementations for graph pattern matching
… and evolve over time, efficient algorithms for subgraph querying become critical. This thesis addresses three core problems in graph querying: subgraph isomorphism, frequent subgraph mining (FSM), and continuous subgraph matching, each of which is NP-complete and poses significant computational …
-
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. …
-
Accelerating Machine Learning via Multi-Objective Optimization
… and neural network training. Specifically, subgraph matching is proposed to bound the search problem and provide heuristics that guide the solver toward the optimal solution. Mixed precision operations is also proposed for solving systems of linear equations and for training neural networks …
-
Improving the performance and scalability of patten subgraph queries
… problem that often arises to graphs is the subgraph pattern matching querying problem, where given a graph DB and a query in the form of a graph, the graphs from the DB that contain the query are returned. In some algorithms, all possible occurrences of the query graph in the DB graphs are …
-
Declarative Cleaning, Analysis, and Querying of Graph-structured Data
… reduction' methods to efficiently enable subgraph matching queries over large uncertain graphs of this type.
-
Direct Solutions to Perceptual Organization Problems
… segmentation, clustering, grouping, subgraph matching, and digital matting. The objective of an optimization algorithm can be related to the state of a physical system, where the goal is to bring the initial arbitrary state of the system to a state with minimum possible energy. By …
-
Efficient Virtual Network Embedding onto A Hierarchical-Based Substrate Network Framework
… scheme divides the VN request into smaller subgraphs, and individually maps them on the SN using a variation of the exact subgraph matching techniques. Second, the physical resources pricing policy is introduced that is based on time-ofuse, that reflects the effect of resource congestion …
-
GRAPH MATCHING AND CORRELATION FOR GRAPHS
The graph matching problem is, given two graphs, to find the bijection between the vertex sets that best preserves the adjacency structure. It has been applied in many areas such as pattern recognition, object detection, and neuroscience, to name a few. Our first group of contributions: We modify …
-
Scalable Subgraph Mining in a Big Graph
Finding from a big graph those subgraphs that satisfy certain conditions is useful in many applications such as community detection and subgraph matching. These problems have a high time complexity, but existing systems to scale them are all IO-bound in execution. We propose the first truly …
-
Detection and Analysis of Long-Term Threats using Large Dynamic Uncertain Graph Models
… scheme that employs an isomorphic subgraph matching algorithm to search for graphical attack patterns in the graph. An anomaly detection mechanism that involves calculating anomaly scores based on the bits of meta-rarity metric for statistical features and underlying distributions …
-
Enforcing Temporal and Ontological Dependencies Over Graphs
… algorithm to mine keys over graphs via frequent subgraph expansion. However, existing key constraints identify entities by enforcing label equality on node types. These constraints can be too restrictive to characterize structures and node labels that are syntactically different but semantically …
-
Efficient and Scalable Graph Pattern Matching on Massive Graphs
… study the fundamental problem of graph pattern matching in graph analytics on massive graphs. It is also known as subgraph matching or subgraph enumeration. Specifically, given a query graph q and a data graph G, graph pattern matching is defined as finding all subgraph instances of G that are …
-
Exploratory search through large video corpora
… take place over long spans of space and time. Subgraph and graph matching methods have seen limited use in exploratory search because both problems are provably NP-hard. In this work, we render these problems computationally tractable by identifying the maximally discriminative spanning tree …
-
Systems and Algorithms for Dynamic Graph Processing
… to evaluate one-time versions of recursive or subgraph queries over static graphs – graphs that do not change or a single snapshot of a changing graph. They generally do not support incrementally maintaining queries as graphs change. However, most applications that employ graphs are dynamic in …
-
Multiple Continuous Subgraph Query Optimization Using Delta Subgraph Queries
… and evaluating multiple directed structural subgraph queries, i.e., those without highly selective predicates on the edges or vertices, continuously in a changing graph. Existing techniques focus on queries with highly selective predicates or are designed for evaluating a single query. As …
Page 1 of 2