Prediction and ranking algorithms for event-based network data

Event-based network data consists of sets of events over time, each of which may involve multiple entities. Examples include email traffic, telephone calls, and research publications (interpreted as co-authorship events). Traditional network analysis techniques, such as social network models, often aggregate the relational information from each event into a single static network. In contrast, in this paper we focus on the temporal nature of such data. In particular, we look at the problems of temporal link prediction and node ranking, and describe new methods that illustrate opportunities for data mining and machine learning techniques in this context. Experimental results are discussed for a large set of co-authorship events measured over multiple years, and a large corporate email data set spanning 21 months.

[1]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[2]  Lada A. Adamic,et al.  Friends and neighbors on the Web , 2003, Soc. Networks.

[3]  Thomas L. Griffiths,et al.  Probabilistic author-topic models for information discovery , 2004, KDD.

[4]  G. Schwarz.  Estimating the Dimension of a Model , 1978 .

[5]  J. Seeley.  The net of reciprocal influence; a problem in treating sociometric data. , 1949 .

[6]  Ben Taskar,et al.  Link Prediction in Relational Data , 2003, NIPS.

[7]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[8]  S. Wasserman,et al.  Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp , 1996 .

[9]  Peter D. Hoff.  Random Effects Models for Network Data , 2003 .

[10]  T. Snijders.  Accounting for degree distributions in empirical analysis of network dynamics , 2003 .

[11]  D. Lauffenburger,et al.  Network inference , 2005 .

[12]  J. Besag.  Spatial Interaction and the Statistical Analysis of Lattice Systems , 1974 .

[13]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[14]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[15]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[16]  C. Lee Giles,et al.  Digital Libraries and Autonomous Citation Indexing , 1999, Computer.

[17]  M. Newman.  Clustering and preferential attachment in growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Lyle H. Ungar,et al.  Statistical Relational Learning for Link Prediction , 2003 .

[19]  Daryl Pregibon,et al.  Giga-Mining , 1998, KDD.

[20]  Carter T. Butts,et al.  Network inference, error, and informant (in)accuracy: a Bayesian approach , 2003, Soc. Networks.

[21]  Padhraic Smyth,et al.  EventRank: a framework for ranking time-varying networks , 2005, LinkKDD '05.

[22]  S. Wasserman,et al.  Models and Methods in Social Network Analysis , 2005 .

[23]  Peter D. Hoff,et al.  Latent Space Approaches to Social Network Analysis , 2002 .