Sökning: "Tatjana Pavlenko"

Visar resultat 1 - 5 av 6 avhandlingar innehållade orden Tatjana Pavlenko.

  1. 1. Discriminant analysis with growing dimension

    Författare :Tatjana Pavlenko; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; growing dimension; MATHEMATICS; MATEMATIK;

    Sammanfattning : .... LÄS MER

  2. 2. Feature Informativeness, Curse-of-Dimensionality and Error Probability in Discriminant Analysis

    Författare :Tatjana Pavlenko; Matematisk statistik; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Statistics; Matematik; Mathematics; feature selection; Discriminant analysis; feature informativeness; growing dimension assymptotics; operations research; operationsanalys; programmering; aktuariematematik; programming; actuarial mathematics; Statistik; Multivariate analysis; MATHEMATICS;

    Sammanfattning : This thesis is based on four papers on high-dimensional discriminant analysis. Throughout, the curse-of-dimensionality effect on the precision of the discrimination performance is emphasized. A growing dimension asymptotic approach is used for assessing this effect and the limiting error probability are taken as the performance criteria. LÄS MER

  3. 3. Applications of common principal components in multivariate and high-dimensional analysis

    Författare :Toni Duras; Thomas Holgersson; Tatjana Pavlenko; Jönköping University; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis consists of four papers, all exploring some aspect of common principal component analysis (CPCA), the generalization of PCA to multiple groups. The basic assumption of the CPC model is that the space spanned by the eigenvectors is identical across several groups, whereas eigenvalues associated with the eigenvectors can vary. 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. 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