Discovering Latent Structure in Clinical Databases

author: Jesse Davis, KU Leuven
published: Jan. 23, 2012,   recorded: December 2011,   views: 3370


Related content

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.
  Delicious Bibliography


Statistical relational learning allows algorithms to simultaneously reason about complex structure and uncertainty with a given domain. One common challenge when analyzing these domains is the presence of latent structure within the data. We present a novel algorithm that automatically groups together different objects in a domain in order to uncover latent structure, including a hierarchy or even heterarchy. We empirically evaluate our algorithm on two large real-world tasks where the goal is to predict whether a patient will have an adverse reaction to a medication. We found that the proposed approach produced a more accurate model than the baseline approach. Furthermore, we found interesting latent structure that was deemed to be relevant and interesting by a medical collaborator.

See Also:

Download slides icon Download slides: nipsworkshops2011_davis_databases_01.pdf (319.4┬áKB)

Help icon Streaming Video Help

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:

make sure you have javascript enabled or clear this field: