Sciweavers

1622 search results - page 31 / 325
» Learning a Hidden Matching
Sort
View
114
Voted
CVPR
2004
IEEE
15 years 1 months ago
Modeling Complex Motion by Tracking and Editing Hidden Markov Graphs
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
Yizhou Wang, Song Chun Zhu
ICANN
2007
Springer
15 years 3 months ago
Generalized Softmax Networks for Non-linear Component Extraction
Abstract. We develop a probabilistic interpretation of non-linear component extraction in neural networks that activate their hidden units according to a softmaxlike mechanism. On ...
Jörg Lücke, Maneesh Sahani
UAI
2003
14 years 11 months ago
The Information Bottleneck EM Algorithm
Learning with hidden variables is a central challenge in probabilistic graphical models that has important implications for many real-life problems. The classical approach is usin...
Gal Elidan, Nir Friedman
ICASSP
2011
IEEE
14 years 1 months ago
A non-negative approach to semi-supervised separation of speech from noise with the use of temporal dynamics
We present a semi-supervised source separation methodology to denoise speech by modeling speech as one source and noise as the other source. We model speech using the recently pro...
Gautham J. Mysore, Paris Smaragdis
KDD
2002
ACM
293views Data Mining» more  KDD 2002»
15 years 10 months ago
Automatic Categorization of Web Pages and User Clustering with Mixtures of Hidden Markov Models
We propose mixtures of hidden Markov models for modelling clickstreams of web surfers. Hence, the page categorization is learned from the data without the need for a (possibly cumb...
Alexander Ypma, Tom Heskes