activity
20172022
most citedScalable Tucker Factorization for Sparse Tensors - Algorithms and Discoveries

43 citations · 139 across the 21 of their papers we have counts for

collaborators
Showing 2020Show all

7 papers · 1 filter

cs.LG2020★ 11 cited

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…

cs.SI2020

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…

cs.LG2020★ 10 cited

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…

cs.LG2020

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…

cs.AI2020★ 7 cited

AUBER: Automated BERT Regularization

Hyun Dong Lee, Seongmin Lee, U Kang

How can we effectively regularize BERT? Although BERT proves its effectiveness in various downstream natural language processing tasks, it often overfits when there are only a smal…

cs.LG2020

Ensemble Multi-Source Domain Adaptation with Pseudolabels

Seongmin Lee, Hyunsik Jeon, U Kang

Given multiple source datasets with labels, how can we train a target model with no labeled data? Multi-source domain adaptation (MSDA) aims to train a model using multiple source…