Finding Representative Nodes in Probabilistic Graphs

author: Laura Langohr, University of Helsinki
published: Oct. 20, 2009,   recorded: September 2009,   views: 3259
Categories

Slides

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

Description

We introduce the problem of identifying representative nodes in probabilistic graphs, motivated by the need to produce di fferent simple views to large networks. We defi ne a probabilistic similarity measure for nodes, and then apply clustering methods to nd groups of nodes. Finally, a representative is output from each cluster. We report on experiments with real biomedical data, using both the k-medoids and hierarchical clustering methods in the clustering step. The results suggest that the clustering based approaches are capable of finding a representative set of nodes.

See Also:

Download slides icon Download slides: ecmlpkdd09_langohr_frnpg_01.pdf (213.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: