Log in

Relevant bibliographies by topics / Chain graph models / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Chain graph models.

Dissertations / Theses on the topic 'Chain graph models'

Author: Grafiati

Published: 9 March 2023

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 24 dissertations / theses for your research on the topic 'Chain graph models.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Drton, Mathias. "Maximum likelihood estimation in Gaussian AMP chain graph models and Gaussian ancestral graph models /." Thesis, Connect to this title online; UW restricted, 2004. http://hdl.handle.net/1773/8952.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Levitz, Michael. "Separation, completeness, and Markov properties for AMP chain graph models /." Thesis, Connect to this title online; UW restricted, 2000. http://hdl.handle.net/1773/9564.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gastaldello, Mattia. "Enumeration Algorithms and Graph Theoretical Models to Address Biological Problems Related To Symbiosis." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSE1019/document.

Full text

Abstract:

Dans cette thèse, nous abordons deux problèmes de théorie des graphes liés à deux problèmes biologiques de symbiose (deux organismes vivent en symbiose s'ils ont une interaction étroite et à long terme). Le premier problème est lié au phénomène de l'Incompatibilité cytoplasmique (IC) induit par certaines bactéries parasites chez leurs hôtes. L'IC se traduit par l'impossibilité de donner naissance à une progéniture saine lorsqu'un mÃ¢le infecté s'accouple avec une femelle non infectée. En termes de graphe ce problème peut s'interpréter comme la recherche d'une couverture minimum par des "sous-g

APA, Harvard, Vancouver, ISO, and other styles

4

NICOLUSSI, FEDERICA. "Marginal parametrizations for conditional independence models and graphical models for categorical data." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2013. http://hdl.handle.net/10281/43679.

Full text

Abstract:

The graphical models (GM) for categorical data are models useful to representing conditional independencies through graphs. The parametric marginal models for categorical data have useful properties for the asymptotic theory. This work is focused on nding which GMs can be represented by marginal parametrizations. Following theorem 1 of Bergsma, Rudas and Németh [9], we have proposed a method to identify when a GM is parametrizable according to a marginal model. We have applied this method to the four types of GMs for chain graphs, summarized by Drton [22]. In particular, with regard to

APA, Harvard, Vancouver, ISO, and other styles

5

Sonntag, Dag. "Chain Graphs : Interpretations, Expressiveness and Learning Algorithms." Doctoral thesis, Linköpings universitet, Databas och informationsteknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-125921.

Full text

Abstract:

Probabilistic graphical models are currently one of the most commonly used architectures for modelling and reasoning with uncertainty. The most widely used subclass of these models is directed acyclic graphs, also known as Bayesian networks, which are used in a wide range of applications both in research and industry. Directed acyclic graphs do, however, have a major limitation, which is that only asymmetric relationships, namely cause and effect relationships, can be modelled between their variables. A class of probabilistic graphical models that tries to address this shortcoming is chain gra

APA, Harvard, Vancouver, ISO, and other styles

6

Di, Natale Anna. "Stochastic models and graph theory for Zipf's law." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/17065/.

Full text

Abstract:

In questo elaborato ci siamo occupati della legge di Zipf sia da un punto di vista applicativo che teorico. Tale legge empirica afferma che il rango in frequenza (RF) delle parole di un testo seguono una legge a potenza con esponente -1. Per quanto riguarda l'approccio teorico abbiamo trattato due classi di modelli in grado di ricreare leggi a potenza nella loro distribuzione di probabilità. In particolare, abbiamo considerato delle generalizzazioni delle urne di Polya e i processi SSR (Sample Space Reducing). Di questi ultimi abbiamo dato una formalizzazione in termini di catene di Markov. I

APA, Harvard, Vancouver, ISO, and other styles

7

Moghadasin, Babak. "An Approach on Learning Multivariate Regression Chain Graphs from Data." Thesis, Linköpings universitet, Databas och informationsteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-94019.

Full text

Abstract:

The necessity of modeling is vital for the purpose of reasoning and diagnosing in complex systems, since the human mind might sometimes have a limited capacity and an inability to be objective. The chain graph (CG) class is a powerful and robust tool for modeling real-world applications. It is a type of probabilistic graphical models (PGM) and has multiple interpretations. Each of these interpretations has a distinct Markov property. This thesis deals with the multivariate regression chain graph (MVR-CG) interpretation. The main goal of this thesis is to implement and evaluate the results of t

APA, Harvard, Vancouver, ISO, and other styles

8

PENNONI, FULVIA. "Metodi statistici multivariati applicati all'analisi del comportamento dei titolari di carta di credito di tipo revolving." Bachelor's thesis, Universita' degli studi di Perugia, 2000. http://hdl.handle.net/10281/50024.

Full text

Abstract:

Il presente lavoro di tesi illustra un'applicazione dei modelli grafici per il l’analisi del credit scoring comportamentale o behavioural scoring. Quest'ultimo e' definito come: ‘the systems and models that allow lenders to make better decisions in managing existing clients by forcasting their future performance’, secondo Thomas (1999). La classe di modelli grafici presa in considerazione e’ quella dei modelli garfici a catena. Sono dei modelli statistici multivariati che consetono di modellizzare in modo appropriato le relazioni tra le variabili che descrivono il comporatemento dei ti

APA, Harvard, Vancouver, ISO, and other styles

9

Weng, Huibin. "A Social Interaction Model with Endogenous Network Formation." University of Cincinnati / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin159317152899108.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Wang, Yan-Jiang, and yanjiang_wang@tmmu edu cn. "Clearance of amyloid-beta in Alzheimer's disease: To understand the pathogenesis and develop potential therapies in animal models." Flinders University. School of Medicine, 2010. http://catalogue.flinders.edu.au./local/adt/public/adt-SFU20100419.124325.

Full text

Abstract:

Alzheimer's disease (AD) is the most common cause of dementia. No strong disease-modifying treatments are currently available. Amyloid-beta peptide (Abeta) appears to play a pivotal role in the pathogenesis of AD. We focused our interest on revealing the pathogenesis of the disease and developing novel therapeutic modalities. The thesis consists of three projects: 1. Prevention of AD by intramuscular delivery of an anti-Abeta single chain antibody (scFv) gene: Immunotherapy is effective in removing brain Abetazbut was associated with detrimental effects. In the present study, the gene of an

APA, Harvard, Vancouver, ISO, and other styles

11

Sadeghi, Kayvan. "Graphical representation of independence structures." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:86ff6155-a6b9-48f9-9dac-1ab791748072.

Full text

Abstract:

In this thesis we describe subclasses of a class of graphs with three types of edges, called loopless mixed graphs (LMGs). The class of LMGs contains almost all known classes of graphs used in the literature of graphical Markov models. We focus in particular on the subclass of ribbonless graphs (RGs), which as special cases include undirected graphs, bidirected graphs, and directed acyclic graphs, as well as ancestral graphs and summary graphs. We define a unifying interpretation of independence structure for LMGs and pairwise and global Markov properties for RGs, discuss their maximality, and

APA, Harvard, Vancouver, ISO, and other styles

12

Kreacic, Eleonora. "Some problems related to the Karp-Sipser algorithm on random graphs." Thesis, University of Oxford, 2017. http://ora.ox.ac.uk/objects/uuid:3b2eb52a-98f5-4af8-9614-e4909b8b9ffa.

Full text

Abstract:

We study certain questions related to the performance of the Karp-Sipser algorithm on the sparse Erdös-Rényi random graph. The Karp-Sipser algorithm, introduced by Karp and Sipser [34] is a greedy algorithm which aims to obtain a near-maximum matching on a given graph. The algorithm evolves through a sequence of steps. In each step, it picks an edge according to a certain rule, adds it to the matching and removes it from the remaining graph. The algorithm stops when the remining graph is empty. In [34], the performance of the Karp-Sipser algorithm on the Erdös-Rényi random graphs G(n,M = [

APA, Harvard, Vancouver, ISO, and other styles

13

Pace, Bruno. "O modelo de Axelrod com tensão superficial." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/43/43134/tde-26042012-123155/.

Full text

Abstract:

Nesta dissertação foram estudados alguns modelos vetoriais que pretendem modelar e descrever alguns aspectos de sistemas sociais e de sua organização cultural. Partimos do modelo de Axelrod, um processo estocástico definido em uma rede, e introduzimos uma pequena alteração no modelo que desencadeou mudanças qualitativas interessantes, especialmente o surgimento de uma tensão superficial, que leva ao aparecimento de estados metaestáveis e de regiões culturais mais fixamente localizadas no espaço. Através da ótica da mecânica estatística e de extensas simulações computacionais, exploramos alguns

APA, Harvard, Vancouver, ISO, and other styles

14

Curtis, Andrew B. "Path Planning for Unmanned Air and Ground Vehicles in Urban Environments." Diss., CLICK HERE for online access, 2008. http://contentdm.lib.byu.edu/ETD/image/etd2270.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

CARLI, FEDERICO. "Stratified Staged Trees: Modelling, Software and Applications." Doctoral thesis, Università degli studi di Genova, 2021. http://hdl.handle.net/11567/1057653.

Full text

Abstract:

The thesis is focused on Probabilistic Graphical Models (PGMs), which are a rich framework for encoding probability distributions over complex domains. In particular, joint multivariate distributions over large numbers of random variables that interact with each other can be investigated through PGMs and conditional independence statements can be succinctly represented with graphical representations. These representations sit at the intersection of statistics and computer science, relying on concepts mainly from probability theory, graph algorithms and machine learning. They are applied in a w

APA, Harvard, Vancouver, ISO, and other styles

16

Herman, Joseph L. "Multiple sequence analysis in the presence of alignment uncertainty." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:88a56d9f-a96e-48e3-b8dc-a73f3efc8472.

Full text

Abstract:

Sequence alignment is one of the most intensely studied problems in bioinformatics, and is an important step in a wide range of analyses. An issue that has gained much attention in recent years is the fact that downstream analyses are often highly sensitive to the specific choice of alignment. One way to address this is to jointly sample alignments along with other parameters of interest. In order to extend the range of applicability of this approach, the first chapter of this thesis introduces a probabilistic evolutionary model for protein structures on a phylogenetic tree; since protein stru

APA, Harvard, Vancouver, ISO, and other styles

17

Mercier, Fabien. "Cinq essais dans le domaine monétaire, bancaire et financier." Thesis, Paris 2, 2014. http://www.theses.fr/2014PA020065.

Full text

Abstract:

La thèse étudie plusieurs problématiques centrales et actuelles de la finance moderne : la rationalité limitée des agents et leurs biais comportementaux vis-à-vis des valeurs nominales,le problème de la juste évaluation du prix des actions, la refonte du paysage de l'industrie post-négociation en Europe suite à l'introduction du projet de l'Euro système Target-2 Securities, ainsi que les modèles de défaut et les méthodes d’estimation des cycles de défaut pour un secteur donné. Les techniques employées sont variées: enquêtes sur données individuelles, économétrie, théorie des jeux, théorie des

APA, Harvard, Vancouver, ISO, and other styles

18

Weibel, Julien. "Graphons de probabilités, limites de graphes pondérés aléatoires et chaînes de Markov branchantes cachées." Electronic Thesis or Diss., Orléans, 2024. http://www.theses.fr/2024ORLE1031.

Full text

Abstract:

Les graphes sont des objets mathématiques qui servent à modéliser tout type de réseaux, comme les réseaux électriques, les réseaux de communications et les réseaux sociaux. Formellement un graphe est composé d'un ensemble de sommets et d'un ensemble d'arêtes reliant des paires de sommets. Les sommets représentent par exemple des individus, tandis que les arêtes représentent les interactions entre ces individus. Dans le cas d'un graphe pondéré, chaque arête possède un poids ou une décoration pouvant modéliser une distance, une intensité d'interaction, une résistance. La modélisation de réseaux

APA, Harvard, Vancouver, ISO, and other styles

19

Todeschini, Adrien. "Probabilistic and Bayesian nonparametric approaches for recommender systems and networks." Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0237/document.

Full text

Abstract:

Nous proposons deux nouvelles approches pour les systèmes de recommandation et les réseaux. Dans la première partie, nous donnons d’abord un aperçu sur les systèmes de recommandation avant de nous concentrer sur les approches de rang faible pour la complétion de matrice. En nous appuyant sur une approche probabiliste, nous proposons de nouvelles fonctions de pénalité sur les valeurs singulières de la matrice de rang faible. En exploitant une représentation de modèle de mélange de cette pénalité, nous montrons qu’un ensemble de variables latentes convenablement choisi permet de développer un al

APA, Harvard, Vancouver, ISO, and other styles

20

Rusch, Thomas, Marcus Wurzer, and Reinhold Hatzinger. "Chain Graph Models in R: Implementing the Cox-Wermuth Procedure." 2013. http://epub.wu.ac.at/3781/1/psychoco2013_(2).pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

GASTALDELLO, MATTIA. "Enumeration algorithms and graph theoretical models to address biological problems related to symbiosis." Doctoral thesis, 2018. http://hdl.handle.net/11573/1072500.

Full text

Abstract:

In this thesis, we address two graph theoretical problems connected to two different biological problems both related to symbiosis (two organisms live in symbiosis if they have a close and long term interaction). The first problem is related to the size of a minimum cover by "chain subgraphs" of a bipartite graph. A chain graph is a bipartite graph whose nodes can be ordered by neighbourhood inclusion. In biological terms, the size of a minimum cover by chain subgraphs represents the number of genetic factors involved in the phenomenon of Cytoplasmic Incompatibility (CI) induced by some pa

APA, Harvard, Vancouver, ISO, and other styles

22

Jin, Ick Hoon. "Statistical Inference for Models with Intractable Normalizing Constants." Thesis, 2011. http://hdl.handle.net/1969.1/150938.

Full text

Abstract:

In this dissertation, we have proposed two new algorithms for statistical inference for models with intractable normalizing constants: the Monte Carlo Metropolis-Hastings algorithm and the Bayesian Stochastic Approximation Monte Carlo algorithm. The MCMH algorithm is a Monte Carlo version of the Metropolis-Hastings algorithm. At each iteration, it replaces the unknown normalizing constant ratio by a Monte Carlo estimate. Although the algorithm violates the detailed balance condition, it still converges, as shown in the paper, to the desired target distribution under mild conditions. The BSAMC

APA, Harvard, Vancouver, ISO, and other styles

23

Che, Xuan. "Spatial graphical models with discrete and continuous components." Thesis, 2012. http://hdl.handle.net/1957/33644.

Full text

Abstract:

Graphical models use Markov properties to establish associations among dependent variables. To estimate spatial correlation and other parameters in graphical models, the conditional independences and joint probability distribution of the graph need to be specified. We can rely on Gaussian multivariate models to derive the joint distribution when all the nodes of the graph are assumed to be normally distributed. However, when some of the nodes are discrete, the Gaussian model no longer affords an appropriate joint distribution function. We develop methods specifying the joint distribution of a

APA, Harvard, Vancouver, ISO, and other styles

24

Al-Mohannadi, Hamad, Qublai K. A. Mirza, Anitta P. Namanya, Irfan U. Awan, Andrea J. Cullen, and Disso Jules F. Pagna. "Cyber-Attack Modeling Analysis Techniques: An Overview." 2016. http://hdl.handle.net/10454/10703.

Full text

Abstract:

Yes<br>Cyber attack is a sensitive issue in the world of Internet security. Governments and business organisations around the world are providing enormous effort to secure their data. They are using various types of tools and techniques to keep the business running, while adversaries are trying to breach security and send malicious software such as botnets, viruses, trojans etc., to access valuable data. Everyday the situation is getting worse because of new types of malware emerging to attack networks. It is important to understand those attacks both before and after they happen in o

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!