no code implementations • 24 Jun 2014 • Nam H. Lee, I-Jeng Wang, Youngser Park, Care E. Priebe, Michael Rosen
We consider a problem of grouping multiple graphs into several clusters using singular value thesholding and non-negative factorization.
no code implementations • 24 Jun 2014 • Nam H. Lee, Carey Priebe, Youngser Park, I-Jeng Wang, Michael Rosen
A natural approach to analyze interaction data of form "what-connects-to-what-when" is to create a time-series (or rather a sequence) of graphs through temporal discretization (bandwidth selection) and spatial discretization (vertex contraction).
no code implementations • 29 Dec 2013 • Nam H. Lee, Runze Tang, Carey E. Priebe, Michael Rosen
We consider a problem of clustering a sequence of multinomial observations by way of a model selection criterion.
no code implementations • 26 May 2012 • Nam H. Lee, Jordan Yoder, Minh Tang, Carey E. Priebe
Each of the message-exchanging actors is modeled as a process in a latent space.