Biomine search engine for probabilistic graphs

author: Hannu Toivonen, Department of Computer Science, University of Helsinki
published: Feb. 3, 2010,   recorded: January 2010,   views: 2866


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.


Biomine is a search engine prototype under development. It can be used to find biological entities that are (indirectly) related to given query entities, as well as to display and evaluate the relations. Biomine is based on an integrated index to a number of public biological databases. The representation is a probabilistic graph, where nodes correspond to biological entities (typically a record in a biological database) and edges to their relationships (typically a cross-reference between database records). Edges are annotated with probabilities that reflect the strength or the reliability of the relation. I will discuss research problems and challenges for search in such graphs.

See Also:

Download slides icon Download slides: solomon_toivonen_bsepg_01.pdf (560.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: