| Date |
June 9, 2006 |
| Speaker |
Dr. Tamas Horvath, Department of Computer Science III, University of Bonn |
| Title |
Mining and Learning from Graph Structured Data |
| Abstract |
In recent years, there has been an increasing interest in mining and
learning
from graph structured data.
This field of research is motivated by various application areas, such as
the
analysis of chemical graphs in pharmaceutical applications, graph structures
of the World Wide Web, or social networks.
Depending on the specification of the instance space (e.g., set of disjoint
graphs,
set of m-tuples of vertices of a graph etc.), the matching operator
(e.g., subgraph isomorphism, homomorphism etc.), and the computational task
(e.g., learning predictive models, enumerating local patterns etc.) various
problem
settings can be defined for mining and learning from graph structured data.
In this talk, we present theoretical and/or empirical results with
real-world datasets
for several such problem settings.
|
|
アブストラクト