Sciweavers

791 search results - page 91 / 159
» Learning Probabilistic Ontologies with Distributed Parameter...
Sort
View
ISCI
2007
170views more  ISCI 2007»
13 years 8 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
CVPR
2008
IEEE
14 years 10 months ago
Kernel-based learning of cast shadows from a physical model of light sources and surfaces for low-level segmentation
In background subtraction, cast shadows induce silhouette distortions and object fusions hindering performance of high level algorithms in scene monitoring. We introduce a nonpara...
André Zaccarin, Nicolas Martel-Brisson
ICASSP
2011
IEEE
13 years 13 days ago
Fast adaptive variational sparse Bayesian learning with automatic relevance determination
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
Dmitriy Shutin, Thomas Buchgraber, Sanjeev R. Kulk...
NC
2006
132views Neural Networks» more  NC 2006»
13 years 8 months ago
Learning short multivariate time series models through evolutionary and sparse matrix computation
Multivariate Time Series (MTS) data are widely available in different fields including medicine, finance, bioinformatics, science and engineering. Modelling MTS data accurately is...
Stephen Swift, Joost N. Kok, Xiaohui Liu
DAGM
2011
Springer
12 years 8 months ago
Relaxed Exponential Kernels for Unsupervised Learning
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...
Karim T. Abou-Moustafa, Mohak Shah, Fernando De la...