1. Home
  2. Material Detail: A Fast Method to Predict the Labeling of a Tree

Material Detail

A Fast Method to Predict the Labeling of a Tree

A Fast Method to Predict the Labeling of a Tree

This video was recorded at European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), Warsaw 2007. 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.
Keywords:
videolectures, ocwc, oec
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Presentation
Date Added to MERLOT:
February 8, 2015
Date Modified in MERLOT:
February 8, 2015
Author:
Submitter:
The Open Education Consortium
Primary Audience:
College General Ed, College Lower Division, College Upper Division
Technical Format:
Video
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
No
Accessibility Information Available:
Unknown
Creative Commons:
Creative Commons License
This work is licensed under a Attribution-NonCommercial-NoDerivs 3.0 United States

Browse...

Disciplines with similar materials as A Fast Method to Predict the Labeling of a Tree
People who viewed this also viewed
Other materials like A Fast Method to Predict the Labeling of a Tree

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.