Transductive Rademacher complexities for learning over a graph
published: Sept. 7, 2007, recorded: September 2007, views: 4483
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.
Recent investigations indicate the use of a probabilistic ”learning” perspective of tasks defined on a single graph, as opposed to the traditional algorithmical ”computational” point of view. This note discusses the use of Rademacher complexities in this setting, and illustrates the use of Kruskal’s algorithm for transductive inference based on a nearest neighbor rule.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !