no code implementations • 21 May 2024 • Cencheng Shen, Jonathan Larson, Ha Trinh, Carey E. Priebe
We provide the theoretical rationale for the refinement procedure, demonstrating how and why our proposed method can effectively identify useful hidden communities via stochastic block models, and how the refinement method leads to improved vertex embedding and better decision boundaries for subsequent vertex classification.
no code implementations • 24 Apr 2024 • Darren Edge, Ha Trinh, Newman Cheng, Joshua Bradley, Alex Chao, Apurva Mody, Steven Truitt, Jonathan Larson
To combine the strengths of these contrasting methods, we propose a Graph RAG approach to question answering over private text corpora that scales with both the generality of user questions and the quantity of source text to be indexed.
1 code implementation • 3 May 2023 • Cencheng Shen, Jonathan Larson, Ha Trinh, Xihan Qin, Youngser Park, Carey E. Priebe
Analyzing large-scale time-series network data, such as social media and email communications, poses a significant challenge in understanding social dynamics, detecting anomalies, and predicting trends.
1 code implementation • 31 Mar 2023 • Cencheng Shen, Carey E. Priebe, Jonathan Larson, Ha Trinh
In this paper, we introduce a novel approach called graph fusion embedding, designed for multi-graph embedding with shared vertex sets.