A neural network-based multi-agent classifier system with a Bayesian formalism for trust measurement

In this paper, a neural network (NN)-based multi-agent classifier system (MACS) utilising the trust-negotiation-communication (TNC) reasoning model is proposed. A novel trust measurement method, based on the combination of Bayesian belief functions, is incorporated into the TNC model. The Fuzzy Min-Max (FMM) NN is used as learning agents in the MACS, and useful modifications of FMM are proposed so that it can be adopted for trust measurement. Besides, an auctioning procedure, based on the sealed bid method, is applied for the negotiation phase of the TNC model. Two benchmark data sets are used to evaluate the effectiveness of the proposed MACS. The results obtained compare favourably with those from a number of machine learning methods. The applicability of the proposed MACS to two industrial sensor data fusion and classification tasks is also demonstrated, with the implications analysed and discussed.

A new hybrid method for Bayesian network learning With dependency constraints

A Bayes net has qualitative and quantitative aspects: The qualitative aspect is its graphical structure that corresponds to correlations among the variables in the Bayes net. The quantitative aspects are the net parameters. This paper develops a hybrid criterion for learning Bayes net structures that is based on both aspects. We combine model selection criteria measuring data fit with correlation information from statistical tests: Given a sample d, search for a structure G that maximizes score(G, d), over the set of structures G that satisfy the dependencies detected in d. We rely on the statistical test only to accept conditional dependencies, not conditional independencies. We show how to adapt local search algorithms to accommodate the observed dependencies. Simulation studies with GES search and the BDeu/BIC scores provide evidence that the additional dependency information leads to Bayes nets that better fit the target model in distribution and structure.

Learning Bayesian networks in Semi-deterministic systems

In current constraint-based (Pearl-style) systems for discovering Bayesian networks, inputs with deterministic relations are prohibited. This restricts the applicability of these systems. In this paper, we formalize a sufficient condition under which Bayesian networks can be recovered even with deterministic relations. The sufficient condition leads to an improvement to Pearl’s IC algorithm; other constraint-based algorithms can be similarly improved. The new algorithm, assuming the sufficient condition proposed, is able to recover Bayesian networks with deterministic relations, and moreover suffers no loss of performance when applied to nondeterministic Bayesian networks.

Combined nonparametric prediction intervals for wind power generation

Prediction intervals (PIs) are a promising tool for quantification of uncertainties associated with point forecasts of wind power. However, construction of PIs using parametric methods is questionable, as forecast errors do not follow a standard distribution. This paper proposes a nonparametric method for construction of reliable PIs for neural network (NN) forecasts. A lower upper bound estimation (LUBE) method is adapted for construction of PIs for wind power generation. A new framework is proposed for synthesizing PIs generated using an ensemble of NN models in the LUBE method. This is done to guard against NN performance instability in generating reliable and informative PIs. A validation set is applied for short listing NNs based on the quality of PIs. Then, PIs constructed using filtered NNs are aggregated to obtain combined PIs. Performance of the proposed method is examined using data sets taken from two wind farms in Australia. Simulation results indicate that the quality of combined PIs is significantly superior to the quality of PIs constructed using NN models ranked and filtered by the validation set.

Bayesian model averaging of load demand forecasts from neural network models

Creating a set of a number of neural network (NN) models in an ensemble and accumulating them can achieve better overview capability as compared to single neural network. Neural network ensembles are designed to provide solutions to particular problems. Many researchers and academicians have adopted this NN ensemble technique, especially in machine learning, and has been applied in various fields of engineering, medicine and information technology. This paper present a robust aggregation methodology for load demand forecasting based on Bayesian Model Averaging of a set of neural network models in an ensemble. This paper estimate a vector of coefficient for individual NN models' forecasts using validation data-set. These coefficients, also known as weights, are equal to posterior probabilities of the models generating the forecasts. These BMA weights are then used in combining forecasts generated from NN models with test data-set. By comparing the Bayesian results with the Simple Averaging method, it was observed that benefits are obtained by utilizing an advanced method like BMA for forecast combinations.

Disease mapping and regression with count data in the presence of overdispersion and spatial autocorrelation: a Bayesian model averaging approach

