The 18th European Conference on Machine Learning (ECML) and the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD)

A Fast Method to Predict the Labeling of a Tree

author: Sergio Rojas Galeano, Department of Computer Science, University College London

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.

You might be experiencing some problems with Your Video player.

Lecture rating

People found this lecture:
Worth seeing
because it is:
Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

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.