The Infinite Factorial Hidden Markov Model
author:Jurgen Van Gael,
Computer Laboratory, University of Cambridge
published: Aug. 4, 2008, recorded: July 2008, views: 363
published: Aug. 4, 2008, recorded: July 2008, views: 363
You might be experiencing some problems with Your Video player.
Slides
Related content
Visitors who watched this lecture also watched...
24:20
244 views - Jurgen Van Gael, 2008
23:58
232 views - Emily Fox, 2008
01:34:49
6414 views - Yee Whye Teh, 2007
05:15:54
4690 views - Zoubin Ghahramani, 2007
03:52:27
4260 views - Christian Robert, 2004
19:08
176 views - Daniel Roy, 2008
43:12
102 views - Jim Griffin, 2008
24:37
172 views - Niels Landwehr, 2006
01:05:42
4867 views - Michael I. Jordan, 2005
04:59:19
18387 views - Sam Roweis, 2006
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity:
You need to login to cast your vote.
Description
The innite factorial hidden Markov model is a non-parametric extension of the factorial hidden Markov model. Our model denes a probability distribution over an innite num- ber of independent binary hidden Markov chains which together produce an observable sequence of random variables. Central to our model is a new type of non-parametric prior distribution inspired by the Indian Buf- fet Process which we call the Markov Indian Buet Process.
See Also:
Download slides:
icml08_vangael_ifh_01.pdf (540.6 KB)
Launch in a standalone WM Player
Switch to Windows Media Player
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




Write your own review or comment: