908 resultados para graphical factor models
Resumo:
PURPOSE: Hreceptor (VEGFR) and FGF receptor (FGFR) signaling pathways. EXPERIMENTAL DESIGN: Six different s.c. patient-derived HCC xenografts were implanted into mice. Tumor growth was evaluated in mice treated with brivanib compared with control. The effects of brivanib on apoptosis and cell proliferation were evaluated by immunohistochemistry. The SK-HEP1 and HepG2 cells were used to investigate the effects of brivanib on the VEGFR-2 and FGFR-1 signaling pathways in vitro. Western blotting was used to determine changes in proteins in these xenografts and cell lines. RESULTS: Brivanib significantly suppressed tumor growth in five of six xenograft lines. Furthermore, brivanib-induced growth inhibition was associated with a decrease in phosphorylated VEGFR-2 at Tyr(1054/1059), increased apoptosis, reduced microvessel density, inhibition of cell proliferation, and down-regulation of cell cycle regulators. The levels of FGFR-1 and FGFR-2 expression in these xenograft lines were positively correlated with its sensitivity to brivanib-induced growth inhibition. In VEGF-stimulated and basic FGF stimulated SK-HEP1 cells, brivanib significantly inhibited VEGFR-2, FGFR-1, extracellular signal-regulated kinase 1/2, and Akt phosphorylation. CONCLUSION: This study provides a strong rationale for clinical investigation of brivanib in patients with HCC.
Resumo:
Modeling of cultivar x trial effects for multienvironment trials (METs) within a mixed model framework is now common practice in many plant breeding programs. The factor analytic (FA) model is a parsimonious form used to approximate the fully unstructured form of the genetic variance-covariance matrix in the model for MET data. In this study, we demonstrate that the FA model is generally the model of best fit across a range of data sets taken from early generation trials in a breeding program. In addition, we demonstrate the superiority of the FA model in achieving the most common aim of METs, namely the selection of superior genotypes. Selection is achieved using best linear unbiased predictions (BLUPs) of cultivar effects at each environment, considered either individually or as a weighted average across environments. In practice, empirical BLUPs (E-BLUPs) of cultivar effects must be used instead of BLUPs since variance parameters in the model must be estimated rather than assumed known. While the optimal properties of minimum mean squared error of prediction (MSEP) and maximum correlation between true and predicted effects possessed by BLUPs do not hold for E-BLUPs, a simulation study shows that E-BLUPs perform well in terms of MSEP.
Resumo:
Minimum Description Length (MDL) is an information-theoretic principle that can be used for model selection and other statistical inference tasks. There are various ways to use the principle in practice. One theoretically valid way is to use the normalized maximum likelihood (NML) criterion. Due to computational difficulties, this approach has not been used very often. This thesis presents efficient floating-point algorithms that make it possible to compute the NML for multinomial, Naive Bayes and Bayesian forest models. None of the presented algorithms rely on asymptotic analysis and with the first two model classes we also discuss how to compute exact rational number solutions.
Resumo:
In this paper, we employ message passing algorithms over graphical models to jointly detect and decode symbols transmitted over large multiple-input multiple-output (MIMO) channels with low density parity check (LDPC) coded bits. We adopt a factor graph based technique to integrate the detection and decoding operations. A Gaussian approximation of spatial interference is used for detection. This serves as a low complexity joint detection/decoding approach for large dimensional MIMO systems coded with LDPC codes of large block lengths. This joint processing achieves significantly better performance than the individual detection and decoding scheme.
Resumo:
Traffic classification using machine learning continues to be an active research area. The majority of work in this area uses off-the-shelf machine learning tools and treats them as black-box classifiers. This approach turns all the modelling complexity into a feature selection problem. In this paper, we build a problem-specific solution to the traffic classification problem by designing a custom probabilistic graphical model. Graphical models are a modular framework to design classifiers which incorporate domain-specific knowledge. More specifically, our solution introduces semi-supervised learning which means we learn from both labelled and unlabelled traffic flows. We show that our solution performs competitively compared to previous approaches while using less data and simpler features. Copyright © 2010 ACM.
Resumo:
158 p.