
Program
There will be three lectures and two exercise/dicussion blocks per
lecturer. A morning or afternoon block will start with 1  1 1/2
hours of lecture, followed by 1 1/2  2 hours of exercises + rest, followed
by a discussion of the exercises. During the exercise periods, the
respective lecturer will be around, as well as some fruit, snacks, and
drinks. The half blocks are intended as a reserve, and may
be either lectures or exercises or a mix of the two.
Schedule

September 6 Monday 
September 7 Tuesday 
September 8 Wednesday 
September 9 Thursday 
September 10 Friday 
9.0013.00 
Hofmann Matrix Techniques I 
Raghavan Search Basics I 
Raghavan Search Basics II 
Chakrabarti Graphs Techniques I 
Chakrabarti Wrapup 
13.0014.30 
Lunch break 
Lunch break 
Lunch break 
Lunch break 
Lunch break 
14.3018.30 
Hofmann Matrix Techniques II 
Hofmann Wrapup 
Raghavan Wrapup 
Chakrabarti Graph Techniques II 

Excursion 

Evening 

School dinner 



Lecture(r)s
Below you will find, probably by August, short abstracts of the
lectures together with an indication of useful
prerequisites. Clicking on the photos gets you to the
respective lecturers' homepage.
Prabhakar Raghavan
Verity, Inc. / Stanford University
Elements of Text and Web Search


Abstract:
These lectures will cover the basics of inverted indexes to handle text
querying and scoring of retrieved results. Students are expected to be
familiar with basic concepts from data structures, linear algebra and
probability.
Online Resources:
Here is a pdf version of the slides of
lecture 1,
lecture 2, and
lecture 3.

Thomas Hofmann
Brown University
Matrix Decomposition Techniques in Information Retrieval and Machine Learning


Abstract:
The tutorial discusses various methods from statistics and machine
learning that are based on matrix decompositions. This includes
classical methods such as principal component analysis and factor
analysis, but also more recent achievements such as nonlinear PCA,
independent component analysis, nonnegative matrix factorization,
(probabilistic) latent semantic analysis and spectral clustering. The
lectures will not deal with numerical issues of matrix decompositions,
but rather illustrate how such methods can be used in the context of
machine learning and its applications. Special emphasis is put on
tasks from the domain of information retrieval such as semantic
search, collaborative filtering and hyperlink analysis.
Prerequisites:
Some basic knowledge in linear algebra, probability and statistics.
Online Resources:
Here is a pdf version of the slides.

Soumen Chakrabarti
Indian Institute of Technology, Bombay
Using Graphs in Unstructured and Semistructured Data Mining


Abstract: Until recently, machine learning and data
mining techniques focused on single, flat tables of feature vectors.
However, in the last few years, there has been an explosion of data
mining applications where the underlying data has an irresistible
graphical interpretation. The Web is a standard example by now, but
there are many other domains spanning the physical Internet, emails,
USENET, blogs, keyword search in XML and relational data,
multirelational mining, natural language processing, and biological
data. This short course will give a concise overview of the important
concepts and tools for characterizing, modeling, and analyzing graph
structures common in some of the application domains listed above, with
pointers to active research areas, latest publications, and available
software.
Prerequisites: For data management researchers and
professionals who need to deal with data domains naturally represented by
graphs; algorithm designers. Basic (undergraduate level) probability and
systems performance maturity is
assumed.
Online resources:
Soumen has posted
under his homepage
an uptodate version of his slides, some exercises & solutions, and a reading list.

Organization
ADFOCS 2004 is organized by Holger Bast & Matthias Bender.
Logo and help with web pages: Alexandra Zhilyakova.
Help with local arrangements:
Petra Mayer and
Petra Schaaf.
For comments or questions send an email to
adfocs@mpisb.mpg.de.

