Opening - The 5th International Workshop on Mining and Learning with Graphs

published: Aug. 27, 2007,   recorded: August 2007,   views: 3080


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.


There have been several workshops on mining and learning from graphs in recent years such as last year's MLG and its forerunner MGTS workshop series on Mining Graphs, Trees and Sequences. These were successful, but were tied to the conference of one research community. Nowadays there seems to be a surge of interest in mining and learning from structured data across several communities. Most researchers, however, only have exposure to one or two communities, and no clear understanding of the relative advantages and limitations of different approaches has yet emerged. We believe this is an ideal time for a workshop that allows active researchers in this area to discuss and debate the unique challenges of mining and learning from structured data. The MLG 2007 workshop will thus concentrate on mining and learning with structured data in general and its many appearances and facets such as interpretations, graphs, trees, sequences. Specifically, we seek to invite researchers in Statistical Relational Learning, Kernel Methods for Structured Inputs/Outputs, Graph Mining, (Multi-) Relational Data Mining, Inductive Logic Programming, among others.

See Also:

Download slides icon Download slides: mlg07_opening.pdf (2.3┬á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: