Sökning: "graph kernels"

Visar resultat 1 - 5 av 6 avhandlingar innehållade orden graph kernels.

  1. 1. Global geometric graph kernels and applications

    Författare :Fredrik Johansson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis explores the topics of graph kernels and classification of graphs. Graph kernels have received considerable attention in the last decade, in part because of their value in many practical applications, such as chemo informatics and molecular biology, in which classification using graph kernels have become the standard model for several problems. LÄS MER

  3. 2. Integrative Analysis of Dynamic Networks

    Författare :Vinay Jethava; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Lovasz theta function; dynamic networks; integrative analysis; probabilistic graphical models; support vector machines; graph kernels;

    Sammanfattning : Networks play a central role in several disciplines such as computational biology, social network analysis, transportationplanning and many others; and consequently, several methods have been developed for network analysis. However, in many cases, the study of a single network is insufficient to discover patterns with multiple facets and subtlesignals. LÄS MER

  4. 3. Degrees in Random Graphs and Tournament Limits

    Författare :Erik Thörnblad; Svante Janson; Erik Broman; Daniel Kráľ; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Random graphs; degree distributions; degree sequences; graph limits; tournaments; Mathematics; Matematik;

    Sammanfattning : This thesis consists of an introduction and six papers on the topics of degree distributions in random graphs and tournaments and their limits.The first two papers deal with a dynamic random graph, evolving in time through duplication and deletion of vertices and edges. In Paper I we study the degree densities of this model. LÄS MER

  5. 4. Bayesian structure learning in graphical models

    Författare :Felix Leopoldo Rios; Tatjana Pavlenko; Klas Markström; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Bayesian statistics; graphical models; Bayesian networks; Markov networks; structure learning; Tillämpad matematik och beräkningsmatematik; Applied and Computational Mathematics;

    Sammanfattning : This thesis consists of two papers studying structure learning in probabilistic graphical models for both undirected graphs anddirected acyclic graphs (DAGs).Paper A, presents a novel family of graph theoretical algorithms, called the junction tree expanders, that incrementally construct junction trees for decomposable graphs. LÄS MER

  7. 5. Performance Monitoring, Analysis, and Real-Time Introspection on Large-Scale Parallel Systems

    Författare :Xavier Aguilar; Erwin Professor; Karl Doctor; Jens Professor; Jesus Labarta; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; HPC; performance analysis; performance monitoring; performance introspection; parallel computing; Computer Science; Datalogi;

    Sammanfattning : High-Performance Computing (HPC) has become an important scientific driver. A wide variety of research ranging for example from drug design to climate modelling is nowadays performed in HPC systems. Furthermore, the tremendous computer power of such HPC systems allows scientists to simulate problems that were unimaginable a few years ago. LÄS MER