Frequent graph mining - what is the question?

author: Gyorgy Turan, Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago
published: Sept. 7, 2007,   recorded: September 2007,   views: 6789

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.


The objective of data mining is to find regularities, or interesting patterns in large data sets, such as business transactions. More recently, there has been great interest in extending this work to structured data, such as graphs. The domain could be a database of molecular graphs, or the web graph, and the question could be to find subgraphs which occur frequently in the data. Algorithms usually list frequent subgraphs or other patterns. There are many different formulations of this problem. At this stage of the development of the field, it appears to be of some interest to put together a general picture of the different variants. In this talk we present an attempt towards this direction.

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 Martin Golumbic, April 1, 2010 at 8:03 a.m.:

Prof. Gyorgy Turan is giving the lecture.

Comment2 Anupama Phakatkar, January 29, 2011 at 10:10 a.m.:

Can I get at least power-point presentation?

Mrs. Anupama Phakatkar

Write your own review or comment:

make sure you have javascript enabled or clear this field: