31 citations · 48 across the 11 of their papers we have counts for
Showing cs.SIShow all
3 papers · 1 filter
cs.SI2020
Fast and Accurate Anomaly Detection in Dynamic Graphs with a Two-Pronged Approach
Minji Yoon, Bryan Hooi, Kijung Shin +1
Given a dynamic graph stream, how can we detect the sudden appearance of anomalous patterns, such as link spam, follower boosting, or denial of service attacks? Additionally, can w…
cs.SI2017★ 4 cited
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…
cs.SI2017★ 1 cited
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…