Displaying 1 result from an estimated 1 matches for "ihighly".
Did you mean:
highly
2009 Mar 05
0
Undirected to Directed Graph ( Clustering Based on Link Strength)
...together and out of which 3
nodes in the 5 nodes have seperately published 10 papers.The link strength
between the 3 nodes would be greater than the 5 nodes combined together and
3 nodes should be clustered.
My understanding is Adjacency matrix or Dissimilarity Matrix would not let
me cluster the ihighly interconnected node.
When I went through nabble R Archive and I found many message but I do not
think there was any message in regard to this.
I did find one Article by I have attached in this mail.
Co-authorship networks in the digital library research community
Xiaoming Liu ,*, Johan Bolle...