ARE ARTIFICIAL NEURAL NETS AS SMART AS A RAT

The origins of artificial neural networks are related to animal conditioning theory: both are forms of connectionist theory, which in turn derives from the empiricist philosophers' principle of association. The parallel between animal learning and neural nets suggests that interaction between them should benefit both sides.

The Computational Complexity of Dominance and Consistency in CP-Nets

We investigate the computational complexity of testing dominance and consistency in CP-nets. Previously, the complexity of dominance has been determined for restricted classes in which the dependency graph of the CP-net is acyclic. However, there are preferences of interest that define cyclic dependency graphs; these are modeled with general CP-nets. In our main results, we show here that both dominance and consistency for general CP-nets are PSPACE-complete. We then consider the concept of strong dominance, dominance equivalence and dominance incomparability, and several notions of optimality, and identify the complexity of the corresponding decision problems. The reductions used in the proofs are from STRIPS planning, and thus reinforce the earlier established connections between both areas.

Decision Making by Credal Nets

Credal nets are probabilistic graphical models which extend Bayesian nets to cope with sets of distributions. This feature makes the model particularly suited for the implementation of classifiers and knowledge-based systems. When working with sets of (instead of single) probability distributions, the identification of the optimal option can be based on different criteria, some of them eventually leading to multiple choices. Yet, most of the inference algorithms for credal nets are designed to compute only the bounds of the posterior probabilities. This prevents some of the existing criteria from being used. To overcome this limitation, we present two simple transformations for credal nets which make it possible to compute decisions based on the maximality and E-admissibility criteria without any modification in the inference algorithms. We also prove that these decision problems have the same complexity of standard inference, being NP^PP-hard for general credal nets and NP-hard for polytrees.

Improving parameter learning of Bayesian nets from incomplete data

This paper addresses the estimation of parameters of a Bayesian network from incomplete data. The task is usually tackled by running the Expectation-Maximization (EM) algorithm several times in order to obtain a high log-likelihood estimate. We argue that choosing the maximum log-likelihood estimate (as well as the maximum penalized log-likelihood and the maximum a posteriori estimate) has severe drawbacks, being affected both by overfitting and model uncertainty. Two ideas are discussed to overcome these issues: a maximum entropy approach and a Bayesian model averaging approach. Both ideas can be easily applied on top of EM, while the entropy idea can be also implemented in a more sophisticated way, through a dedicated non-linear solver. A vast set of experiments shows that these ideas produce significantly better estimates and inferences than the traditional and widely used maximum (penalized) log-likelihood and maximum a posteriori estimates. In particular, if EM is adopted as optimization engine, the model averaging approach is the best performing one; its performance is matched by the entropy approach when implemented using the non-linear solver. The results suggest that the applicability of these ideas is immediate (they are easy to implement and to integrate in currently available inference engines) and that they constitute a better way to learn Bayesian network parameters.

The SEMAINE corpus of emotionally coloured character interactions

We have recorded a new corpus of emotionally coloured conversations. Users were recorded while holding conversations with an operator who adopts in sequence four roles designed to evoke emotional reactions. The operator and the user are seated in separate rooms; they see each other through teleprompter screens, and hear each other through speakers. To allow high quality recording, they are recorded by five high-resolution, high framerate cameras, and by four microphones. All sensor information is recorded synchronously, with an accuracy of 25 μs. In total, we have recorded 20 participants, for a total of 100 character conversational and 50 non-conversational recordings of approximately 5 minutes each. All recorded conversations have been fully transcribed and annotated for five affective dimensions and partially annotated for 27 other dimensions. The corpus has been made available to the scientific community through a web-accessible database.

Assessment of Activity of 'Transparent and Clear' and 'Opaque and Highly Coloured' Photocatalytic Samples using a Fluorescent Photocatalytic Activity Indicator Ink, FPaii.

The photocatalytic activity of self-cleaning glass is assessed using a resazurin (Rz) photocatalyst activity indicator ink, i.e. Rz paii, via both the rate of change in the colour of the ink (blue to pink), R(Abs), and the rate of change in the fluorescence intensity, R(Fl), (λ(excitation) = 593 nm; λ(emission) = 639 nm) of the ink. In both cases the kinetics are zero order. Additional work with a range of glass samples of different photocatalytic activity reveal R(Abs) is directly related to R(Fl), thereby showing that the latter, like the former, can be used to provide a measure of the photocatalytic activity of the sample under test. The measured value of R(Fl) is found to be the same for 5 pieces of, otherwise identical, selfcleaning glass with: black, red, blue, yellow and no coloured tape stuck to their backs, which demonstrates that R(Fl) measurements can be used to measure photocatalytic activity under conditions of high colour and opacity under which R(Abs) cannot be measured. The relevance of this novel, fluorescence-based paii to the assessment of the activity of highly coloured, opaque photocatalytic samples, such as paints and tiles, is discussed briefly.