Sciweavers

1683 search results - page 58 / 337
» Learning with Mixtures of Trees
Sort
View
NIPS
1998
13 years 10 months ago
Learning from Dyadic Data
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
Thomas Hofmann, Jan Puzicha, Michael I. Jordan
IJON
2002
105views more  IJON 2002»
13 years 8 months ago
Separation of sources using simulated annealing and competitive learning
This paper presents a new adaptive procedure for the linear and non-linear separation of signals with non-uniform, symmetrical probability distributions, based on both simulated a...
Carlos García Puntonet, Ali Mansour, Christ...

Publication
170views
13 years 8 months ago
Covariance Regularization for Supervised Learning in High Dimensions
This paper studies the effect of covariance regularization for classific ation of high-dimensional data. This is done by fitting a mixture of Gaussians with a regularized covaria...
Daniel L. Elliott, Charles W. Anderson, Michael Ki...
ICMCS
2009
IEEE
104views Multimedia» more  ICMCS 2009»
13 years 6 months ago
A variational multi-view learning framework and its application to image segmentation
The paper presents a novel multi-view learning framework based on variational inference. We formulate the framework as a graph representation in form of graph factorization: the g...
Zhenglong Li, Qingshan Liu, Hanqing Lu
ICMLA
2010
13 years 7 months ago
Multimodal Parameter-exploring Policy Gradients
Abstract-- Policy Gradients with Parameter-based Exploration (PGPE) is a novel model-free reinforcement learning method that alleviates the problem of high-variance gradient estima...
Frank Sehnke, Alex Graves, Christian Osendorfer, J...