|
Activity Number:
|
260
|
|
Type:
|
Invited
|
|
Date/Time:
|
Tuesday, August 8, 2006 : 10:30 AM to 12:20 PM
|
|
Sponsor:
|
Section on Statistical Computing
|
| Abstract - #304916 |
|
Title:
|
Modeling Massive Dynamic Graphs
|
|
Author(s):
|
Chris Volinsky*+
|
|
Companies:
|
AT&T Labs-Research
|
|
Address:
|
Shannon Laboratory, Room D235, Florham Park, NJ, 07932,
|
|
Keywords:
|
graphs ; fraud ; networks ; data mining
|
|
Abstract:
|
When studying large transactional networks---such as telephone call detail data, credit card transactions, or web clickstream data---graphs are a convenient and informative way to represent data. When the graph edges have a time stamp, we have a "dynamic graph," where the edges are born and die through time. I will present a framework for representing and analyzing dynamic graphs with a focus on the massive graphs found in telecommunications and Internet data. I also will demonstrate the application of this model to a telecommunications fraud problem, where we are looking for patterns in the graph associated with fraud.
|
- The address information is for the authors that have a + after their name.
- Authors who are presenting talks have a * after their name.
Back to the full JSM 2006 program |
