The Skew Spectrum of Graphs
published: Aug. 7, 2008, recorded: July 2008, views: 408
Slides
Related content
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.
Description
The central issue in representing graph-structured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We present a new system of invariant graph features which we call the skew spectrum of graphs. The skew spectrum is based on mapping the adjacency matrix to a function on the symmetric group and computing bispectral invariants. The reduced form of the skew spectrum is computable in O(n3) time, and experiments show that on several benchmark datasets it can outperform state of the art graph kernels.
See Also:
Launch in a standalone WM Player
Switch to Windows Media Player
Download slides:
icml08_kondor_ssg_01.pdf (2.3 MB)
Join a Study Group
You reached a lecture within the PASCAL NoE project video collection. Click on the logo and go to the Computer Science classroom on OpenStudy. Through this classroom, you can meet other students interested in the same problems and work together on assignments, ask each other questions or just discuss the topics of the lecture.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





Write your own review or comment: