Probabilistic Inference for Graph Classification

author: Koji Tsuda, Max Planck Institute for Biological Cybernetics, Max Planck Institute
published: Feb. 25, 2007,   recorded: June 2006,   views: 6534
Categories

Slides

Related Open Educational Resources

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.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

Graph data is getting increasingly popular in, e.g., bioinfor- matics and text processing. A main dificulty of graph data processing lies in the intrinsic high dimensionality of graphs, namely, when a graph is represented as a binary feature vector of indicators of all possible sub- graphs, the dimensionality gets too large for usual statistical methods.

See Also:

Download slides icon Download slides: pmsb06_tsuda_pigc_01.ppt (1.2┬áMB)


Help icon Streaming Video Help

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:

make sure you have javascript enabled or clear this field: