<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Article: Clustering in Weighted Networks</title>
	<atom:link href="http://toreopsahl.com/2009/04/03/article-clustering-in-weighted-networks/feed/" rel="self" type="application/rss+xml" />
	<link>http://toreopsahl.com/2009/04/03/article-clustering-in-weighted-networks/</link>
	<description>bouncing ideas</description>
	<lastBuildDate>Tue, 24 Jan 2012 16:14:54 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/04/03/article-clustering-in-weighted-networks/#comment-1821</link>
		<dc:creator><![CDATA[Tore Opsahl]]></dc:creator>
		<pubDate>Thu, 16 Jun 2011 22:06:21 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=662#comment-1821</guid>
		<description><![CDATA[Hi,

It is meant to test the level of clustering in a network.  Have a look at Newman and Girvan&#039;s paper where they propose the edge betweenness method, and defined a quality measure, Q. Also you can look at Krackhardt&#039;s work on ties inside versus ties outside.

Best,
Tore]]></description>
		<content:encoded><![CDATA[<p>Hi,</p>
<p>It is meant to test the level of clustering in a network.  Have a look at Newman and Girvan&#8217;s paper where they propose the edge betweenness method, and defined a quality measure, Q. Also you can look at Krackhardt&#8217;s work on ties inside versus ties outside.</p>
<p>Best,<br />
Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: cookies</title>
		<link>http://toreopsahl.com/2009/04/03/article-clustering-in-weighted-networks/#comment-1812</link>
		<dc:creator><![CDATA[cookies]]></dc:creator>
		<pubDate>Wed, 15 Jun 2011 09:43:05 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=662#comment-1812</guid>
		<description><![CDATA[Hi Tore,
I want to use this method to evaluate clustering quality, I mean I would like to know the quality of clustering results, is it appropriate?]]></description>
		<content:encoded><![CDATA[<p>Hi Tore,<br />
I want to use this method to evaluate clustering quality, I mean I would like to know the quality of clustering results, is it appropriate?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/04/03/article-clustering-in-weighted-networks/#comment-1329</link>
		<dc:creator><![CDATA[Tore Opsahl]]></dc:creator>
		<pubDate>Sat, 19 Mar 2011 17:00:33 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=662#comment-1329</guid>
		<description><![CDATA[NOTE: There are now some C++ functions. So if you run out of memory or analysing large networks, contact me.]]></description>
		<content:encoded><![CDATA[<p>NOTE: There are now some C++ functions. So if you run out of memory or analysing large networks, contact me.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/04/03/article-clustering-in-weighted-networks/#comment-1255</link>
		<dc:creator><![CDATA[Tore Opsahl]]></dc:creator>
		<pubDate>Tue, 04 Jan 2011 12:36:09 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=662#comment-1255</guid>
		<description><![CDATA[Manal,

The clustering measure varies from 0 to 1. In a directed network, this simply imples that no two-path is closed by a third tie from the first to the third node on the path.

Best,
Tore]]></description>
		<content:encoded><![CDATA[<p>Manal,</p>
<p>The clustering measure varies from 0 to 1. In a directed network, this simply imples that no two-path is closed by a third tie from the first to the third node on the path.</p>
<p>Best,<br />
Tore</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Manal Rayess</title>
		<link>http://toreopsahl.com/2009/04/03/article-clustering-in-weighted-networks/#comment-1254</link>
		<dc:creator><![CDATA[Manal Rayess]]></dc:creator>
		<pubDate>Tue, 04 Jan 2011 12:20:36 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=662#comment-1254</guid>
		<description><![CDATA[Hi Tore,
I have a directed NW and clutering_w is giving me 0. As I understood from your paper, you included transitivity in this extended generalized metric.

Any suggestions?]]></description>
		<content:encoded><![CDATA[<p>Hi Tore,<br />
I have a directed NW and clutering_w is giving me 0. As I understood from your paper, you included transitivity in this extended generalized metric.</p>
<p>Any suggestions?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tore Opsahl</title>
		<link>http://toreopsahl.com/2009/04/03/article-clustering-in-weighted-networks/#comment-590</link>
		<dc:creator><![CDATA[Tore Opsahl]]></dc:creator>
		<pubDate>Mon, 30 Nov 2009 19:30:59 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=662#comment-590</guid>
		<description><![CDATA[No, only got the R implementation. Let me know if you programme it.]]></description>
		<content:encoded><![CDATA[<p>No, only got the R implementation. Let me know if you programme it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: James @ IST drexel</title>
		<link>http://toreopsahl.com/2009/04/03/article-clustering-in-weighted-networks/#comment-589</link>
		<dc:creator><![CDATA[James @ IST drexel]]></dc:creator>
		<pubDate>Mon, 30 Nov 2009 18:28:18 +0000</pubDate>
		<guid isPermaLink="false">http://toreopsahl.com/?p=662#comment-589</guid>
		<description><![CDATA[nice work! That is exactly what I am thinking.

Do you have a JAVA version of the algorithm?

Thanks]]></description>
		<content:encoded><![CDATA[<p>nice work! That is exactly what I am thinking.</p>
<p>Do you have a JAVA version of the algorithm?</p>
<p>Thanks</p>
]]></content:encoded>
	</item>
</channel>
</rss>

