12 citations · 40 across the 6 of their papers we have counts for
6 papers
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…
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…
Fast and Accurate Pseudoinverse with Sparse Matrix Reordering and Incremental Approach
Jinhong Jung, Lee Sael
How can we compute the pseudoinverse of a sparse feature matrix efficiently and accurately for solving optimization problems? A pseudoinverse is a generalization of a matrix invers…
Supervised and Extended Restart in Random Walks for Ranking and Link Prediction in Networks
Woojeong Jin, Jinhong Jung, U Kang
Given a real-world graph, how can we measure relevance scores for ranking and link prediction? Random walk with restart (RWR) provides an excellent measure for this and has been ap…
A Comparative Study of Matrix Factorization and Random Walk with Restart in Recommender Systems
Haekyu Park, Jinhong Jung, U Kang
Between matrix factorization or Random Walk with Restart (RWR), which method works better for recommender systems? Which method handles explicit or implicit feedback data better? D…
TPA: Fast, Scalable, and Accurate Method for Approximate Random Walk with Restart on Billion Scale Graphs
Minji Yoon, Jinhong Jung, U Kang
Given a large graph, how can we determine similarity between nodes in a fast and accurate way? Random walk with restart (RWR) is a popular measure for this purpose and has been exp…