43 citations · 139 across the 21 of their papers we have counts for
21 papers
Accurate Node Feature Estimation with Structured Variational Graph Autoencoder
Jaemin Yoo, Hyunsik Jeon, Jinhong Jung +1
Given a graph with partial observations of node features, how can we estimate the missing features accurately? Feature estimation is a crucial problem for analyzing real-world grap…
DPar2: Fast and Scalable PARAFAC2 Decomposition for Irregular Dense Tensors
Jun-Gi Jang, U Kang
Given an irregular dense tensor, how can we efficiently analyze it? An irregular tensor is a collection of matrices whose columns have the same size and rows have different sizes f…
Signed Graph Diffusion Network
Jinhong Jung, Jaemin Yoo, U Kang
Given a signed social graph, how can we learn appropriate node representations to infer the signs of missing edges? Signed social graphs have received considerable attention to mod…
Finding Key Structures in MMORPG Graph with Hierarchical Graph Summarization
Jun-Gi Jang, Chaeheum Park, Changwon Jang +2
What are the key structures existing in a large real-world MMORPG (Massively Multiplayer Online Role-Playing Game) graph? How can we compactly summarize an MMORPG graph with hierar…
T-GAP: Learning to Walk across Time for Temporal Knowledge Graph Completion
Jaehun Jung, Jinhong Jung, U Kang
Temporal knowledge graphs (TKGs) inherently reflect the transient nature of real-world knowledge, as opposed to static knowledge graphs. Naturally, automatic TKG completion has dra…
Time-Aware Tensor Decomposition for Missing Entry Prediction
Dawon Ahn, Jun-Gi Jang, U Kang
Given a time-evolving tensor with missing entries, how can we effectively factorize it for precisely predicting the missing entries? Tensor factorization has been extensively utili…