118 citations · 440 across the 36 of their papers we have counts for
3 papers · 1 filter
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…
Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability
Heather Patsolic, Sancar Adali, Joshua T. Vogelstein +4
We present a novel approximate graph matching algorithm that incorporates seeded data into the graph matching paradigm. Our Joint Optimization of Fidelity and Commensurability (JOF…