Probabilistic Inference for Graph Classification
published: Feb. 25, 2007, recorded: June 2006, views: 6535
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.
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.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !