A Fast Method to Predict the Labeling of a Tree
published: Jan. 28, 2008, recorded: September 2007, views: 61
Report a problem or upload filesIf 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.
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 pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !