Identification of overlapping biclusters using probabilistic relational models

coauthor: Hui Zhao, K. U. Leuven

You might be experiencing some problems with Your Video player.

*Slides*
0:00	- Identification of overlapping biclusters using Probabilistic Relational Models - Announcement
0:07	Identification of overlapping biclusters using Probabilistic Relational Models
1:22	Overview
1:51	- Biclustering and biology
1:57	Biclustering and biology - 1
3:19	Biclustering and biology - 2
4:08	- Probabilistic relational models
4:12	Probabilistic relational models (PRMs) - 1
4:52	Probabilistic relational models (PRMs) - 2
6:15	- ProBic biclustering model
6:20	ProBic biclustering model: notation
7:02	ProBic biclustering model - 1
7:59	ProBic biclustering model - 2
10:03	ProBic biclustering model - 3
10:41	ProBic biclustering model - 4
10:42	- Algorithm
11:36	- Algorithm
11:42	Algorithm: choices
12:26	Algorithm: expectation-maximization
13:35	- Results
13:37	Algorithm: simple example
13:57	- Results
14:07	Results: noise sensitivity
14:54	Results: noise sensitivity
15:51	Results: bicluster shape independence - 1
16:20	Results: bicluster shape independence - 2
16:30	Results: overlap examples
17:23	Results: missing values - 1
18:15	Results: missing values - 2
19:01	Results: missing values - 3
19:45	- Conclusion
19:49	Conclusion
20:46	Acknowledgements
21:12	- Questions

Lecture rating

People found this lecture:
Worth seeing
because it is:
Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

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.