Comments on: Component Binning: a network layout improvement in NodeXL v.108 http://www.connectedaction.net/2010/01/14/component-binning-a-network-layout-improvement-in-nodexl-v-108/?utm_source=rss&utm_medium=rss&utm_campaign=component-binning-a-network-layout-improvement-in-nodexl-v-108 Sociology and the Internet, Social Media, and Mobile Social Software Wed, 08 Sep 2010 04:04:01 +0000 hourly 1 http://wordpress.org/?v=3.0.1 By: Daniel Gilbert http://www.connectedaction.net/2010/01/14/component-binning-a-network-layout-improvement-in-nodexl-v-108/comment-page-1/#comment-18739 Daniel Gilbert Mon, 07 Jun 2010 14:32:41 +0000 http://www.connectedaction.net/?p=2195#comment-18739 Found solution to Binning in the Release History - please disregard. Found solution to Binning in the Release History – please disregard.

]]> By: Daniel Gilbert http://www.connectedaction.net/2010/01/14/component-binning-a-network-layout-improvement-in-nodexl-v-108/comment-page-1/#comment-18738 Daniel Gilbert Mon, 07 Jun 2010 13:58:44 +0000 http://www.connectedaction.net/?p=2195#comment-18738 Hi Marc, I have just updated my NodeXL installation and the binning layout seems to have disappeared. Help! I was loving this feature. Thanks, Daniel Hi Marc, I have just updated my NodeXL installation and the binning layout seems to have disappeared. Help! I was loving this feature.
Thanks,
Daniel

]]> By: Ordering smaller components in a graph – a NodeXL feature tip http://www.connectedaction.net/2010/01/14/component-binning-a-network-layout-improvement-in-nodexl-v-108/comment-page-1/#comment-16500 Ordering smaller components in a graph – a NodeXL feature tip Mon, 12 Apr 2010 16:30:39 +0000 http://www.connectedaction.net/?p=2195#comment-16500 [...] the graph and order them in neat rows at the bottom of the canvas.  This feature was mentioned in a previous post, but finding the feature may not be [...] [...] the graph and order them in neat rows at the bottom of the canvas.  This feature was mentioned in a previous post, but finding the feature may not be [...]

]]> By: Matthew Hurst http://www.connectedaction.net/2010/01/14/component-binning-a-network-layout-improvement-in-nodexl-v-108/comment-page-1/#comment-12832 Matthew Hurst Fri, 15 Jan 2010 02:00:26 +0000 http://www.connectedaction.net/?p=2195#comment-12832 I agree, subgraph partitions make a lot of sense. I've used this before in 2 ways: binning as you have, but also hierarchical graph layout in which th graph of components is first laid out then each connected component. Another useful thing to explore is the initial conditions prior to layout. This can get you quite a way to improvement. I agree, subgraph partitions make a lot of sense. I’ve used this before in 2 ways: binning as you have, but also hierarchical graph layout in which th graph of components is first laid out then each connected component.

Another useful thing to explore is the initial conditions prior to layout. This can get you quite a way to improvement.

]]> By: Marc Smith http://www.connectedaction.net/2010/01/14/component-binning-a-network-layout-improvement-in-nodexl-v-108/comment-page-1/#comment-12819 Marc Smith Thu, 14 Jan 2010 18:42:48 +0000 http://www.connectedaction.net/?p=2195#comment-12819 We do not describe such an algorithm, although they are well documented: http://en.wikipedia.org/wiki/Force-based_algorithms This approach is a hybrid: we still run the FR algorithm, we just keep each component in a separate layout space. We do not describe such an algorithm, although they are well documented: http://en.wikipedia.org/wiki/Force-based_algorithms

This approach is a hybrid: we still run the FR algorithm, we just keep each component in a separate layout space.

]]> By: Sergey http://www.connectedaction.net/2010/01/14/component-binning-a-network-layout-improvement-in-nodexl-v-108/comment-page-1/#comment-12817 Sergey Thu, 14 Jan 2010 18:04:59 +0000 http://www.connectedaction.net/?p=2195#comment-12817 Do you describe an algorithm for layout a network with several disconnected components? I think that 'classical' modification of force-directed scheme would produce better results. Do you describe an algorithm for layout a network with several disconnected components?
I think that ‘classical’ modification of force-directed scheme would produce better results.

]]>