Game Theory & Clustering

author: Marcello Pelillo, University Ca' Foscari
published: April 1, 2009,   recorded: February 2009,   views: 2191
Categories

Slides

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

 Watch videos:   (click on thumbnail to launch)

Watch Part 1
Part 1 59:17
!NOW PLAYING
Watch Part 2
Part 2 1:01:34
!NOW PLAYING
Watch Part 3
Part 3 54:59
!NOW PLAYING

Description

The course will provide an overview of recent work on pairwise data clustering which has lead to establish intriguing connections between unsupervised learning and (evolutionary) game theory. The framework is centered around the notion of a "dominant set," a novel graph-theoretic concept which generalizes that of a maximal clique to edge-weighted graphs. Algorithms inspired from evolutionary game theory, and applications in computer vision and pattern recognition will be discussed.

See Also:

Download slides icon Download slides: ssll09_pelillo_gath.pdf (2.0┬áMB)


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: