(Enter summary)
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... (Update)
Cited by: More
Suspicion scoring of networked entities based on.. - Collective Inference And
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.5: Hancock: A Language for Extracting Signatures from.. - Cortes, Fisher.. (2000)
(Correct)
0.2: Squashing Flat Files Flatter - DuMouchel, Volinsky, Johnson.. (1999)
(Correct)
0.1: Sampling From a Moving Window Over Streaming Data - Babcock, Datar, Motwani
(Correct)
BibTeX entry: (Update)
@article{ cortes01communities,
author = "Corinna Cortes and Daryl Pregibon and Chris Volinsky",
title = "Communities of Interest",
journal = "Lecture Notes in Computer Science",
volume = "2189",
pages = "105--??",
year = "2001",
url = "citeseer.ist.psu.edu/cortes01communities.html" }
Citations not processed or no citations identified.
Documents on the same site (http://www.research.att.com/~volinsky/pubs.html): More
Accounting for Model Uncertainty in Survival Analysis Improves.. - Raftery (1995)
(Correct)
Bayesian Information Criterion for Censored Survival Models - Volinsky, Raftery (1999)
(Correct)
Bayesian Model Averaging in Proportional Hazard Models: .. - Volinsky, Madigan.. (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC