Temporal and statistical information in causal structure learning

Three experiments examined children’s and adults’ abilities to use statistical and temporal information to distinguish between common cause and causal chain structures. In Experiment 1, participants were provided with conditional probability information and/or temporal information and asked to infer the causal structure of a three-variable mechanical system that operated probabilistically. Participants of all ages preferentially relied on the temporal pattern of events in their inferences, even if this conflicted with statistical information. In Experiments 2 and 3, participants observed a series of interventions on the system, which in these experiments operated deterministically. In Experiment 2, participants found it easier to use temporal pattern information than statistical information provided as a result of interventions. In Experiment 3, in which no temporal pattern information was provided, children from 6-7 years, but not younger children, were able to use intervention information to make causal chain judgments, although they had difficulty when the structure was a common cause. The findings suggest that participants, and children in particular, may find it more difficult to use statistical information than temporal pattern information because of its demands on information processing resources. However, there may also be an inherent preference for temporal information.

Efficient Structure Learning of Bayesian Networks using Constraints

This paper addresses the problem of learning Bayesian network structures from data based on score functions that are decomposable. It describes properties that strongly reduce the time and memory costs of many known methods without losing global optimality guarantees. These properties are derived for different score criteria such as Minimum Description Length (or Bayesian Information Criterion), Akaike Information Criterion and Bayesian Dirichlet Criterion. Then a branch-and-bound algorithm is presented that integrates structural constraints with data in a way to guarantee global optimality. As an example, structural constraints are used to map the problem of structure learning in Dynamic Bayesian networks into a corresponding augmented Bayesian network. Finally, we show empirically the benefits of using the properties with state-of-the-art methods and with the new algorithm, which is able to handle larger data sets than before.

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.

Advances in Learning Bayesian Networks of Bounded Treewidth

This work presents novel algorithms for learning Bayesian networks of bounded treewidth. Both exact and approximate methods are developed. The exact method combines mixed integer linear programming formulations for structure learning and treewidth computation. The approximate method consists in sampling k-trees (maximal graphs of treewidth k), and subsequently selecting, exactly or approximately, the best structure whose moral graph is a subgraph of that k-tree. The approaches are empirically compared to each other and to state-of-the-art methods on a collection of public data sets with up to 100 variables.

Learning Extended Tree Augmented Naive Structures

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). We enhance our procedure with a new score function that only takes into account arcs that are relevant to predict the class, as well as an optimization over the equivalent sample size during learning. These ideas may be useful for structure learning of Bayesian networks in general. A range of experiments shows that we obtain models with better prediction accuracy than naive Bayes and TAN, and comparable to the accuracy of the state-of-the-art classifier averaged one-dependence estimator (AODE). We release our implementation of ETAN so that it can be easily installed and run within Weka.

Learning Bounded Tree-Width Bayesian Networks via Sampling

Learning Bayesian networks with bounded tree-width has attracted much attention recently, because low tree-width allows exact inference to be performed efficiently. Some existing methods [12, 14] tackle the problem by using k-trees to learn the optimal Bayesian network with tree-width up to k. In this paper, we propose a sampling method to efficiently find representative k-trees by introducing an Informative score function to characterize the quality of a k-tree. The proposed algorithm can efficiently learn a Bayesian network with tree-width at most k. Experiment results indicate that our approach is comparable with exact methods, but is much more computationally efficient.

Kinematic Design of a 6-DOF Parallel Manipulator with Decoupled Translation and Rotation

A new three-limb, six-degree-of-freedom (DOF) parallel manipulator (PM), termed a selectively actuated PM (SA-PM), is proposed. The end-effector of the manipulator can produce 3-DOF spherical motion, 3-DOF translation, 3-DOF hybrid motion, or complete 6-DOF spatial motion, depending on the types of the actuation (rotary or linear) chosen for the actuators. The manipulator architecture completely decouples translation and rotation of the end-effector for individual control. The structure synthesis of SA-PM is achieved using the line geometry. Singularity analysis shows that the SA-PM is an isotropic translation PM when all the actuators are in linear mode. Because of the decoupled motion structure, a decomposition method is applied for both the displacement analysis and dimension optimization. With the index of maximal workspace satisfying given global conditioning requirements, the geometrical parameters are optimized. As a result, the translational workspace is a cube, and the orientation workspace is nearly unlimited.

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.

Nonrigid Structure-From-Motion From 2-D Images Using Markov Chain Monte Carlo

