Sökning: "graph clustering"

Visar resultat 1 - 5 av 24 avhandlingar innehållade orden graph clustering.

  1. 1. Graph Partitioning and Planted Partitions

    Författare :Mikael Onsjö; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; planted partition; graph bisection; algorithms; graphs; graph partitioning; clustering;

    Sammanfattning : Graph partitioning is the problem of splitting a graph into two or morepartitions of fixed sizes while minimizing the number of edges that are “cut”.This is an important problem with a wide range of applications in fields suchas VLSI design, parallel processing, bioinformatics, data mining etc. LÄS MER

  3. 2. Image and Data Analysis for Spatially Resolved Transcriptomics : Decrypting fine-scale spatial heterogeneity of tissue's molecular architecture

    Författare :Gabriele Partel; Carolina Wählby; Anna H Klemm; Mats Nilsson; Roland Eils; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; iss; image; processing; clustering; deep learning; GCN; graph;

    Sammanfattning : Our understanding of the biological complexity in multicellular organisms has progressed at tremendous pace in the last century and even more in the last decades with the advent of sequencing technologies that make it possible to interrogate the genome and transcriptome of individual cells. It is now possible to even spatially profile the transcriptomic landscape of tissue architectures to study the molecular organization of tissue heterogeneity at subcellular resolution. LÄS MER

  4. 3. Community detection : Lower bounds and axiomatic classification

    Författare :Vilhelm Agdur; Fiona Skerman; Tatyana Turova; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; community detection; graph clustering; graph theory; Mathematics with specialization in Applied Mathematics; Matematik med inriktning mot tillämpad matematik;

    Sammanfattning : .... LÄS MER

  5. 4. Random geometric graphs and their applications in neuronal modelling

    Författare :Fioralba Ajazi; Matematisk statistik; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; random graph; Neural Network; Probability; Inhomogeneous random graph; random distance graph; random grown networks;

    Sammanfattning : Random graph theory is an important tool to study different problems arising from real world.In this thesis we study how to model connections between neurons (nodes) and synaptic connections (edges) in the brain using inhomogeneous random distance graph models. LÄS MER

  7. 5. Gossip-based Algorithms for Information Dissemination and Graph Clustering

    Författare :Fatemeh Rahimian; Seif Haridi; Eiko Yoneki; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Decentralized algorithms are becoming ever more prevalent in almost all real-world applications that are either data intensive, computation intensive or both. This thesis presents a few decentralized solutions for large-scale (i) data dissemination, (ii) graph partitioning, and (iii) data disambiguation. LÄS MER