Entire Regularization Paths for Graph Data

author: Koji Tsuda, Max Planck Institute for Biological Cybernetics, Max Planck Institute
published: Oct. 29, 2007,   recorded: June 2007,   views: 3748


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.


Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty 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 subgraph patterns, the dimensionality gets too large for usual statistical methods. We propose an efficient method to select a small number of salient patterns by regularization path tracking. The generation of useless patterns is minimized by progressive extension of the search space. In experiments, it is shown that our technique is considerably more efficient than a simpler approach based on frequent substructure mining.

See Also:

Download slides icon Download slides: icml07_tsuda_erpg.pdf (315.4 KB)

Download slides icon Download slides: icml07_tsuda_erpg.ppt (473.5 KB)

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 !

Reviews and comments:

Comment1 md mijanur rahman , January 21, 2010 at 9:26 a.m.:

data entries my proffessional

Write your own review or comment:

make sure you have javascript enabled or clear this field: