Online Similarity Prediction of Networked Data from Known and Unknown Graphs thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Online Similarity Prediction of Networked Data from Known and Unknown Graphs

Published on Aug 09, 20133148 Views

We consider online similarity prediction problems over networked data. We begin by relating this task to the more standard class prediction problem, showing that, given an arbitrary algorithm for clas

Related categories

Chapter list

Online Similarity Prediction of Networked Data from Known and Unknown Graphs00:00
Classi cation and Similarity - 100:13
Classi cation and Similarity - 201:18
Connection02:07
Problem03:35
Recipe for a solution03:57
Similarity prediction on a graph05:05
Similarity prediction via linear classi cation07:32
Graph approximation via a random BST09:27
An optimal algorithm11:43
A fast algorithm12:30
Fast perceptron prediction - sketch13:07
What if the graph is unknown?14:18
Unknown graph14:45
Conclusion16:05
References18:29