<?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/"
		>
<channel>
	<title>Comments on: A first stab at a perl script to create Twitter friend/follow matrices</title>
	<atom:link href="http://mediaczar.com/blog/2009/07/a-first-stab-at-a-perl-script-to-create-twitter-friendfollow-matrices/feed/" rel="self" type="application/rss+xml" />
	<link>http://mediaczar.com/blog/2009/07/a-first-stab-at-a-perl-script-to-create-twitter-friendfollow-matrices/</link>
	<description>a blog by mat morrison</description>
	<lastBuildDate>Thu, 29 Jul 2010 09:25:48 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Tony Hirst</title>
		<link>http://mediaczar.com/blog/2009/07/a-first-stab-at-a-perl-script-to-create-twitter-friendfollow-matrices/comment-page-1/#comment-4578</link>
		<dc:creator>Tony Hirst</dc:creator>
		<pubDate>Thu, 16 Jul 2009 12:10:22 +0000</pubDate>
		<guid isPermaLink="false">http://mediaczar.com/blog/?p=988#comment-4578</guid>
		<description>Arghh:

((m-1)^2)+m-1)/2 GT 2m,
so:
m GT 5

Requires hybrid code your end though, which complicates matters?

But as a heuristic I think it works?! ;-)</description>
		<content:encoded><![CDATA[<p>Arghh:</p>
<p>((m-1)^2)+m-1)/2 GT 2m,<br />
so:<br />
m GT 5</p>
<p>Requires hybrid code your end though, which complicates matters?</p>
<p>But as a heuristic I think it works?! <img src='http://mediaczar.com/blog/wp-includes/images/smilies/icon_wink.gif' alt=';-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tony Hirst</title>
		<link>http://mediaczar.com/blog/2009/07/a-first-stab-at-a-perl-script-to-create-twitter-friendfollow-matrices/comment-page-1/#comment-4577</link>
		<dc:creator>Tony Hirst</dc:creator>
		<pubDate>Thu, 16 Jul 2009 12:05:59 +0000</pubDate>
		<guid isPermaLink="false">http://mediaczar.com/blog/?p=988#comment-4577</guid>
		<description>To save API calls, if you suspect that certain groups of people in the network are highly interconnected, (ie they each follow and are followed by each other), can you get a saving by pulling the friends and follows lists for those people, and processing the connections yourself, rather than making API calls to check each connection between them?

SO if m people are interconnected, and they aren&#039;t followd by so many people that you need to do more than eg 2*M API calls to get the lists, you have a saving if:

2m 5?</description>
		<content:encoded><![CDATA[<p>To save API calls, if you suspect that certain groups of people in the network are highly interconnected, (ie they each follow and are followed by each other), can you get a saving by pulling the friends and follows lists for those people, and processing the connections yourself, rather than making API calls to check each connection between them?</p>
<p>SO if m people are interconnected, and they aren&#8217;t followd by so many people that you need to do more than eg 2*M API calls to get the lists, you have a saving if:</p>
<p>2m 5?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mat Morrison</title>
		<link>http://mediaczar.com/blog/2009/07/a-first-stab-at-a-perl-script-to-create-twitter-friendfollow-matrices/comment-page-1/#comment-4576</link>
		<dc:creator>Mat Morrison</dc:creator>
		<pubDate>Thu, 16 Jul 2009 06:49:51 +0000</pubDate>
		<guid isPermaLink="false">http://mediaczar.com/blog/?p=988#comment-4576</guid>
		<description>Tony -- see above. If &lt;em&gt;only&lt;/em&gt; it was a matter of N calls. Instead it&#039;s 10 calls for everyone who has more than 900 friends. 

For small value networks (like - say - the network of &lt;a href=&quot;http://mediaczar.com/blog/2009/01/map-of-porter-novelli-people-on-twitter-on-20th-jan-2008/&quot; rel=&quot;nofollow&quot;&gt;Porter Novelli&lt;/a&gt; twitter users I did back in January) this is quite feasible. But given my interest in &quot;influence&quot; networks, my research tends to gravitate towards people with lots of followers, which makes the original method really wasteful for most exercises.

As it happens, writing this post cleared my mind, and I&#039;ve now fixed the script in accordance w/ the &#039;Where next?&#039; notes.

I&#039;d never seen either 4store or NetworkX before - thanks! Fascinating. Must have a play with them...</description>
		<content:encoded><![CDATA[<p>Tony &#8212; see above. If <em>only</em> it was a matter of N calls. Instead it&#8217;s 10 calls for everyone who has more than 900 friends. </p>
<p>For small value networks (like &#8211; say &#8211; the network of <a href="http://mediaczar.com/blog/2009/01/map-of-porter-novelli-people-on-twitter-on-20th-jan-2008/" rel="nofollow">Porter Novelli</a> twitter users I did back in January) this is quite feasible. But given my interest in &#8220;influence&#8221; networks, my research tends to gravitate towards people with lots of followers, which makes the original method really wasteful for most exercises.</p>
<p>As it happens, writing this post cleared my mind, and I&#8217;ve now fixed the script in accordance w/ the &#8216;Where next?&#8217; notes.</p>
<p>I&#8217;d never seen either 4store or NetworkX before &#8211; thanks! Fascinating. Must have a play with them&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mat Morrison</title>
		<link>http://mediaczar.com/blog/2009/07/a-first-stab-at-a-perl-script-to-create-twitter-friendfollow-matrices/comment-page-1/#comment-4575</link>
		<dc:creator>Mat Morrison</dc:creator>
		<pubDate>Thu, 16 Jul 2009 06:36:46 +0000</pubDate>
		<guid isPermaLink="false">http://mediaczar.com/blog/?p=988#comment-4575</guid>
		<description>Damon -- the TweepDiff thing is interesting, but it doesn&#039;t do what I need!

I&#039;ve already got tools to dig into people&#039;s publicly-listed friend networks. As you know, when you send Twitter an API request to do this:

a) it must be authenticated
b) you receive up to 100 results per call
c) authenticated API calls are restricted to 100 per hour.

Let&#039;s say that I have in my list 69 people (#UK MPs currently on Twitter) who mostly have over 900 friends (and some of whom have over 9,000) -- I can use up my authenticated calls really very quickly. 

It&#039;s &lt;em&gt;great&lt;/em&gt; getting all that data. But when all I&#039;m looking for is directed relationships between that set of 69, it makes more sense to use the friendships/show method.

Once I have the matrix, it&#039;s pretty easy to drop it into SNA tools like UCINet and do fun network analysis stuff. TweepDiff -- with its A/B comparisons -- isn&#039;t up to games like this.</description>
		<content:encoded><![CDATA[<p>Damon &#8212; the TweepDiff thing is interesting, but it doesn&#8217;t do what I need!</p>
<p>I&#8217;ve already got tools to dig into people&#8217;s publicly-listed friend networks. As you know, when you send Twitter an API request to do this:</p>
<p>a) it must be authenticated<br />
b) you receive up to 100 results per call<br />
c) authenticated API calls are restricted to 100 per hour.</p>
<p>Let&#8217;s say that I have in my list 69 people (#UK MPs currently on Twitter) who mostly have over 900 friends (and some of whom have over 9,000) &#8212; I can use up my authenticated calls really very quickly. </p>
<p>It&#8217;s <em>great</em> getting all that data. But when all I&#8217;m looking for is directed relationships between that set of 69, it makes more sense to use the friendships/show method.</p>
<p>Once I have the matrix, it&#8217;s pretty easy to drop it into SNA tools like UCINet and do fun network analysis stuff. TweepDiff &#8212; with its A/B comparisons &#8212; isn&#8217;t up to games like this.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tony Hirst</title>
		<link>http://mediaczar.com/blog/2009/07/a-first-stab-at-a-perl-script-to-create-twitter-friendfollow-matrices/comment-page-1/#comment-4572</link>
		<dc:creator>Tony Hirst</dc:creator>
		<pubDate>Tue, 14 Jul 2009 21:31:35 +0000</pubDate>
		<guid isPermaLink="false">http://mediaczar.com/blog/?p=988#comment-4572</guid>
		<description>In your original algo, for a list with N names you only make at most N API calls?

&quot;- make a list of the people who I’m interested in researching [N people]
-for each person on that list, grab the list of all the Twitter people whom they follow&quot;

How about you make those N calls, but rather than process the relationships yourself the hard way, just turn all the X is a friend of Y relationships into triples, and upload them to something like 4store [http://4store.org/] or a graph app like NetworkX [http://networkx.lanl.gov/ ] and then run your queries on those graph native representations?

(I have no idea if this will work - it&#039;s something that&#039;s on my to do list as a &#039;maybe try this?&#039; hunch)</description>
		<content:encoded><![CDATA[<p>In your original algo, for a list with N names you only make at most N API calls?</p>
<p>&#8220;- make a list of the people who I’m interested in researching [N people]<br />
-for each person on that list, grab the list of all the Twitter people whom they follow&#8221;</p>
<p>How about you make those N calls, but rather than process the relationships yourself the hard way, just turn all the X is a friend of Y relationships into triples, and upload them to something like 4store [http://4store.org/] or a graph app like NetworkX [http://networkx.lanl.gov/ ] and then run your queries on those graph native representations?</p>
<p>(I have no idea if this will work &#8211; it&#8217;s something that&#8217;s on my to do list as a &#8216;maybe try this?&#8217; hunch)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Damon Clinkscales</title>
		<link>http://mediaczar.com/blog/2009/07/a-first-stab-at-a-perl-script-to-create-twitter-friendfollow-matrices/comment-page-1/#comment-4570</link>
		<dc:creator>Damon Clinkscales</dc:creator>
		<pubDate>Tue, 14 Jul 2009 17:59:18 +0000</pubDate>
		<guid isPermaLink="false">http://mediaczar.com/blog/?p=988#comment-4570</guid>
		<description>Hey Mat

Glad you like DoesFollow.  Have you checked out http://tweepdiff.com ?  It allows you to easily compare followers versus from friends for two accounts.  It also has a screen that allows you to do multiple at one time.  It was created by Brian Deterling (a software developer here in Austin).  It may be exactly what you need.</description>
		<content:encoded><![CDATA[<p>Hey Mat</p>
<p>Glad you like DoesFollow.  Have you checked out <a href="http://tweepdiff.com" rel="nofollow">http://tweepdiff.com</a> ?  It allows you to easily compare followers versus from friends for two accounts.  It also has a screen that allows you to do multiple at one time.  It was created by Brian Deterling (a software developer here in Austin).  It may be exactly what you need.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
