Sökning: "Clustering Algorithm"

Visar resultat 1 - 5 av 81 avhandlingar innehållade orden Clustering Algorithm.

  1. 1. Approximation and Online Algorithms with Applications in Computational Biology and Computational Geometry

    Författare :Mia Persson; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; numerisk analys; system; systems; control; Datalogi; numerical analysis; broadcasting; polygon exploration; robotics; Mathematics; Matematik; Computer science; clique partition; clustering; computational complexity; computational geometry; computational biology; online algorithm; kontroll; approximation algorithm;

    Sammanfattning : The main contributions of this thesis are in the area of approximation and online algorithm design and derivation of lower bounds on the approximability for a number of combinatorial optimization problems with applications in computational biology and computational geometry. Approximation and online algorithms are fundamental tools used to deal with computationally hard problems and problems in which the input is gradually disclosed over time. LÄS MER

  2. 2. Functional clustering methods and marital fertility modelling

    Författare :Per Arnqvist; Sara Sjöstedt de Luna; Leif Nilsson; Helle Sørensen; Umeå universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; censoring; Coale-Trussell model; EM-algorithm; functional data analysis; functional clustering; marital fertility; normal approximation; Poisson process; varved lake sediments; warping; Mathematical Statistics; matematisk statistik;

    Sammanfattning : This thesis consists of two parts.The first part considers further development of a model used for marital fertility, the Coale-Trussell's fertility model, which is based on age-specific fertility rates. A new model is suggested using individual fertility data and a waiting time after pregnancies. LÄS MER

  3. 3. Automatic sensor clustering : connectivity for the internet of things

    Författare :Victor Kardeby; Theo Kanter; Mittuniversitetet; []

    Sammanfattning : Current predictions from industry envision that within a decade, the Internet will bepopulated by tens of billion of devices. Already today, smart Internet devices havesensors that provide an enormous potential for creating new applications. LÄS MER

  4. 4. Clustering Techniques for Mining and Analysis of Evolving Data

    Författare :Vishnu Manasa Devagiri; Veselka Boeva; Niklas Lavesson; Sindri Magnússon; Blekinge Tekniska Högskola; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Clustering analysis; Concept drift; Evolutionary clustering; Machine learning; Streaming data; Computer Science; Datavetenskap;

    Sammanfattning : The amount of data generated is on rise due to increased demand for fields like IoT, smart monitoring applications, etc. Data generated through such systems have many distinct characteristics like continuous data generation, evolutionary, multi-source nature, and heterogeneity. LÄS MER

  5. 5. Consensus Algorithms for Trees and Strings

    Författare :Jesper Jansson; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; numerical analysis; computational complexity; Approximation algorithm; labeled tree; lowest common ancestor constraint; maximum agreement subtree; alignment between trees; clustering; Computer science; Hamming metric; systems; control; Datalogi; numerisk analys; system; kontroll;

    Sammanfattning : This thesis studies the computational complexity and polynomial-time approximability of a number of discrete combinatorial optimization problems involving labeled trees and strings. The problems considered have applications to computational molecular biology, pattern matching, and many other areas of computer science. LÄS MER