A note of caution regarding distances on graphs

author: Ulrike von Luxburg, Max Planck Institute for Biological Cybernetics, Max Planck Institute
published: July 20, 2010,   recorded: June 2010,   views: 4545
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

Non-geometric data is often represented in form of a graph where edges represent similarity or local relationships between instances. One elegant way to exploit the global structure of the graph is implemented by the commute distance (also known as resistance distance). Supposedly it has the property that vertices from the same cluster are "close" to each other whereas vertices from different clusters are "far" from each other. We study the behavior of the commute distance as the size of the underlying graph increases. We prove that the commute distance converges to an expression that does not take into account the structure of the graph and that is completely meaningless as a distance function on the graph. Consequently, the use of the raw commute distance for machine learning purposes is strongly discouraged for large graphs and in high dimensions. We suspect that a similar behavior holds for several other distances on graphs.

See Also:

Download slides icon Download slides: icml2010_von_luxburg_ancr_01.pdf (1.7┬á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 !

Reviews and comments:

Comment1 Michael, July 20, 2010 at 11:57 p.m.:

very cool result!

Write your own review or comment:

make sure you have javascript enabled or clear this field: