Sökning: "probabilistic classification"

Visar resultat 1 - 5 av 41 avhandlingar innehållade orden probabilistic classification.

  1. 1. On approximations and computations in probabilistic classification and in learning of graphical models

    Författare :Magnus Ekdahl; Jose Antonio Lozano; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematical statistics; factorizations; probabilistic classification; nodes; DNA strings; Mathematical statistics; Matematisk statistik;

    Sammanfattning : Model based probabilistic classification is heavily used in data mining and machine learning. For computational learning these models may need approximation steps however. LÄS MER

  2. 2. Deep learning applied to system identification : A probabilistic approach

    Författare :Carl Andersson; Thomas B. Schön; Uppsala universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Electrical Engineering with specialization in Signal Processing; Elektroteknik med inriktning mot signalbehandling;

    Sammanfattning : Machine learning has been applied to sequential data for a long time in the field of system identification. As deep learning grew under the late 00's machine learning was again applied to sequential data but from a new angle, not utilizing much of the knowledge from system identification. LÄS MER

  3. 3. Classification models for high-dimensional data with sparsity patterns

    Författare :Annika Tillander; Tatjana Pavlenko; Daniel Thorburn; Patrik Ryden; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; High-dimensionality; supervised classification; classification accuracy; sparse; block-diagonal covariance structure; graphical Lasso; separation strength; discretization; Statistics; statistik;

    Sammanfattning : Today's high-throughput data collection devices, e.g. spectrometers and gene chips, create information in abundance. However, this poses serious statistical challenges, as the number of features is usually much larger than the number of observed units. LÄS MER

  4. 4. Bayesian inference in probabilistic graphical models

    Författare :Felix Leopoldo Rios; Tatjana Pavlenko; Alun Thomas; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Graphical models; Bayesian inference; predictive classification; decomposable graphs; Tillämpad matematik och beräkningsmatematik; Applied and Computational Mathematics;

    Sammanfattning : This thesis consists of four papers studying structure learning and Bayesian inference in probabilistic graphical models for both undirected and directed acyclic graphs (DAGs).Paper A presents a novel algorithm, called the Christmas tree algorithm (CTA), that incrementally construct junction trees for decomposable graphs by adding one node at a time to the underlying graph. LÄS MER

  5. 5. Calibration of Probabilistic Predictive Models

    Författare :David Widmann; Fredrik Lindsten; Meelis Kull; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematical Statistics; Matematisk statistik;

    Sammanfattning : Predicting unknown and unobserved events is a common task in many domains. Mathematically, the uncertainties arising in such prediction tasks can be described by probabilistic predictive models. Ideally, the model estimates of these uncertainties allow us to distinguish between uncertain and trustworthy predictions. LÄS MER