Take the 2-minute tour ×
Mathematica Stack Exchange is a question and answer site for users of Mathematica. It's 100% free, no registration required.

I have a fairly large graph (50-60 vertices) with directed, weighted edges, and I am attempting to cluster the vertices. Prior to this, I have only worked with undirected graphs having symmetric adjacency matrices, and I am struggling to figure out an effective means of clustering for the asymmetric case. It seems like the "SingularValueDecomposition" command may be helpful, but I have no experience with this process, and I'm struggling to find an adequate tutorial online. If anyone knows of such a tutorial (or has suggestions for another means of clustering), I would appreciate the help.

share|improve this question
add comment

1 Answer

Here's a tutorial on using the SVD to do clustering...

http://meyer.math.ncsu.edu/Meyer/Talks/ClusteringMonopoli_9_11_07.pdf

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.