Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
Abstract. Probabilistic finite automata (PFA) model stochastic languages, i.e. probability distributions over strings. Inferring PFA from stochastic data is an open field of rese...
Generative model learning is one of the key problems in machine learning and computer vision. Currently the use of generative models is limited due to the difficulty in effective...
Knowledge flow in interdisciplinary teams has become of particular interest as research and alliances cross traditional disciplinary boundaries, and as computing is applied in any...
We address the problem of evaluating the risk of a given model accurately at minimal labeling costs. This problem occurs in situations in which risk estimates cannot be obtained f...
Christoph Sawade, Niels Landwehr, Steffen Bickel, ...