Analyzing Disturbed Di usion on Networks


This work provides the rst detailed investigation of the disturbed di usion scheme FOS/C introduced in [17] as a type of di usion distance measure within a graph partitioning framework related to Lloyd's k-means algorithm [14]. After outlining connections to distance measures proposed in machine learning, we show that FOS/C can be related to random walks… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics