Seminar Abstract

Adrian E. Raftery

Fast Inference for Model-Based Clustering of Networks Using an
Approximate Case-Control Likelihood

Time: 12:30 pm on Wednesday, February 8, 2012
Place: Savery 409

The model-based clustering latent space network model represents relational data visually and takes account of several basic network properties. Due to the structure of its likelihood function, the computational cost is of order O(N^2), where N is the number of nodes. This makes it infeasible for large networks. We propose an approximation of the log likelihood function. We adapt the case-control idea from epidemiology and construct an approximate case-control log likelihood which is an unbiased estimator of the full log likelihood. Replacing the full likelihood by the case-control likelihood in the MCMC estimation of the latent space model reduces the computational time from O(N^2) to O(N), making it feasible for large networks. We evaluate its performance using simulated and real data. We fit the model to a large protein-protein interaction data using the case-control likelihood and use the model fitted link probabilities to identify false positive links. This is joint with with Xiaoyue Niu, Peter Hoff and Ka Yee Yeung.


To request disability accommodations, contact the Office of the ADA Coordinator ten days in advance of the event. 543-6450 (voice) 685-3885 (FAX) 543-6452 (TDD) access@u.washington.edu