I have a bipartite graph and I want to partition each of the two sets of nodes (I don't know the technical term for these sets I mean each part of the bipartite graph) separately.
Each node hase a multidimensional location (x1, x2, x3, xn) as well I want to consider the edges on this graph in the clustering (if two nodes have the same distance in X from a third node the one that shares more connections to the nods connecting to third node is nearer to the third node).
Is there a method that is most appropriate to this situation. I have done lots of different clustering methods on points located in a continuous space but I can't see how I might apply similar methods to this.
Any comments appreciated.
Thanks in advance.