I just heard a lecture on fuzzy clustering (fuzzy k-means, autoclass, LSA, PLSA), and I’m wondering whether these techniques can also be applied to graph clustering – finding clusters of a graph and calculating the probability that a given node belongs to the different clusters. This will need some more thinking and research.
No comments yet.
Leave a comment
Sorry, the comment form is closed at this time.