This paper applies the generalised linear model for modelling geographical variation to esophageal cancer incidence data in the Caspian region of Iran. The data have a complex and hierarchical structure that makes them suitable for hierarchical analysis using Bayesian techniques, but with care required to deal with problems arising from counts of events observed in small geographical areas when overdispersion and residual spatial autocorrelation are present. These considerations lead to nine regression models derived from using three probability distributions for count data: Poisson, generalised Poisson and negative binomial, and three different autocorrelation structures. We employ the framework of Bayesian variable selection and a Gibbs sampling based technique to identify significant cancer risk factors. The framework deals with situations where the number of possible models based on different combinations of candidate explanatory variables is large enough such that calculation of posterior probabilities for all models is difficult or infeasible. The evidence from applying the modelling methodology suggests that modelling strategies based on the use of generalised Poisson and negative binomial with spatial autocorrelation work well and provide a robust basis for inference.

Hierarchical Bayesian models of subtask learning

 The current study used Bayesian hierarchical methods to challenge and extend previous work on subtask learning consistency. A general model of individual-level subtask learning was proposed focusing on power and exponential functions with constraints to test for inconsistency. To study subtask learning, we developed a novel computer-based booking task, which logged participant actions, enabling measurement of strategy use and subtask performance. Model comparison was performed using deviance information criterion (DIC), posterior predictive checks, plots of model fits, and model recovery simulations. Results showed that although learning tended to be monotonically decreasing and decelerating, and approaching an asymptote for all subtasks, there was substantial inconsistency in learning curves both at the group- and individual-levels. This inconsistency was most apparent when constraining both the rate and the ratio of learning to asymptote to be equal across subtasks, thereby giving learning curves only 1 parameter for scaling. The inclusion of 6 strategy covariates provided improved prediction of subtask performance capturing different subtask learning processes and subtask trade-offs. In addition, strategy use partially explained the inconsistency in subtask learning. Overall, the model provided a more nuanced representation of how complex tasks can be decomposed in terms of simpler learning mechanisms.

Regularizing topic discovery in emrs with side information by using hierarchical bayesian models

We propose a novel hierarchical Bayesian framework, word-distance-dependent Chinese restaurant franchise (wd-dCRF) for topic discovery from a document corpus regularized by side information in the form of word-to-word relations, with an application on Electronic Medical Records (EMRs). Typically, a EMRs dataset consists of several patients (documents) and each patient contains many diagnosis codes (words). We exploit the side information available in the form of a semantic tree structure among the diagnosis codes for semantically-coherent disease topic discovery. We introduce novel functions to compute word-to-word distances when side information is available in the form of tree structures. We derive an efficient inference method for the wddCRF using MCMC technique. We evaluate on a real world medical dataset consisting of about 1000 patients with PolyVascular disease. Compared with the popular topic analysis tool, hierarchical Dirichlet process (HDP), our model discovers topics which are superior in terms of both qualitative and quantitative measures.

Nonparametric rank tests for non-stationary panels

We develop a set of nonparametric rank tests for non-stationary panels based on multivariate variance ratios which use untruncated kernels. As such, the tests do not require the choice of tuning parameters associated with bandwidth or lag length and also do not require choices with respect to numbers of common factors. The tests allow for unrestricted cross-sectional dependence and dynamic heterogeneity among the units of the panel, provided simply that a joint functional central limit theorem holds for the panel of differenced series. We provide a discussion of the relationships between our setting and the settings for which first- and second generation panel unit root tests are designed. In Monte Carlo simulations we illustrate the small-sample performance of our tests when they are used as panel unit root tests under the more restrictive DGPs for which panel unit root tests are typically designed, and for more general DGPs we also compare the small-sample performance of our nonparametric tests to parametric rank tests. Finally, we provide an empirical illustration by testing for income convergence among countries.

Bayesian hierarchical modeling of the temporal dynamics of subjective well-being: A 10 year longitudinal analysis

This study demonstrates, for the first time, how Bayesian hierarchical modeling can be applied to yield novel insights into the long-term temporal dynamics of subjective well-being (SWB). Several models were proposed and examined using Bayesian methods. The models were assessed using a sample of Australian adults (. n=. 1081) who provided annual SWB scores on between 5 and 10 occasions. The best fitting models involved a probit transformation, allowed error variance to vary across participants, and did not include a lag parameter. Including a random linear and quadratic effect resulted in only a small improvement over the intercept only model. Examination of individual-level fits suggested that most participants were stable with a small subset exhibiting patterns of systematic change.

A nonparametric model of financial system and economic growth

In this paper, we show that in the proposed models for economic growth, the financial system variables are generally nonparametric. We, thus, use a nonparametric panel data model to estimate the financial system-economic growth relationship. Our results suggest that as long as a country's domestic credit and private credit are above their cross-sectional mean they have a positive effect on GDP growth. We also discover that market capitalisation positively and significantly impacts GDP growth, while stocks traded (with the exception of OECD countries) has a statistically insignificant effect on GDP growth.