Open macks22 opened 9 years ago
See Rattigan et al. for a description of the algorithm. This is essentially an extension of k-medoids to the graph domain. Use nodes as data points and the shortest path distance as the distance between data points.
Actually the paper to look at is this one.
See Rattigan et al. for a description of the algorithm. This is essentially an extension of k-medoids to the graph domain. Use nodes as data points and the shortest path distance as the distance between data points.