ProbaMap: a scalable tool for discovering probabilistic mappings between taxonomies

author: Remi Tournaire, Laboratoire d´Informatique de Grenoble, Grenoble University
published: June 7, 2010,   recorded: May 2010,   views: 3026


Related Open Educational Resources

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.


In this paper, we investigate a principled approach for defining and discovering probabilistic mappings between two taxonomies. First, we compare two ways of modeling probabilistic mappings which are compatible with the logical constraints declared in each taxonomy. Then we describe a generate and test algorithm (called ProbaMap) which minimizes the number of calls to the probability estimator for determining those mappings whose probability exceeds a certain threshold. Finally, we provide an experimental analysis of this approach.

See Also:

Download slides icon Download slides: akbc2010_tournaire_prma_01.pdf (271.0 KB)

Download article icon Download article: akbc2010_tournaire_prma_paper.pdf (342.8 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: