Improved Detection of Mycobacterium bovis in Bovine Tissues Using Immunomagnetic Separation Approaches

Immunomagnetic separation (IMS) represents a simple but effective method of selectively capturing and concentrating Mycobacterium bovis, the causative agent of bovine tuberculosis (bTB), from tissue samples. It is a physical cell separation technique that does not impact cell viability, unlike traditional chemical decontamination prior to culture. IMS is performed with paramagnetic beads coated with M. bovis-specific antibody and peptide binders. Once captured by IMS, M. bovis cells can be detected by either PCR or cultural detection methods. Increased detection rates of M. bovis, particularly from non-visibly lesioned lymph node tissues from bTB reactor animals, have recently been reported when IMS-based methods were employed.

Min-BDeu and Max-BDeu Scores for Learning Bayesian Networks

This work presents two new score functions based on the Bayesian Dirichlet equivalent uniform (BDeu) score for learning Bayesian network structures. They consider the sensitivity of BDeu to varying parameters of the Dirichlet prior. The scores take on the most adversary and the most beneficial priors among those within a contamination set around the symmetric one. We build these scores in such way that they are decomposable and can be computed efficiently. Because of that, they can be integrated into any state-of-the-art structure learning method that explores the space of directed acyclic graphs and allows decomposable scores. Empirical results suggest that our scores outperform the standard BDeu score in terms of the likelihood of unseen data and in terms of edge discovery with respect to the true network, at least when the training sample size is small. We discuss the relation between these new scores and the accuracy of inferred models. Moreover, our new criteria can be used to identify the amount of data after which learning is saturated, that is, additional data are of little help to improve the resulting model.

Extended Tree Augmented Naive Classifier

This work proposes an extended version of the well-known tree-augmented naive Bayes (TAN) classifier where the structure learning step is performed without requiring features to be connected to the class. Based on a modification of Edmonds’ algorithm, our structure learning procedure explores a superset of the structures that are considered by TAN, yet achieves global optimality of the learning score function in a very efficient way (quadratic in the number of features, the same complexity as learning TANs). A range of experiments show that we obtain models with better accuracy than TAN and comparable to the accuracy of the state-of-the-art classifier averaged one-dependence estimator.

STC-1 Cells

Gastrointestinal hormones such as cholecystokinin (CCK), glucagon like peptide 1 (GLP-1), and peptide YY (PYY) play an important role in suppressing hunger and controlling food intake. These satiety hormones are secreted from enteroendocrine cells present throughout the intestinal tract. The intestinal secretin tumor cell line (STC-1) possesses many features of native intestinal enteroendocrine cells. As such, STC-1 cells are routinely used in screening platforms to identify foods or compounds that modulate secretion of gastrointestinal hormones in vitro. This chapter describes this intestinal cell model focussing on it’s applications, advantages and limitations. A general protocol is provided for challenging STC-1 cells with test compounds.

Approximating Credal Network Inferences by Linear Programming

An algorithm for approximate credal network updating is presented. The problem in its general formulation is a multilinear optimization task, which can be linearized by an appropriate rule for fixing all the local models apart from those of a single variable. This simple idea can be iterated and quickly leads to very accurate inferences. The approach can also be specialized to classification with credal networks based on the maximality criterion. A complexity analysis for both the problem and the algorithm is reported together with numerical experiments, which confirm the good performance of the method. While the inner approximation produced by the algorithm gives rise to a classifier which might return a subset of the optimal class set, preliminary empirical results suggest that the accuracy of the optimal class set is seldom affected by the approximate probabilities