43 citations · 139 across the 21 of their papers we have counts for
8 papers · 1 filter
Fast and Accurate Random Walk with Restart on Dynamic Graphs with Guarantees
Minji Yoon, Woojeong Jin, U Kang
Given a time-evolving graph, how can we track similarity between nodes in a fast and accurate way, with theoretical guarantees on the convergence and the error? Random Walk with Re…
UniWalk: Explainable and Accurate Recommendation for Rating and Network Data
Haekyu Park, Hyunsik Jeon, Junghwan Kim +2
How can we leverage social network data and observed ratings to correctly recommend proper items and provide a persuasive explanation for the recommendations? Many online services…
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…
Scalable Tucker Factorization for Sparse Tensors - Algorithms and Discoveries
Sejoon Oh, Namyong Park, Lee Sael +1
Given sparse multi-dimensional data (e.g., (user, movie, time; rating) for movie recommendations), how can we discover latent concepts/relations and predict missing values? Tucker…
PMV: Pre-partitioned Generalized Matrix-Vector Multiplication for Scalable Graph Mining
Chiwan Park, Ha-Myung Park, Minji Yoon +1
How can we analyze enormous networks including the Web and social networks which have hundreds of billions of nodes and edges? Network analyses have been conducted by various graph…
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…