Efficient learning of decomposable models with a bounded clique size

The learning of probability distributions from data is a ubiquitous problem in the fields of Statistics and Artificial Intelligence. During the last decades several learning algorithms have been proposed to learn probability distributions based on decomposable models due to their advantageous theoretical properties. Some of these algorithms can be used to search for a maximum likelihood decomposable model with a given maximum clique size, k, which controls the complexity of the model. Unfortunately, the problem of learning a maximum likelihood decomposable model given a maximum clique size is NP-hard for k > 2. In this work, we propose a family of algorithms which approximates this problem with a computational complexity of O(k · n^2 log n) in the worst case, where n is the number of implied random variables. The structures of the decomposable models that solve the maximum likelihood problem are called maximal k-order decomposable graphs. Our proposals, called fractal trees, construct a sequence of maximal i-order decomposable graphs, for i = 2, ..., k, in k − 1 steps. At each step, the algorithms follow a divide-and-conquer strategy based on the particular features of this type of structures. Additionally, we propose a prune-and-graft procedure which transforms a maximal k-order decomposable graph into another one, increasing its likelihood. We have implemented two particular fractal tree algorithms called parallel fractal tree and sequential fractal tree. These algorithms can be considered a natural extension of Chow and Liu’s algorithm, from k = 2 to arbitrary values of k. Both algorithms have been compared against other efficient approaches in artificial and real domains, and they have shown a competitive behavior to deal with the maximum likelihood problem. Due to their low computational complexity they are especially recommended to deal with high dimensional domains.

Syntactic change

[ES] En este trabajo se define el cambio sintáctico, se analizan los factores que lo causan o facilitan y se estudian sus tipos principales en griego antiguo.

Modeling Innovative Power Take-Off Based on Double-Acting Hydraulic Cylinders Array for Wave Energy Conversion

One of the key systems of a Wave Energy Converter for extraction of wave energy is the Power Take-Off (PTO) device. This device transforms the mechanical energy of a moving body into electrical energy. This paper describes the model of an innovative PTO based on independently activated double-acting hydraulic cylinders array. The model has been developed using a simulation tool, based on a port-based approach to model hydraulics systems. The components and subsystems used in the model have been parameterized as real components and their values experimentally obtained from an existing prototype. In fact, the model takes into account most of the hydraulic losses of each component. The simulations show the flexibility to apply different restraining torques to the input movement depending on the geometrical configuration and the hydraulic cylinders on duty, easily modified by a control law. The combination of these two actions allows suitable flexibility to adapt the device to different sea states whilst optimizing the energy extraction. The model has been validated using a real test bench showing good correlations between simulation and experimental tests.