Sökning: "Graph Networks"

Visar resultat 1 - 5 av 104 avhandlingar innehållade orden Graph Networks.

  1. 1. Form and function of complex networks

    Författare :Petter Holme; Beom Jun Kim; Mark Newman; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Theoretical physics; complex networks; complexity; small-world networks; scale-free networks; graph theory; Teoretisk fysik; Physics; Fysik; teoretisk fysik; Theoretical Physics;

    Sammanfattning : Networks are all around us, all the time. From the biochemistry of our cells to the web of friendships across the planet. From the circuitry of modern electronics to chains of historical events. A network is the result of the forces that shaped it. 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. Human Interactions on Online Social Media : Collecting and Analyzing Social Interaction Networks

    Författare :Fredrik Erlandsson; Johnson Henric; Martin Boldt; Piotr Bródka; S. Felix Wu; Sune Lehmann; Blekinge Tekniska Högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Social Media; Social Networks; Crawling; Complex Networks; Information Cascade; Seed Selection; Privacy;

    Sammanfattning : Online social media, such as Facebook, Twitter, and LinkedIn, provides users with services that enable them to interact both globally and instantly. The nature of social media interactions follows a constantly growing pattern that requires selection mechanisms to find and analyze interesting data. LÄS MER

  5. 4. Gated Bayesian Networks

    Författare :Marcus Bendtsen; Jose M. Peña; Nahid Shahmehri; Helge Langseth; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Bayesian networks have grown to become a dominant type of model within the domain of probabilistic graphical models. Not only do they empower users with a graphical means for describing the relationships among random variables, but they also allow for (potentially) fewer parameters to estimate, and enable more efficient inference. LÄS MER

  7. 5. Algorithmic Graph Problems - From Computer Networks to Graph Embeddings

    Författare :Martin Wahlén; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Approximation Algorithms; Exact Algorithms; Time Complexity; Broadcasting;

    Sammanfattning : This dissertation is a contribution to the knowledge of the computational complexity of discrete combinatorial problems. 1. The first problem that we consider is to compute the maximum independent set of a box graph, that is, given a set of orthogonal boxes in the plane compute the largest subset such that no boxes in the subset overlap. LÄS MER