Sciweavers

1651 search results - page 159 / 331
» Measuring the Complexity of Classification Problems
Sort
View
JMLR
2006
112views more  JMLR 2006»
13 years 8 months ago
Kernels on Prolog Proof Trees: Statistical Learning in the ILP Setting
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
Andrea Passerini, Paolo Frasconi, Luc De Raedt
ML
2006
ACM
13 years 8 months ago
Using duration models to reduce fragmentation in audio segmentation
We investigate explicit segment duration models in addressing the problem of fragmentation in musical audio segmentation. The resulting probabilistic models are optimised using Mar...
Samer A. Abdallah, Mark B. Sandler, Christophe Rho...
PR
2006
111views more  PR 2006»
13 years 8 months ago
The Bhattacharyya space for feature selection and its application to texture segmentation
A feature selection methodology based on a novel Bhattacharyya space is presented and illustrated with a texture segmentation problem. The Bhattacharyya space is constructed from ...
Constantino Carlos Reyes-Aldasoro, Abhir Bhalerao
CAGD
2004
113views more  CAGD 2004»
13 years 8 months ago
Developable surface fitting to point clouds
Given a set of data points as measurements from a developable surface, the present paper investigates the recognition and reconstruction of these objects. We investigate the set o...
Martin Peternell
CORR
2002
Springer
132views Education» more  CORR 2002»
13 years 7 months ago
Robust Feature Selection by Mutual Information Distributions
Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address question...
Marco Zaffalon, Marcus Hutter