Abstract #300246

The views expressed here are those of the individual authors
and not necessarily those of the ASA or its board, officers, or staff.

Back to main JSM 2002 Program page
JSM 2002 Abstract #300246
Activity Number: 1
Type: Invited
Date/Time: Sunday, August 11, 2002 : 2:00 PM to 3:50 PM
Sponsor: Section on Statistical Computing*
Abstract - #300246
Title: Mining of Communication Networks
Author(s): Chris Volinsky*+
Affiliation(s): AT&T Labs - Research
Address: 180 Park Ave, Florham Park , New Jersey, 07932, USA
Keywords: network analysis ; communities of interest
Abstract:

We consider problems that can be characterized by large dynamic graphs. Communication networks provide the prototypical example of such problems where nodes in the graph are network IDs and the edges represent communication between pairs of network IDs. In such graphs, nodes and edges appear and disappear through time so that methods that apply to static graphs are not sufficient. We introduce a data structure that captures, in an approximate sense, the graph and its evolution through time. The data structure arises from a bottom-up representation of the large graph as the union of small subgraphs, called Communities of Interest (COI), centered on every node. These subgraphs are interesting in their own right, and we discuss two applications in the area of telecommunications fraud detection to help motivate the ideas.

  • 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 2002 program

JSM 2002

For information, contact meetings@amstat.org or phone (703) 684-1221.

If you have questions about the Continuing Education program, please contact the Education Department.

Revised March 2002