Estimating the probability distributions of radioactive concrete in the building stock using Bayesian networks

The undesirable legacy of radioactive concrete (blue concrete) in post-war dwellings contributes to increased indoor radon levels and health threats to occupants. Despite continuous decontamination efforts, blue concrete still remains in the Swedish building stock due to low traceability as the consequence of lacking systematic documentation in technical descriptions and drawings and resource-demanding large-scaled radiation screening.The paper aims to explore the predictive inference potential of learning Bayesian networks for evaluating the presence probability of blue concrete. By integrating blue concrete records from indoor radon measurements, pre-demolition audit inventories, and building registers, it is possible to estimate buildings with high probabilities of containing blue concrete and encode the dependent relationships between variables. The findings show that blue concrete is estimated to be present in more than 30% of existing buildings, more than the current expertassumptions of 18–20%. The probability of detecting blue concrete depends on the distance to historical blue concrete manufacturing plants, building class, and construction year, but it is independent of floor area and basements. Multifamily houses and buildings built between 1960 and 1968 or nearby manufacturing plants are more likely to contain blue concrete. Despite heuristic, the data-driven approach offers an overview of the extent and the probability distribution of blue concrete-prone buildings in the regional building stock. The paper contributes to method development for pattern identification for hazardous building materials, i.e., blue concrete, and the trained models can be used for risk-based inspection planning before renovation and selective demolition

On Nonregularized Estimation of Psychological Networks.

An important goal for psychological science is developing methods to characterize relationships between variables. Customary approaches use structural equation models to connect latent factors to a number of observed measurements, or test causal hypotheses between observed variables. More recently, regularized partial correlation networks have been proposed as an alternative approach for characterizing relationships among variables through off-diagonal elements in the precision matrix. While the graphical Lasso (glasso) has emerged as the default network estimation method, it was optimized in fields outside of psychology with very different needs, such as high dimensional data where the number of variables (p) exceeds the number of observations (n). In this article, we describe the glasso method in the context of the fields where it was developed, and then we demonstrate that the advantages of regularization diminish in settings where psychological networks are often fitted ( p≪n ). We first show that improved properties of the precision matrix, such as eigenvalue estimation, and predictive accuracy with cross-validation are not always appreciable. We then introduce nonregularized methods based on multiple regression and a nonparametric bootstrap strategy, after which we characterize performance with extensive simulations. Our results demonstrate that the nonregularized methods can be used to reduce the false-positive rate, compared to glasso, and they appear to provide consistent performance across sparsity levels, sample composition (p/n), and partial correlation size. We end by reviewing recent findings in the statistics literature that suggest alternative methods often have superior performance than glasso, as well as suggesting areas for future research in psychology. The nonregularized methods have been implemented in the R package GGMnonreg

Learning a bayesian network from ordinal data

Bayesian networks are graphical models that represent the joint distributionof a set of variables using directed acyclic graphs. When the dependence structure is unknown (or partially known) the network can be learnt from data. In this paper, we propose a constraint-based method to perform Bayesian networks structural learning in presence of ordinal variables. The new procedure, called OPC, represents a variation of the PC algorithm. A nonparametric test, appropriate for ordinal variables, has been used. It will be shown that, in some situation, the OPC algorithm is a solution more efficient than the PC algorithm.Structural Learning, Monotone Association, Nonparametric Methods

A Bayesian Network Estimation of the Service-Profit Chain for Transport Service Satisfaction

Bayesian network methodology is used to model key linkages of the service-profit chain within the context of transportation service satisfaction. Bayesian networks offer some advantages for implementing managerially focused models over other statistical techniques designed primarily for evaluating theoretical models. These advantages are (1) providing a causal explanation using observable variables within a single multivariate model, (2) analysis of nonlinear relationships contained in ordinal measurements, (3) accommodation of branching patterns that occur in data collection, and (4) the ability to conduct probabilistic inference for prediction and diagnostics with an output metric that can be understood by managers and academics. Sample data from 1,101 recent transport service customers are utilized to select and validate a Bayesian network and conduct probabilistic inference