The univariate conditioning of copulas is studied, yielding a construction method for copulas based on an a priori given copula. Based on the gluing method, g-ordinal sum of copulas is introduced and a representation of copulas by means of g-ordinal sums is given. Though different right conditionings commute, this is not the case of right and left conditioning, with a special exception of Archi...

We revisit the classic problem of estimating the population mean of an unknown singledimensional distribution from samples, taking a game-theoretic viewpoint. In our setting, samples are supplied by strategic agents, who wish to pull the estimate as close as possible to their own value. In this setting, the sample mean gives rise to manipulation opportunities, whereas the sample median does not...

Univariate decision tree algorithms are widely used in Data Mining because (i) they are easy to learn (ii) when trained they can be expressed in rule based manner. In several applications mainly including Data Mining, the dataset to be learned is very large. In those cases it is highly desirable to construct univariate decision trees in reasonable time. This may be accomplished by parallelizing...

Based on a constructive representation, which distinguishes between a skewing mechanism P and an underlying symmetric distribution F , we introduce two flexible classes of distributions. They are generated by nonparametric modelling of either P or F . We examine properties of these distributions and consider how they can help us to identify which aspects of the data are badly captured by simple...

We formalize the notion of approximate GCD for univariate poly-nomials given with limited accuracy and then address the problem of its computation. Algebraic concepts are applied in order to provide a solid foundation for a numerical approach. We exhibit the limitations of the euclidean algorithm through experiments, show that existing methods only solve part of the problem and assert its worst...

We study the approximate GCD of two univariate polynomials given with limited accuracy or, equivalently, the exact GCD of the perturbed polynomials within some prescribed tolerance. A perturbed polynomial is regarded as a family of polynomials in a clas-siication space, which leads to an accurate analysis of the computation. Considering only the Sylvester matrix singular values, as is frequentl...