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 153 for “"Graph Matching"”.

  1. Graph Inference and Graph Matching

    Graphs are widely used in many fields of research, ranging from natural sciences to computer and mathematical sciences. Graph inference is an area of intense research. In this dissertation, we propose several methodologies in graph inference. We focus on statistical inference using graph …

    jhu Repository record for Graph Inference and Graph Matching (opens in a new tab)

  2. GRAPH MATCHING AND VERTEX NOMINATION

    When given a collection of graphs on over-lapping, but possibly non-identical, vertex sets, many inference tasks involve learning the across-network alignment. Often, this task is difficult due to the enormity of the graphs, as network alignment (that is, graph matching) is NP-hard in its most …

    jhu Repository record for GRAPH MATCHING AND VERTEX NOMINATION (opens in a new tab)

  3. Deep Learning for Graph Matching

    Graphs constitute fundamental mathematical structures for modelling complex relational systems, where entities are represented as nodes and their interactions as edges. The graph matching problem aims to establish correspondences between nodes across two graphs based on feature similarity and …

    anu Repository record for Deep Learning for Graph Matching (opens in a new tab)

  4. 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 …

    jhu Repository record for GRAPH MATCHING AND CORRELATION FOR GRAPHS (opens in a new tab)

  5. Fairness and Uncertainty in Graph Matching

    Graph matching is a fundamental computational problem with a broad range of applications across different domains, including resource allocation, e-commerce, kidney exchange, ad placement, and ride-sharing. While the classical maximum matching problem is well-understood, many real-world …

    maryland Repository record for Fairness and Uncertainty in Graph Matching (opens in a new tab)

  6. Parallel algorithms for labeled graph matching

    Includes bibliographical references (pages 114-122).

    colo-mines Repository record for Parallel algorithms for labeled graph matching (opens in a new tab)

  7. Graph matching by graph neural network

    Graph matching or network alignment refers to the problem of matching two correlated graphs. This thesis presents a deep Q learning based method, which represents the matching process by a graph neural network. By breaking the symmetry, the parameterized graph neural network is able to capture a …

    uiuc Repository record for Graph matching by graph neural network (opens in a new tab)

  8. The Graph Matching and Quadratic Assignment Problems

    The graph matching problem seeks to find an alignment between the nodes of two graphs that minimizes the number of edge disagreements. We present a modification to the state-of-the-art graph matching approximation algorithm "FAQ" (Vogelstein, 2015), replacing it's linear sum assignment step with …

    jhu Repository record for The Graph Matching and Quadratic Assignment Problems (opens in a new tab)

  9. Graph matching with applications to network analysis

    The graph matching (GM) problem seeks to find an alignment between the vertex sets of two graphs and has applications in social network analysis, bioinformatics, and pattern recognition. In this dissertation, we propose to (a) develop the iGraphMatch R package for common GM algorithms and steps for …

    bu Repository record for Graph matching with applications to network analysis (opens in a new tab)

  10. Protein-Function Prediction Using a Graph-Matching Algorithm

    … the functional site of protein using a graph-based approach. Each protein structure is represented as a graph. Each protein residue represents a vertex, and the relationship between residues represents the edges of the graph. The tool compares proteins to identify the functional site in …

    ndsu Repository record for Protein-Function Prediction Using a Graph-Matching Algorithm (opens in a new tab)

  11. A Separator-Based Framework for Graph Matching Problems

    Given a graph, a matching is a set of vertex-disjoint edges. Graph matchings have been well studied, since they play a fundamental role in algorithmic theory as well as motivate many practical applications. Of particular interest is the problem of finding a maximum cardinality matching of a graph. …

    vt Repository record for A Separator-Based Framework for Graph Matching Problems (opens in a new tab)

  12. A Data-driven Approach to Large Knowledge Graph Matching

    … decade, a remarkable number of open Knowledge Graphs (KGs) were developed, such as DBpedia, NELL, and YAGO. While some of such KGs are curated via crowdsourcing platforms, others are semi-automatically constructed. This has resulted in a significant degree of semantic heterogeneity and …

    whiterose Download PDF for A Data-driven Approach to Large Knowledge Graph Matching (opens in a new tab)

  13. Extending Theories of the Graph Matching Problem and Its Variants

    Graphs serve as powerful tools for modeling complex real-world relationships, making reliable statistical inference on graphs a crucial task. A fundamental problem in this domain is the graph matching problem, which seeks to align node labels across graphs while minimizing structural and feature …

    maryland Repository record for Extending Theories of the Graph Matching Problem and Its Variants (opens in a new tab)

  14. Distance based canonical labeling algorithms with applications to graph matching

    Graphs are mathematical structures that encode pairwise relationships between objects, which are usually identified with labels. However, graphs can represent relationships between any kind of objects and a fundamental problem is to determine if two graphs are equivalent from a structural point of …

    brazil-uerj Repository record for Distance based canonical labeling algorithms with applications to graph matching (opens in a new tab)

  15. Understanding the importance of side information in graph matching problem

    Graph matching algorithms rely on the availability of seed vertex pairs as side information to deanonymize users across networks. Although such algorithms work well in practice, there are other types of side information available which are potentially useful to an attacker. In this thesis, we …

    uiuc Repository record for Understanding the importance of side information in graph matching problem (opens in a new tab)

  16. Improving the output of algorithms for large-scale approximate graph matching

    In approximate graph matching, the goal is to find the best correspondence between the labels of two correlated graphs. Recently, the problem has been applied to social network de-anonymization, and several efficient algorithms have been proposed for approximate graph matching in that domain. These …

    uiuc Repository record for Improving the output of algorithms for large-scale approximate graph matching (opens in a new tab)

  17. Joint Optimization of Fidelity and Commensurability for Manifold Alignment and Graph Matching

    In this thesis, we investigate how to perform inference in settings in which the data consist of different modalities or views. For effective learning utilizing the information available, data fusion that considers all views of these multiview data settings is needed. We also require dimensionality …

    jhu Repository record for Joint Optimization of Fidelity and Commensurability for Manifold Alignment and Graph Matching (opens in a new tab)

  18. Analysis of Current Flows in Electrical Networks for Error-Tolerant Graph Matching

    … one thing in common: they can be represented as graphs. The need to analyze, compare, and classify graph datasets has become more evident over the last decade. The graph isomorphism problem is known to belong to the NP class, and the subgraph isomorphism problem is known to be an NP-complete …

    usf Repository record for Analysis of Current Flows in Electrical Networks for Error-Tolerant Graph Matching (opens in a new tab)

  19. Improving the Unification of Software Clones using Tree and Graph Matching Algorithms

    Code duplication is common in all kind of software systems and is one of the most troublesome hurdles in software maintenance and evolution activities. Even though these code clones are created for the reuse of some functionality, they usually go through several modifications after their initial …

    concordia Download PDF for Improving the Unification of Software Clones using Tree and Graph Matching Algorithms (opens in a new tab)

Page 1 of 8