Posted by
Friam mailing list on
Jun 02, 2003; 10:52am
URL: http://friam.383.s1.nabble.com/Fw-Reminder-KDD-Project-Presentation-TODAY-tp518531.html
I sometimes forward announcements of relevant talks that are given at CMU.
Although it's probably not feasible to attend them (except for Keith) there
are usually papers available. Let me know if this is not useful.
Frank
---
Frank C. Wimberly Phone: 505 995-8715 or 505 670-9918
(cell)
140 Calle Ojo Feliz
http://www.andrew.cmu.edu/user/wimberlySanta Fe, NM 87505
[hidden email]
----- Original Message -----
From: "Diane Stidle" <
[hidden email]>
To: <
[hidden email]>
Sent: Monday, June 02, 2003 10:05 AM
Subject: Reminder - KDD Project Presentation, TODAY
> Please join us...
>
> Date: 6/2/03
> Time: 2:00
> Place: 3305 Newell-Simon Hall
>
> Speaker: Yiping Zhan
> CALD Advisor: Christos Faloutsos
>
> Title: Tools for Graph Mining
>
> Abstract: Large real-world graphs often show interesting properties, such
> as power-law degree distributions and very small diameters. Discovering
> such patterns and regularities has a wide range of potential applications.
> It could help us with detecting outliers or abnormal subnetworks (such as
> terrorist networks or illegal money-laundering rings), maximizing
> efficiency of disease controlling, marketing, forecasting and simulations,
> to name a few.
>
> A graph generated model, the "recursive matrix" (R-MAT) model in
introduced
> and a method (AutoMAT) is shown for automatically estimating the input
> parameters for R-MAT in order for it to match a given real-world graph.
> Using these parameters, the resulting R-MAT graphs are shown to match many
> properties of real graphs. Also, a set of plots (A-plots) are introduced
as
> original ways for viewing large graphs. Their applications in finding
> interesting patterns and outliers in real, large graphs are demonstrated.
>