[Colloquium] Talk announcement..

[Partha Niyogi]

On Friday, Dec. 3, Dragomir Radev from the University of Michigan
will give a talk in Ryerson 255 at 12:00 noon. Details follow:
Anyone interested in meeting him should send me email to set up
an appointment. The afternoon is free. All are welcome.
best,
Partha

Time: FRIDAY DEC 3 at 12:00 noon.

Place: Ryerson 255


                   Social network analysis of text

                          Dragomir R. Radev
                        University of Michigan

   Textual data is everywhere, in email and scientific papers, in
online newspapers and e-commerce sites. The Web contains more than 200
terabytes of text not even counting the contents of dynamic textual
databases. This enormous source of knowledge is seriously
underexploited. Textual documents on the Web are very hard to model
computationally: they are unstructured, time-dependent, collectively
authored, and of uneven importance.  Traditional grammar-based
techniques don't scale up to address such problems. Novel
representations and analytical tools are needed.

   NewsInEssence (www.newsinessence.com) is a system that crawls the
Web for news, automatically clusters them by topic, and produces
user-defined extractive summaries of each cluster. A recent addition
to the battery of summarization algorithms available to NewsInEssence
is the Cosine Centrality method.  In this talk I will describe how one
can apply the theory of social networks and stochastic processes (in
particular rank-based prestige and random walks on undirected graphs)
to multi-document text summarization.