Multi-Task Label Propagation with Dissimilarity Measures

author: Marco Frasca, Dipartimento di Scienze dell'Informazione, Università Degli Studi Di Milano
published: Oct. 25, 2016,   recorded: August 2016,   views: 991

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.


Multi-task algorithms typically use task similarity information as a bias to speed up learning. We argue that, when the classification problem is unbalanced, task dissimilarity information provides a more effective bias, as rare class labels tend to be better separated from the frequent class labels. In particular, we show that a multi-task extension of the label propagation algorithm for graph-based classification works much better on protein function prediction problems when the task relatedness information is represented using a dissimilarity matrix as opposed to a similarity matrix.

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: