Location: EU Supported » PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning » European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), Warsaw 2007

A Fast Method to Predict the Labeling of a Tree

author: Sergio Rojas Galeano, Department of Computer Science, University College London
published: Jan. 28, 2008,   recorded: September 2007,   views: 3184
Categories

See Also:

Help icon Streaming Video Help

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

Description

Given an n vertex weighted tree with (structural) diameter SG and a set of ` vertices we give a method to compute the corresponding `×` Gram matrix of the pseudoinverse of the graph Laplacian in O(n + `2SG) time. We discuss the application of this method to predicting the labeling of a graph. Preliminary experimental results on a digit classification task are given.

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: