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 28 for “"Graph kernel"”.

  1. Protein Functional Site Prediction Using the Shortest-Path Graph Kernel Method

    … methods play key roles to minimize this gap. Graphs are often used to describe and analyze the geometry and physicochemical composition of bimolecular structures such as, chemical compounds and protein functional sites. In this study, we developed an innovative graph method to represent …

    ndsu Repository record for Protein Functional Site Prediction Using the Shortest-Path Graph Kernel Method (opens in a new tab)

  2. Graph kernel extensions and experiments with application to molecule classification, lead hopping and multiple targets

    … drugs. In particular, modern structured kernel methods have been successfully applied to range of problem domains and have been recently adapted for graph structures making them directly applicable to pharmaceutical drug discovery. Specifically graph structures have a natural fit with …

    soton Download PDF for Graph kernel extensions and experiments with application to molecule classification, lead hopping and multiple targets (opens in a new tab)

  3. G-hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases

    Structured data such as graphs and networks have posed significant challenges to fundamental aspects of data management including efficient storage, indexing, and similarity search. With the fast accumulation of graph databases, similarity search in graph databases has emerged as an important …

    ku Repository record for G-hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases (opens in a new tab)

  4. Machine learning on graphs: algorithms and applications

    Graphs are well-studied structures which are utilized to model entities and their relationships. In recent years, graph-based representations have become ubiquitous in many application domains. For instance, in chemoinformatics graphs are used to capture the structure of molecules, while in natural …

    greece Repository record for Machine learning on graphs: algorithms and applications (opens in a new tab)

  5. Theory of graph traversal edit distance, extensions, and applications

    … problems in applied machine learning deal with graphs (also called networks), including social networks, security, web data mining, protein function prediction, and genome informatics. The kernel paradigm beautifully decouples the learning algorithm from the underlying geometric space, which …

    colostate Repository record for Theory of graph traversal edit distance, extensions, and applications (opens in a new tab)

  6. Three Essays on Approximate Bayesian Computation and Network Models

    … novel approach is proposed, connecting Gaussian Graphical Models (GGM) with the Graphical Lasso (glaasso), to understand and address the complex relationships between summary statistics and parameters. By fostering a sparse structure, our method confronts the curse of dimensionality, yielding …

    unsw Repository record for Three Essays on Approximate Bayesian Computation and Network Models (opens in a new tab)

  7. Towards Learning Powerful Deep Graph Neural Networks and Embeddings

    … 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 domains such as bioinformatics, chemoinformatics, social networks and recommendation systems. To date, graph remains the most …

    umn Repository record for Towards Learning Powerful Deep Graph Neural Networks and Embeddings (opens in a new tab)

  8. Information overload in structured data

    … in two separate structured domains, namely, graphs and text. Graph kernels have been proposed as an efficient and theoretically sound approach to compute graph similarity. They decompose graphs into certain sub-structures, such as subtrees, or subgraphs. However, existing graph kernels suffer …

    purdue-thes Repository record for Information overload in structured data (opens in a new tab)

  9. Graph Kernels and Applications in Bioinformatics

    … represented by discrete structures such as graphs, networks, trees, or sequences. For example, a protein can be seen as a cloud of interconnected atoms lying on a 3-dimensional space. The focus of this dissertation is on the development and application of machine learning techniques to …

    utahstate Repository record for Graph Kernels and Applications in Bioinformatics (opens in a new tab)

  10. Information Theoretic Graph Kernels

    … structural learning methods for (hyper)graph classification or clustering, particularly focusing on developing novel information theoretic kernels for graphs. To this end, we commence in Chapter 3 by defining a family of Jensen-Shannon diffusion kernels, i.e., the information theoretic …

    whiterose Download PDF for Information Theoretic Graph Kernels (opens in a new tab)

  11. Edge-based Operators for Graph Characterization

    … in computer vision and pattern recognition using graphs. The particular focus is on graph matching and characterization using edge-based operators. The thesis commences with a brief introduction in Chapter 1, followed by a review of the relevant literature in Chapter 2. The remainder of the thesis …

    whiterose Download PDF for Edge-based Operators for Graph Characterization (opens in a new tab)

  12. Analysis of high-throughput sequencing data related to small non-coding RNAs biogenesis and function

    … genome. BlockClust encodes these patterns into graphs and uses a graph kernel for clustering and classification. With quasi-linear time complexity of the graph kernel, BlockClust gained a 60-fold speedup, while improving the clustering and classification performance compared to other approaches. …

    freiburg-diss Repository record for Analysis of high-throughput sequencing data related to small non-coding RNAs biogenesis and function (opens in a new tab)

  13. Analysis of high-throughput sequencing data related to small non-coding RNAs biogenesis and function

    … genome. BlockClust encodes these patterns into graphs and uses a graph kernel for clustering and classification. With quasi-linear time complexity of the graph kernel, BlockClust gained a 60-fold speedup, while improving the clustering and classification performance compared to other approaches. …

    freiburg-diss Repository record for Analysis of high-throughput sequencing data related to small non-coding RNAs biogenesis and function (opens in a new tab)

  14. Towards Robust and Symbiotic Loop Closure Detection for Monocular SLAM

    … algorithms. Secondly, we present SymbioLCD2, a graph-based LCD framework designed to symbiotically integrate semantic objects and visual features into a unified graph structure, resulting in enhanced scene awareness across both semantic and spatial dimensions. It employs a multi-tiered graph …

    auckland-ms Repository record for Towards Robust and Symbiotic Loop Closure Detection for Monocular SLAM (opens in a new tab)

  15. Bayesian optimisation for automated machine learning

    … of BO on continuous space, and uses a tailored kernel to permit information sharing across different categorical variables. We also extend CoCaBO by harnessing the concept of local trust region to achieve competitive performance on high-dimensional optimisation problems with mixed input …

    oxford Repository record for Bayesian optimisation for automated machine learning (opens in a new tab)

  16. Recognition of functional relationships between biomedical concepts in the scientific literature using text mining and machine learning

    … learning approaches named shallow linguistic kernel (SL), all-paths graph kernel (APG), and BioBERT were evaluated to classify these relationships between small molecules and proteins. Furthermore, the benefit of the presence of interaction verbs in sentences which include the functional …

    freiburg-diss Repository record for Recognition of functional relationships between biomedical concepts in the scientific literature using text mining and machine learning (opens in a new tab)

  17. Testing scientific software: techniques for automatic detection of metamorphic relations

    … relations. We also found that using walk-based graph kernels for feature extraction from graph-based program representations further improves the prediction accuracy. In addition, incorporating mathematical properties of operations in the graph kernel computation improves the prediction …

    colostate Repository record for Testing scientific software: techniques for automatic detection of metamorphic relations (opens in a new tab)

  18. Using local RNA secondary structures for computational comparison and clustering of RNA molecules

    … the last part of this thesis, I present GraphClust, an efficient structure-based RNA clustering method for large RNA datasets. The core of the clustering procedure runs in linear time and, thus, eliminates the runtime bottleneck of previous approaches. The very high quality of the found …

    freiburg-diss Repository record for Using local RNA secondary structures for computational comparison and clustering of RNA molecules (opens in a new tab)

  19. Understanding RNA

    … forward in understanding biological systems. Graphs are a type of structured data, and graph-based methods have shown promise for other biological compounds such as protein. RNAs can be represented in graph-structured form, and then RNA graph data can be used in learning applications. In this …

    whiterose Download PDF for Understanding RNA (opens in a new tab)

  20. Efficient, Scalable, and Accurate Program Fingerprinting in Binary Code

    … of binary code known as the semantic integrated graph. This graph enhances the control flow graph, the register flow graph, and the function call graph, key concepts from classical program analysis, and merges them with other structural information to create a joint data structure. Second, we …

    concordia Download PDF for Efficient, Scalable, and Accurate Program Fingerprinting in Binary Code (opens in a new tab)

Page 1 of 2