1 citations · 1 across the 3 of their papers we have counts for
5 papers
Techniques for clustering interaction data as a collection of graphs
Nam H. Lee, Carey Priebe, Youngser Park +2
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 (ban…
Automatic Dimension Selection for a Non-negative Factorization Approach to Clustering Multiple Random Graphs
Nam H. Lee, I-Jeng Wang, Youngser Park +2
We consider a problem of grouping multiple graphs into several clusters using singular value thesholding and non-negative factorization. We derive a model selection information cri…
A model selection approach for clustering a multinomial sequence with non-negative factorization
Nam H. Lee, Runze Tang, Carey E. Priebe +1
We consider a problem of clustering a sequence of multinomial observations by way of a model selection criterion. We propose a form of a penalty term for the model selection proced…
On latent position inference from doubly stochastic messaging activities
Nam H. Lee, Jordan Yoder, Minh Tang +1
We model messaging activities as a hierarchical doubly stochastic point process with three main levels, and develop an iterative algorithm for inferring actors' relative latent pos…
State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
W. N. Kang, F. P. Kelly, N. H. Lee +1
We consider a connection-level model of Internet congestion control, introduced by Massoulié and Roberts [Telecommunication Systems 15 (2000) 185--201], that represents the randoml…