On 12/05/2016 08:51 AM, Raphael C wrote:
And...
[1] Stijn van Dongen. Graph Clustering by Flow Simulation. PhD
thesis, University of Utrecht, May 2000.
http://www.library.uu.nl/digiarchief/dip/diss/1895620/inhoud.htm
has
1201 citations.
I think it's fair to say the method is very widely known and used.
Ok cool.
I haven't looked at it, my question is now whether this is more of a
"graph clustering"
or a "data clustering" approach, though that distinction is not very clear.
Some of the papers compare it against affinity propagation, which we do
have implemented.
If this algorithm makes sense for knn graphs or similar methods we
implemented in SpectralClustering,
then I guess go for it?
_______________________________________________
scikit-learn mailing list
[email protected]
https://mail.python.org/mailman/listinfo/scikit-learn