In this paper we present a new method for simultaneously determining three dimensional (3-D) shape and motion of a non-rigid object from uncalibrated two dimensional (2- D) images without assuming the distribution characteristics. A non-rigid motion can be treated as a combination of a rigid rotation and a non-rigid deformation. To seek accurate recovery of deformable structures, we estimate the probability distribution function of the corresponding features through random sampling, incorporating an established probabilistic model. The fitting between the observation and the projection of the estimated 3-D structure will be evaluated using a Markov chain Monte Carlo based expectation maximisation algorithm. Applications of the proposed method to both synthetic and real image sequences are demonstrated with promising results.

A STRUCTURE-FROM-MOTION SCHEME THAT LOOKS FOR PARALLELS, AND ITS IMPLICATIONS FOR APPARENT REVERSALS IN ROTATING TRAPEZIA

Apparent reversals in rotating trapezia have been regarded as evidence that human vision favours methods which are heuristic or form dependent. However, the argument is based on the assumption that general algorithmic methods would avoid the illusion, and that has never been clear. A general algorithm for interpreting moving parallels has been developed to address the issue. It handles a considerable range of stimuli successfully, but finds multiple interpretations in situations which correspond closely to those where apparent reversals occur. This strengthens the hypothesis that apparent reversals may occur when general algorithmic methods fail and heuristics are invoked as a stopgap.

Using UAV acquired photography and structure from motion techniques for studying glacier landforms: application to the glacial flutes at Isfallsglaciären

Glacier and ice sheet retreat exposes freshly deglaciated terrain which often contains small-scale fragile geomorphological features which could provide insight into subglacial or submarginal processes. Subaerial exposure results in potentially rapid landscape modification or even disappearance of the minor–relief landforms as wind, weather, water and vegetation impacts on the newly exposed surface. Ongoing retreat of many ice masses means there is a growing opportunity to obtain high resolution geospatial data from glacier forelands to aid in the understanding of recent subglacial and submarginal processes. Here we used an unmanned aerial vehicle to capture close-range aerial photography of the foreland of Isfallsglaciären, a small polythermal glacier situated in Swedish Lapland. An orthophoto and a digital elevation model with ~2 cm horizontal resolution were created from this photography using structure from motion software. These geospatial data was used to create a geomorphological map of the foreland, documenting moraines, fans, channels and flutes. The unprecedented resolution of the data enabled us to derive morphological metrics (length, width and relief) of the smallest flutes, which is not possible with other data products normally used for glacial landform metrics mapping. The map and flute metrics compare well with previous studies, highlighting the potential of this technique for rapidly documenting glacier foreland geomorphology at an unprecedented scale and resolution. The vast majority of flutes were found to have an associated stoss-side boulder, with the remainder having a likely explanation for boulder absence (burial or erosion). Furthermore, the size of this boulder was found to strongly correlate with the width and relief of the lee-side flute. This is consistent with the lee-side cavity infill model of flute formation. Whether this model is applicable to all flutes, or multiple mechanisms are required, awaits further study.

On the structure and dynamics of ionic liquids

The structure and dynamics of the ionic liquid 1-ethyl-3-methylimidazolium nitrate is studied by molecular dynamics simulations. We find long-range spatial correlations between the ions and a three-dimensional local structure that reflects the asymmetry of the cations. The main contribution to the configurational energy comes from the electrostatic interactions which leads to charge-ordering effects. Radial screening and threedimensional distribution of charge are also analyzed. The motion of a single ion is studied via velocity and reorientational correlation functions. It is found that ions "rattle" in a long-lived cage, while the orientational structure relaxes on a time scale longer than 200 ps. As in a supercooled liquid, the mean square displacements reveal a subdiffusive dynamics. In addition, the presence of dynamic heterogeneities can be detected by analyzing the non-Gaussian behavior of the van Hove correlation function and the spatial arrangement of the most mobile ions. The short-time collective dynamics is also studied through the electric current time correlation function.

Structure and dynamics of a confined ionic liquid. topics of relevance to dye-sensitized solar cells

The behavior of a model ionic liquid (IL) confined between two flat parallel walls was studied at various interwall distances using computer simulations. The results focus both on structural and dynamical properties. Mass and charge density along the confinement axis reveal a structure of layers parallel to the walls that leads to an oscillatory profile in the electrostatic potential. Orientational correlation functions indicate that cations at the interface orient tilted with respect to the surface and that any other orientational order is lost thereafter. The diffusion coefficients of the ions exhibit a maximum as a function of the confinement distance, a behavior that results from a combination of the structure of the liquid as a whole and a faster molecular motion in the vicinity of the walls. We discuss the relevance of the present results and elaborate on topics that need further attention regarding the effects of ILs in the functioning of IL-based dye-sensitized solar cells.