Sciweavers

3607 search results - page 257 / 722
» Learning with structured sparsity
Sort
View
ICML
2008
IEEE
16 years 6 months ago
Fast nearest neighbor retrieval for bregman divergences
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...
Lawrence Cayton
ML
2006
ACM
122views Machine Learning» more  ML 2006»
15 years 11 months ago
Type-safe modular hash-consing
Hash-consing is a technique to share values that are structurally equal. Beyond the obvious advantage of saving memory blocks, hash-consing may also be used to speed up fundamenta...
Jean-Christophe Filliâtre, Sylvain Conchon
CIVR
2006
Springer
144views Image Analysis» more  CIVR 2006»
15 years 8 months ago
A Linear-Algebraic Technique with an Application in Semantic Image Retrieval
Abstract. This paper presents a novel technique for learning the underlying structure that links visual observations with semantics. The technique, inspired by a text-retrieval tec...
Jonathon S. Hare, Paul H. Lewis, Peter G. B. Enser...
NIPS
1997
15 years 6 months ago
Nonlinear Markov Networks for Continuous Variables
We address the problem of learning structure in nonlinear Markov networks with continuous variables. This can be viewed as non-Gaussian multidimensional density estimation exploit...
Reimar Hofmann, Volker Tresp
ICML
2007
IEEE
16 years 6 months ago
A kernel-based causal learning algorithm
We describe a causal learning method, which employs measuring the strength of statistical dependences in terms of the Hilbert-Schmidt norm of kernel-based cross-covariance operato...
Xiaohai Sun, Dominik Janzing, Bernhard Schölk...