<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>The Politics of Systems &#187; network theory</title>
	<atom:link href="http://thepoliticsofsystems.net/category/network-theory/feed/" rel="self" type="application/rss+xml" />
	<link>http://thepoliticsofsystems.net</link>
	<description>Thoughts on Software, Power, and Digital Method</description>
	<lastBuildDate>Thu, 17 May 2012 08:10:54 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
		<item>
		<title>Dénes König on the origins of graph theory</title>
		<link>http://thepoliticsofsystems.net/2012/04/denes-konig-on-the-origins-of-graph-theory/</link>
		<comments>http://thepoliticsofsystems.net/2012/04/denes-konig-on-the-origins-of-graph-theory/#comments</comments>
		<pubDate>Sun, 08 Apr 2012 07:15:55 +0000</pubDate>
		<dc:creator>Bernhard</dc:creator>
				<category><![CDATA[mathematics]]></category>
		<category><![CDATA[network theory]]></category>

		<guid isPermaLink="false">http://thepoliticsofsystems.net/?p=473</guid>
		<description><![CDATA[Last Friday, I received an exciting present in the mail: Dénes König&#8217;s Theorie der endlichen und unendlichen Graphen from 1936, the first textbook on graph theory ever written (thank you Universitätsbibliothek der FU Berlin for not wanting it anymore). When reading the introduction, I stumbled over this beautiful quote: Vielleicht noch mehr als der Berührung]]></description>
			<content:encoded><![CDATA[<p>Last Friday, I received an exciting present in the mail: Dénes König&#8217;s <em>Theorie der endlichen und unendlichen Graphen</em> from 1936, the first textbook on graph theory ever written (thank you Universitätsbibliothek der FU Berlin for not wanting it anymore). When reading the introduction, I stumbled over this beautiful quote:</p>
<blockquote><p>Vielleicht noch mehr als der Berührung der Menschheit mit der Natur verdankt die Graphentheorie der Berührung der Menschen untereinander.</p></blockquote>
<p>Here is my translation, although it does not do justice to the poetry of the German quote (Dativ FTW!):</p>
<blockquote><p>Perhaps even more than to the contact between mankind and nature, graph theory owes to the contact of human beings between each other.</p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://thepoliticsofsystems.net/2012/04/denes-konig-on-the-origins-of-graph-theory/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>1934: the network as hierarchy</title>
		<link>http://thepoliticsofsystems.net/2012/03/1934-the-network-as-a-hierarchy/</link>
		<comments>http://thepoliticsofsystems.net/2012/03/1934-the-network-as-a-hierarchy/#comments</comments>
		<pubDate>Mon, 19 Mar 2012 07:46:16 +0000</pubDate>
		<dc:creator>Bernhard</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[mathematics]]></category>
		<category><![CDATA[network theory]]></category>
		<category><![CDATA[search engines]]></category>
		<category><![CDATA[social networks]]></category>
		<category><![CDATA[software studies]]></category>

		<guid isPermaLink="false">http://thepoliticsofsystems.net/?p=447</guid>
		<description><![CDATA[I am currently writing a paper to submit to the new and very exciting journal computational culture on the use of graph theory to produce &#8220;evaluative metrics&#8221; in contexts like Web search or social networking. One of my core arguments is going to be that the network as descriptive (mathematical) model has never stood in]]></description>
			<content:encoded><![CDATA[<div id="attachment_466" class="wp-caption alignleft" style="width: 221px"><a href="http://thepoliticsofsystems.net/wp-content/uploads/2012/03/moreno_1934_p152.png"><img class=" wp-image-466" title="moreno_1934_p152" src="http://thepoliticsofsystems.net/wp-content/uploads/2012/03/moreno_1934_p152-211x300.png" alt="" width="211" height="300" /></a><p class="wp-caption-text">one of Moreno&#39;s famous sociograms</p></div>
<p>I am currently writing a paper to submit to the new and very exciting journal <a href="http://computationalculture.net/">computational culture</a> on the use of graph theory to produce &#8220;evaluative metrics&#8221; in contexts like Web search or social networking. One of my core arguments is going to be that the network as descriptive (mathematical) model has never stood in opposition to the notion of hierarchy but should rather be seen as a conceptual tool that was used in different fields (e.g. sociometry, psychometry, citation analysis, etc.) over the 20th century to investigate structure and, in particular, to both investigate and establish hierarchy. This finally gave me an excuse to dive into Jacob L. Moreno&#8217;s opus magnum <em>Who Shall Survive? </em>from 1934, which not only founded sociometry but also laid the ground work for social network analysis. This is one of the strangest books I have ever read, not only because the <a href="http://www.scribd.com/doc/82912410/Who-Shall-Survive-J-L-Moreno-1978-879pgs-PSY">edition from 1978</a> reveals the author as a deeply Nietzschean character (&#8220;<em>Actually, I have written two bibles, an old testament and a new testament.</em>&#8220;), but also because the <em>sociogenic therapy</em> Moreno proposes as an approach to the &#8220;German-Jewish conflict&#8221; puts the whole text in a deeply saddening light. But these aspects only deepen the impression that this is a fascinating book, really one of its kind.</p>
<p>Interestingly, Moreno also discovered what we would now call &#8220;power-law dynamics in social networks&#8221;. One of the applications of his &#8220;sociometric test&#8221; &#8211; basically a &#8220;who do you like&#8221; type of questionnaire &#8211; in a small American town named Hudson came to the following result:</p>
<blockquote><p>After the first phase of the sociometric test was given the analysis of the choices revealed that among a population of 435 persons,23 204, or 46.5%, remained unchosen after the 1st choice; 139, or 30%, after the 2d choice; 87, or 20%, after the 3rd choice; 74, or 17%, after the 4th choice; and 66, or 15%, after the 5th choice. (Moreno 1934, p. 249)</p></blockquote>
<div id="attachment_470" class="wp-caption alignleft" style="width: 221px"><a href="http://thepoliticsofsystems.net/wp-content/uploads/2012/03/Screen-Shot-2012-03-20-at-09.54.57-.png"><img class=" wp-image-470 " title="moreno_1934_powerlaw" src="http://thepoliticsofsystems.net/wp-content/uploads/2012/03/Screen-Shot-2012-03-20-at-09.54.57--266x300.png" alt="" width="211" /></a><p class="wp-caption-text">Moreno&#39;s comparison of distributions</p></div>
<p>This means that 15% of the population was not mentioned when the interviewees were asked which five people in the community they liked best. While this does not make for a particularly skewed distribution, Moreno transposes the result on the population of New York city and adds a quite tantalizing interpretation:</p>
<blockquote>
<p style="text-align: left;">There is no question but that this phenomenon repeats itself throughout the nation, however widely the number of unchosen may vary from 1st to 5th or more choices due to the incalculable influence of sexual, racial, and other psychological currents. For New York, with a population of 7,000,000, the above percentages would be after the 1st choice, 3,200,000 individuals unchosen; after the 2nd choice, 2,100,000 unchosen; after the 3rd choice, 1,400,000 unchosen; after the 4th choice, 1,200,000 unchosen; and after the 5th choice, 1,050,000 unchosen. These calculations suggest that mankind is divided not only into races and nations, religions and states, but into socionomic divisions. There is produced a socionomic hierarchy due to the differences in attraction of particular individuals and groups for other particular individuals and groups. (Moreno 1934, p. 250f)</p>
</blockquote>
<p>By looking into the history of the field, I hope to show that the observation of uneven distributions of connectivity in real-world networks, e.g. the work by <a href="http://press.princeton.edu/titles/8781.html">Hindman</a> and others concerning the Web, are certainly not a discovery of the &#8220;<a href="http://research.yahoo.com/files/w_ARS.pdf">new science of networks</a>&#8221; of recent years but a virtual constant in mathematical approaches to networks: whenever somebody starts counting, the result is an ordered list, normally with a considerable difference in value between the first and the last element. When it comes to applications of sociometry to sociology or anthropology, the question of leadership, status, influence, etc. is permanently in the forefront, especially from the 1950s onward when matrix algebra starts to allow for quick calculations of different forms of centrality. Contrary to popular myth, when Page and Brin came up with <em>PageRank</em>, they had a very wide variety of inspirational sources to draw from. Networks and ranking had been an old couple for quite a while already.</p>
]]></content:encoded>
			<wfw:commentRss>http://thepoliticsofsystems.net/2012/03/1934-the-network-as-a-hierarchy/feed/</wfw:commentRss>
		<slash:comments>6</slash:comments>
		</item>
		<item>
		<title>heterogeneous twitter mapping</title>
		<link>http://thepoliticsofsystems.net/2011/07/heterogeneous-twitter-mapping/</link>
		<comments>http://thepoliticsofsystems.net/2011/07/heterogeneous-twitter-mapping/#comments</comments>
		<pubDate>Tue, 12 Jul 2011 08:44:32 +0000</pubDate>
		<dc:creator>Bernhard</dc:creator>
				<category><![CDATA[network theory]]></category>
		<category><![CDATA[social networks]]></category>
		<category><![CDATA[softwareproject]]></category>
		<category><![CDATA[visualization]]></category>
		<category><![CDATA[web 2.0]]></category>

		<guid isPermaLink="false">http://thepoliticsofsystems.net/?p=357</guid>
		<description><![CDATA[When it comes to analyzing and visualizing data as a graph, we most often select only one unit to represent nodes. When working with social networks, nodes commonly represent user accounts. In a recent post, I used Twitter hashtags instead and established links by looking at which hashtags occurred in the same tweets. But it is very much]]></description>
			<content:encoded><![CDATA[<p>When it comes to analyzing and visualizing data as a graph, we most often select only one unit to represent nodes. When working with social networks, nodes commonly represent user accounts. In a <a href="http://thepoliticsofsystems.net/2011/07/08/mapping-french-twitter-themes/">recent post</a>, I used Twitter hashtags instead and established links by looking at which hashtags occurred in the same tweets. But it is very much possible to use different &#8220;ontological&#8221; units in the same graph. Consider this example from the <a href="http://liris.cnrs.fr/ipri/pmwiki/">IPRI project</a> (a click gives you the full map, a 14MB png file):</p>
<p><a href="http://thepoliticsofsystems.net/wp-content/uploads/2011/07/graph_hetero_sizeFreq_colType_min2Deg_openord.png"><img class="alignnone size-full wp-image-358" title="graph_hetero_sizeFreq_colType_min2Deg_openord_small" src="http://thepoliticsofsystems.net/wp-content/uploads/2011/07/graph_hetero_sizeFreq_colType_min2Deg_openord_small.png" alt="" width="580" height="411" /></a></p>
<p>Here, I decided to mix Twitter user accounts with hashtags. To keep things manageable, I took only the accounts we identified as journalists that posted at least 300 tweets between February 15 and April 15 from the 25K accounts we follow. For every one of those accounts, I queried our database for the 10 hashtags most often tweeted by the user. I then filtered the graph to show only hashtags used by at least two users. I was finally left with 512 user accounts (the turquoise nodes, size is number of tweets) and 535 hashtags (the red nodes, size is frequency of use). Link strength represents the frequency with which a user tweeted a hashtag. What we get, is still a thematic map (libya, the regional elections, and japan being the main topics), but this time, we also see, which users were most strongly attached to these topics.</p>
<p>Mapping heterogeneous units opens up many new ways to explore data. The next step I will try to work out is using mentions and retweets to identify not only the level of interest that certain accounts accord to certain topics (which you can see in the map above), but the level of echo that an account produces in relation to a certain topic. We&#8217;ll see how that goes.</p>
<p>In completely unrelated news, I read an interesting <a href="http://techcrunch.com/2011/07/09/scoble-problem-social-networks/">piece</a> by Rocky Agrawal on why he blocked tech blogger Robert Scoble from his Google+ account. At the very end, he mentions a little experiment that delicious.com founder <a href="http://joshua.schachter.org/">Joshua Schachter</a> did a couple of days ago: he asked his 14K followers on Twitter and 1.5K followers on Google+ to respond to a post, getting 30 answers the former and 42 from the latter. Sitting on still largely unexplored bit.ly click data for millions of urls posted on Twitter, I can only confirm that Twitter impact may be overstated by an order of magnitude&#8230;</p>
]]></content:encoded>
			<wfw:commentRss>http://thepoliticsofsystems.net/2011/07/heterogeneous-twitter-mapping/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>mapping wikipedia: going english</title>
		<link>http://thepoliticsofsystems.net/2011/04/mapping-wikipedia-going-english/</link>
		<comments>http://thepoliticsofsystems.net/2011/04/mapping-wikipedia-going-english/#comments</comments>
		<pubDate>Mon, 11 Apr 2011 09:32:43 +0000</pubDate>
		<dc:creator>Bernhard</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[method]]></category>
		<category><![CDATA[network theory]]></category>
		<category><![CDATA[visualization]]></category>

		<guid isPermaLink="false">http://thepoliticsofsystems.net/?p=315</guid>
		<description><![CDATA[After trying to map the French version of Wikipedia a couple of days ago, I&#8217;ve played around with the much bigger English version (the dbpedia file I worked with contains 130M links between Wikipedia pages in a cool 20GB) this week-end and thanks to a rare lucid moment I was able to transform that thing]]></description>
			<content:encoded><![CDATA[<p>After trying to <a href="http://thepoliticsofsystems.net/2011/04/09/mapping-wikipedia-my-god-its-full-of-sports/">map</a> the French version of Wikipedia a couple of days ago, I&#8217;ve played around with the much bigger English version (the dbpedia file I worked with contains 130M links between Wikipedia pages in a cool 20GB) this week-end and thanks to a rare lucid moment I was able to transform that thing into a <a href="http://thepoliticsofsystems.net/wp-content/uploads/2011/04/network_100_page_links_en_1of5.nt.gdf.7z">.gdf</a> that is small enough to be opened in <a href="http://gephi.org">gephi</a>. I settled for the 45K pages with the most links (undirected) and started mapping. All three maps I built use the OpenOrd layout algorithm (1000 iterations). The first uses the modularity measure for &#8220;community&#8221; detection and colors text accordingly (click on the image for a <em>very</em> large version):<br />
<a href="http://thepoliticsofsystems.net/wp-content/uploads/2011/04/wikipedia_map_en_100_text_color.png"><img src="http://thepoliticsofsystems.net/wp-content/uploads/2011/04/wikipedia_map_en_100_text_color_small.png" alt="" /></a></p>
<p>The second uses a grey color scale to express the degree (number of links) of a page:</p>
<p><a href="http://thepoliticsofsystems.net/wp-content/uploads/2011/04/wikipedia_map_en_100_text_grey.png"><img src="http://thepoliticsofsystems.net/wp-content/uploads/2011/04/wikipedia_map_en_100_text_grey_small.png" alt="" /></a></p>
<p>Finally, the same map, but with a different color scale (light blue =&gt; yellow =&gt; red):</p>
<p><a href="http://thepoliticsofsystems.net/wp-content/uploads/2011/04/wikipedia_map_en_100_text_heatmap.png"><img src="http://thepoliticsofsystems.net/wp-content/uploads/2011/04/wikipedia_map_en_100_text_heatmap_small.png" alt="" /></a></p>
<p>Every version helps with certain readability issues and you can download all tree of the maps as a <a href="http://thepoliticsofsystems.net/wp-content/uploads/2011/04/wikipedia_map_en_100_text_layers.psd.7z">big .psd</a> so you can easily switch between the different modes.</p>
<p>When comparing these maps with their <a href="http://thepoliticsofsystems.net/2011/04/09/mapping-wikipedia-my-god-its-full-of-sports/">French counterpart</a>, there are several things than are quite remarkable:</p>
<ul>
<li>Most importantly, there is no cluster that I would qualify as &#8220;common culture&#8221; or &#8220;shared knowledge&#8221;. There is most certainly a large, dense zone at the center but while the French one draws in all kinds of topics, this version has worldwide country information only. I would prudently argue that the English version of Wikipedia shows a more globalized picture of the world, even if there is a large zone of pages on the left that deals with the United States. It&#8217;s a bigger and more heterogeneous world that emerges, but there still is a dominant player.</li>
<li>Sports is even bigger on the English version and typically American sports (Baseball, NASCAR, etc.) show up on the left in smaller, denser clusters compared to the gigantic football (soccer) area on the center to bottom right.</li>
<li>The Sciences are smaller but entertainment (TV, popular music, comic books, video games, etc.) is much more present. At least at this level of observation.</li>
<li>There are some seriously &#8220;strange&#8221; clusters, such as the dense yellow zone on the far right halfway between top and center that shows a group of Russian painters I have never heard of. Not that I&#8217;m an expert but I&#8217;ve found little trace of <em>any</em> other painters. This shows the weakness of my selection method by link degree &#8211; if there was a way to select nodes by page-views, the results would probably be very different, at least for our Russian painters. But it also shows that despite having become a rather respectable Encyclopedia with a quite classic subject outlook, Wikipedia still is a space for off-the-track topics and for communities that are so passionate about a certain subject that they will groom it and grow it.</li>
</ul>
<p>I plan on releasing the scripts used to build these maps in the future but I want to try out a couple more things before that, most particularly a version that only takes into account in-links, which should reduce the presence of certain &#8220;distributor&#8221; pages (&#8220;events in 2010&#8243;,&#8221;people alive&#8221;, etc.).</p>
]]></content:encoded>
			<wfw:commentRss>http://thepoliticsofsystems.net/2011/04/mapping-wikipedia-going-english/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>mapping wikipedia: my god, it&#039;s full of sports</title>
		<link>http://thepoliticsofsystems.net/2011/04/mapping-wikipedia-my-god-its-full-of-sports/</link>
		<comments>http://thepoliticsofsystems.net/2011/04/mapping-wikipedia-my-god-its-full-of-sports/#comments</comments>
		<pubDate>Sat, 09 Apr 2011 11:12:01 +0000</pubDate>
		<dc:creator>Bernhard</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[method]]></category>
		<category><![CDATA[network theory]]></category>
		<category><![CDATA[visualization]]></category>

		<guid isPermaLink="false">http://thepoliticsofsystems.net/?p=302</guid>
		<description><![CDATA[Edit: a map of the English Wikipedia is here. Wikipedia is a fascinating object for way too many reasons. The way it is produced, the place it has taken in society, it&#8217;s size and evolution, and many other aspects are truly remarkable. Studying Wikipedia has become a discipline in itself and while there may be]]></description>
			<content:encoded><![CDATA[<p>Edit: a map of the English Wikipedia is <a href="http://thepoliticsofsystems.net/2011/04/11/mapping-wikipedia-going-english/">here</a>.</p>
<p>Wikipedia is a fascinating object for way too many reasons. The way it is produced, the place it has taken in society, it&#8217;s size and evolution, and many other aspects are truly remarkable. Studying Wikipedia has become a discipline in itself and while there may be certain signs of fatigue on the editing front, there is still much to learn and to discover. I have recently started to take an interest in looking at the way knowledge is structured in different contexts and the availability of certain <a href="https://wiki.digitalmethods.net/Dmi/ToolDatabase?cat=DeviceCentric&amp;subcat=Wikipedia">tools</a> and <a href="http://wiki.dbpedia.org/Downloads36">datasets</a> makes Wikipedia a perfect object for scrutiny. If it just wasn&#8217;t that <em>big</em>. Still, it&#8217;s the 21st century and computers <em>are </em>getting really fast, so why not try mapping Wikipedia. All of it.</p>
<p>There are different ways to start such a project, but simply taking the link structure is probably the most obvious. This allows for bypassing the internal taxonomy and may lead to a more &#8220;organic&#8221; expression of underlying knowledge structures. Unfortunately, computers are not <em>that</em> fast &#8211; at least not mine &#8211; and so I had to make two concessions: I took a non English variant (I settled for French) and reduced the number of nodes to a (barely) manageable amount. The final <a href="http://thepoliticsofsystems.net/wp-content/uploads/2011/04/wp_network_100.gdf.7z">graph file</a> (.gdf &#8211; do not even think about working with it with less than 4GB of RAM) was built by taking pages that had at least 100 connections with other pages. From an initial 183K pages and 11.5M links I went down to a more manageable 40K and 2M respectively. To make things workable, I chose to visualize the page names only, no nodes, no edges. The result looks like this (click on the image for a <em>very</em> big .png):<br />
<a href="http://thepoliticsofsystems.net/wp-content/uploads/2011/04/wikipedia_map_fr_100_text_color.png"><img src="http://thepoliticsofsystems.net/wp-content/uploads/2011/04/wikipedia_map_fr_100_text_color_small.png" alt="" /></a><br />
Reliable <a href="http://gephi.org">gephi</a> did not only do the graph layout (OpenOrd plugin, 1000 iterations) but dutifully detected &#8220;communities&#8221; in the network, which actually did work really well. And here is a version in elegant grayscale, this time without community detection:<br />
<a href="http://thepoliticsofsystems.net/wp-content/uploads/2011/04/wikipedia_map_fr_100_text.png"><img src="http://thepoliticsofsystems.net/wp-content/uploads/2011/04/wikipedia_map_fr_100_text_small.png" alt="" /></a><br />
The graph shows a big dense zone in the middle that is quite unreadable but composed out of world history, politics, geography, and other elements that constitute a core set of knowledge elements that are highly interlinked. While France plays and important role here, these elements are actually very globalized and include countries from all over the world. Could we interpret this as a field of &#8220;common&#8221; or &#8220;shared&#8221; knowledge? A set of topics that transcend specialization and form the very core of what our culture considers essential?</p>
<p>To the close right of the very center, there is a rather visible (in orange) cluster on the United States. Around the center you&#8217;ll find major historic events and periods (WWII, middle ages, renaissance, etc.). The arts are on the right (mostly music) and France&#8217;s most popular art form &#8211; Cinema &#8211; starts at the top right, in a highly dense orange cluster and goes to the top left, tellingly fusing with theatre. The Sciences form a rather strange blue band the goes from the center top to the top right.</p>
<p>And then there is sports. I was a bit surprised by how much of it there is and how well the clustering and community detection works for identifying individual fields &#8211; football, tennis, car racing, and so on. The second surprise was how few &#8220;geek&#8221; subjects appear on the map. There is a digital technology cluster on the top right but I haven&#8217;t found any traces of the legendary Star Trek cluster. In the end, French Wikipedia appears to be a rather classic encyclopedia if you look at it from a subject angle. Could we use such maps to compare subject prominence between cultures?</p>
<p>Obviously, the method for mapping Wikipedia has to be refined to make maps more readable but the results are actually already quite telling. Let&#8217;s see whether the same approach can work for the English version &#8211; which is a cool 10 times bigger&#8230;</p>
]]></content:encoded>
			<wfw:commentRss>http://thepoliticsofsystems.net/2011/04/mapping-wikipedia-my-god-its-full-of-sports/feed/</wfw:commentRss>
		<slash:comments>7</slash:comments>
		</item>
		<item>
		<title>the invisible information giant: Thomson Reuters</title>
		<link>http://thepoliticsofsystems.net/2010/11/the-invisible-information-giant-thomson-reuters/</link>
		<comments>http://thepoliticsofsystems.net/2010/11/the-invisible-information-giant-thomson-reuters/#comments</comments>
		<pubDate>Tue, 02 Nov 2010 09:42:13 +0000</pubDate>
		<dc:creator>Bernhard</dc:creator>
				<category><![CDATA[critique]]></category>
		<category><![CDATA[database]]></category>
		<category><![CDATA[economy]]></category>
		<category><![CDATA[network theory]]></category>
		<category><![CDATA[social networks]]></category>
		<category><![CDATA[surveillance]]></category>

		<guid isPermaLink="false">http://thepoliticsofsystems.net/?p=238</guid>
		<description><![CDATA[When it comes to scrutinizing companies for their actions and policies concerning control over information, privacy issues, and market dominance in areas related to public debate, large media conglomerates have been the traditional objects of analysis. More recently, Internet giants such as Google and Facebook have been critically examined and when the hype levels off,]]></description>
			<content:encoded><![CDATA[<p>When it comes to scrutinizing companies for their actions and policies concerning control over information, privacy issues, and market dominance in areas related to public debate, large media conglomerates have been the traditional objects of analysis. More recently, Internet giants such as Google and Facebook have been critically examined and when the hype levels off, Twitter will probably be the next on the list. Malcolm Gladwell&#8217;s recent <a href="http://www.newyorker.com/reporting/2010/10/04/101004fa_fact_gladwell?currentPage=all">piece</a> in The New Yorker may very well be an indicator of things to come.</p>
<p>Whether the issues related to &#8220;social media&#8221; are important or not, I have the feeling that the debate overshadows questions and problem fields that may in fact be much more important. The most obvious case, in my view, is the debate on privacy on Facebook. While the matter is not irrelevant, I think that e.g. present and future state-run information systems such as the french <a href="http://fr.wikipedia.org/wiki/Exploitation_documentaire_et_valorisation_de_l'information_g%C3%A9n%C3%A9rale">EDVIGE</a>, a central police database that assembles all kinds of personal information concerning select persons &#8220;of interest&#8221;, have been overshadowed by debate on whether your employer can see the pictures that document your drinking binges after somebody (you?) put them on the &#8216;Book. There is a certain disequilibrium in how Internet researchers and critics distribute their attention that has allowed all kinds of things to pass below the radar. But there is one event that has really shook me up recently, both because of its importance and the lack of outcry it garnered, at least in my echo chamber: the acquisition of the Reuters group by the Thomson corporation in 2008 and the creation of Thomson Reuters, an information giant second to none.</p>
<div id="attachment_242" class="wp-caption alignleft" style="width: 167px"><a href="http://thepoliticsofsystems.net/wp-content/uploads/2010/11/thomson_reuters_divisions.png"><img class="size-medium wp-image-242 " title="thomson_reuters_divisions" src="http://thepoliticsofsystems.net/wp-content/uploads/2010/11/thomson_reuters_divisions-157x300.png" alt="Thomson Reuters market divisions" width="157" height="300" /></a><p class="wp-caption-text">Thomson Reuters market divisions</p></div>
<p>I have stumbled upon Thomson Reuters a couple of times over the last years: first, when I researched the history of citation indexing, I learned that Thomson Scientific had bought the Institute of Scientific Information (and their <a href="http://thomsonreuters.com/products_services/science/science_products/a-z/web_of_science">Web of Science</a> citation index megabase from which things like the notorious Impact Factor are calculated) in 1992; then again when I noticed that the ClearForest API for term extraction had be renamed, remodeled, and rebranded as <a href="http://www.opencalais.com/">OpenCalais</a> after Reuters bought the company in 2007; finally, last year, when I noticed that the Reuters <a href="http://www.reuters.com/news/video?videoChannel=1004">video platform</a> appeared more and more often in articles and links. When I finally started to look a little closer (NYSE:<a href="http://www.google.com/finance?q=NYSE:TRI">TRI</a>) I was astounded to find a company with a market cap of $31B, annual revenues of $13B, and 55K+ employees all over the world. Yes, this is no Apple big, but still very, very big for a company that sells information.</p>
<p>I knew Reuters from my studies in communication science as the world&#8217;s biggest news agency (with roughly one and a half competitors: Associated Press and Agence France Presse) but I had never consciously registered the Thomson company &#8211; a Canadian Family business that went from the media (owning the London Times at one point) to publishing before transforming itself in a rather risky move into a digital information broker for all kinds of special fields (legal, health, finance, etc.). Reuters was a perfect match and I really wonder how that merger went through without too much hassle from the different regulatory bodies. Even more so when I found out that Reuters actually had devised a very spicy regulatory clause when it made its IPO in 1984: to avoid control over such a central source of information, no  single shareholder would be allowed to hold more than 15% of the companies stocks. Apparently, that clause was enacted at least once when Murdoch&#8217;s News Corporation (already holding 15%) bought a competitor that also owned a piece of Reuters and consequently had to shed stock to stay below the threshold. The merger effectively brought the new Reuters Thomson under full control (53%) of The Woodbridge Company, a private holding that represents the Thomson family.</p>
<p>Such control over a news agency (and the many more specialized services that are part of the giant&#8217;s portfolio) should give us pause in the best of times when media companies are swimming in resources, are able to pay good money for good journalism, and keep their own network of correspondents. But recent years have seen nothing but cost cutting in journalism, which has led to an even greater reliance on news agencies. I wager that Google News would work a lot less well if people actually started to write their own copy instead of remodeling Reuters&#8217; and AP send outs.</p>
<p>But despite these rather traditional &#8211; but nonetheless crucial &#8211; concerns over media ownership and control, there is a second point that is somewhat closer to my area of expertise. I have recently been thinking a lot about how to best phrase criticism of the assumption that digital networks necessarily lead to decentralization. Thomson Reuters &#8211; but also other information giants such as Google and Facebook &#8211; is a great example for how digital technologies can lead to quite impressive cost reductions for economies of scale and, consequently, market concentration. These arguments should be taken into account:</p>
<ul>
<li>While the barriers of entry to the Internet are really low (you can have your own blog in minutes), scaling up to millions of visitors is a real challenge. Building your own datacenter is a real bump in the learning curve and to get over it, you need  to make certain investments. But once you pass that bump, scaling suddenly becomes cheaper again because you have the knowledge ressources and experience that can now be applied to make the datacenter grow. One of Google&#8217;s strengths lies in this area and this immensely facilitates branching out into new information ventures. The same goes for Thomson Reuters: they master platform technology and distribution technologies for all kinds of contents and they can build on that mastery to add new things to serve information to a globalized planet. To use the language of the <a href="http://www.wired.com/wired/archive/12.10/tail.html">long tail</a>: there may be more special interest information that can find an audience with shelve space becoming effectively unlimited; but there is also no longer a need for more than one shelve.</li>
<li>The same goes for a more elusive matter: the mastery of information. The database techniques and indexing tools we use to store information &#8211; as well as the search and data-mining algorithms &#8211; can be very easily transported from one domain to the next. While it may be (very) difficult to create useful search tools for medical information, once you have built them it is rather easy to adapt these tools to, let&#8217;s say the legal domain. Again, this is what makes Google strong: basic search technology can be applied to advertising, books, mail, product prices, and even video if you can do automatic transcription. With the acquisition of ClearForest, Thomson Reuters has class-leading in-house data-mining and this is not something you can get by simply posting a couple of job ads in the local newspaper. Data-mining is extremely useful in areas where fast decision-making is crucial but also when it comes to building powerful search tools. Again, these techniques can be applied to any number of fields and once you have the basics right you can just add new domains with very little cost.</li>
</ul>
<p>These two points go a far way in explaining why the Internet has seen the lightning fast emergence of network giants over the last couple of years. I really don&#8217;t want to postulate yet another &#8220;law&#8221; of the Net but I believe that there is something to this idea of the bump: it&#8217;s easy to have a basic presence on the Web but it&#8217;s hard to scale up to a large audience and to use advanced computational techniques; but one you pass the bump, the economies of scale kick in and from there it seems like there are no barriers to growth. The Thomsons have certainly made that bet when they acquired Reuters and so far, it seems to work out quite nicely for them.</p>
<p>I hope we can find a means to extend critique from questions of ownership into the heart of the (informational) beast and come up with better ways to understand how the still ongoing shift to exclusively digital information affords new means of handling and exploiting that information &#8211; with organizational, economic, and political consequences. While that work is starting to take shape for consumer companies like Google that are in the spotlight, there is surprisingly little on invisible network giants like Thomson Reuters that cater mostly to professional clients.</p>
]]></content:encoded>
			<wfw:commentRss>http://thepoliticsofsystems.net/2010/11/the-invisible-information-giant-thomson-reuters/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>graphs based on word vector similarity and the trickyness of parameters</title>
		<link>http://thepoliticsofsystems.net/2010/10/graphs-based-on-word-vector-similarity-and-the-trickyness-of-parameters/</link>
		<comments>http://thepoliticsofsystems.net/2010/10/graphs-based-on-word-vector-similarity-and-the-trickyness-of-parameters/#comments</comments>
		<pubDate>Sun, 10 Oct 2010 08:38:52 +0000</pubDate>
		<dc:creator>Bernhard</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[epistemolgy]]></category>
		<category><![CDATA[mathematics]]></category>
		<category><![CDATA[network theory]]></category>
		<category><![CDATA[social networks]]></category>
		<category><![CDATA[statistics]]></category>

		<guid isPermaLink="false">http://thepoliticsofsystems.net/?p=197</guid>
		<description><![CDATA[What is a link? From a methodology standpoint, there is no answer to that question but only the recognition that when using graph theory and associated software tools, we project certain aspects of a dataset as nodes and others as links. In my last post, I &#8220;projected&#8221; authors from the air-l list as nodes and]]></description>
			<content:encoded><![CDATA[<p>What is a link? From a methodology standpoint, there is no answer to that question but only the recognition that when using graph theory and associated software tools, we project certain aspects of a dataset as nodes and others as links. In my <a href="http://thepoliticsofsystems.net/2010/10/06/one-network-and-four-algorithms/">last post</a>, I &#8220;projected&#8221; authors from the air-l list as nodes and mail-reply relationships as links. In the example below, I still use authors as nodes but links are derived from a similarity measure of a statistical analysis of each poster&#8217;s mails. Here are two <a href="http://gephi.org/">gephi</a> graphs:</p>
<p><a href="http://thepoliticsofsystems.net/wp-content/uploads/2010/10/airl_vectorspace_graph.png"><img class="alignnone size-full wp-image-199" title="airl_vectorspace_graph_small" src="http://thepoliticsofsystems.net/wp-content/uploads/2010/10/airl_vectorspace_graph_small.png" alt="" width="500" height="276" /></a></p>
<p>If you are interested in the technique, it&#8217;s a simple similarity measure based on the <a href="http://thepoliticsofsystems.net/wp-content/uploads/2010/10/airl_vectorspace_graph.png">vector-space model</a> and my amateur computer scientist&#8217;s PHP implementation can be found <a href="http://code.google.com/p/vectorspacesimilarity/">here</a>. The fact that the two posters who changed their &#8220;from:&#8221; text have both of their accounts close together (can you find them?) is a good indication that the algorithm is not <em>completely</em> botched. The words floating on the links on the right graph are the words that confer the highest value to the similarity calculation, which means that it is a word that is relatively often used by both of the linked authors while being generally rare in the whole corpus. Elis Godard and Dana Boyd for example have both written on air-l about Ron Vietti, a pastor who (rightfully?) thinks the Internet is the devil and because very few other people mentioned the holy warrior, the word &#8220;vietti&#8221; is the highest value &#8220;binder&#8221; between the two.</p>
<p>What is important in networks that are the result of heavily iterative processing is that the algorithms used to create them are full of parameters and changing one of these parameters just little bit may (!) have larger repercussions. In the example above I actually calculate a similarity measure between each two nodes (60^2 / 2 results) but in order to make the graph somewhat readable I inserted a threshold that boils it down to 637 links. The missing measures are not taken into account in the physics simulation that produces the layout &#8211; although they may (!) be significant. I changed the parameter a couple of times to get the graph &#8220;right&#8221;, i.e. to find a good compromise between link density for simulation and readability. But look at what happens when I grow the threshold so than only the 100 strongest similarity measures survive:</p>
<p><a href="http://thepoliticsofsystems.net/wp-content/uploads/2010/10/airl_vectorspace_harsh.png"><img class="alignnone size-full wp-image-209" title="airl_vectorspace_harsh_small" src="http://thepoliticsofsystems.net/wp-content/uploads/2010/10/airl_vectorspace_harsh_small.png" alt="" width="300" height="298" /></a></p>
<p>First, a couple of nodes disconnect, two binary stars form around the &#8220;from:&#8221; changers and the large component becomes a lot looser. Second, Jeremy Hunsinger looses the highest PageRank to Chris Heidelberg. Hunsinger had more links when lower similarity scores were taken into account, but when things get rough in the network world, bonding is better than bridging. What is <em>result</em> and what is <em>artifact</em>?</p>
<p>Most advanced algorithmic techniques are riddled with such parameters and getting a &#8220;good&#8221; result not only implies fiddling around a lot (how do I clean the text corpus, what algorithms to look for what kind of structures or dynamics, what parameters, what type of representation, here again, what parameters, and so on&#8230;) but also having implicit ideas about what kind of result would be &#8220;plausible&#8221;. The back and forth with the &#8220;algorithmic microscope&#8221; is always floating against a backdrop of &#8220;domain knowledge&#8221; and this is one of the reasons why the idea of a science based purely on data analysis is positively absurd. I believe that the key challenge is to stay clear of methodological monoculture and to articulate different approaches together whenever possible.</p>
]]></content:encoded>
			<wfw:commentRss>http://thepoliticsofsystems.net/2010/10/graphs-based-on-word-vector-similarity-and-the-trickyness-of-parameters/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>one network and four algorithms</title>
		<link>http://thepoliticsofsystems.net/2010/10/one-network-and-four-algorithms/</link>
		<comments>http://thepoliticsofsystems.net/2010/10/one-network-and-four-algorithms/#comments</comments>
		<pubDate>Wed, 06 Oct 2010 13:54:26 +0000</pubDate>
		<dc:creator>Bernhard</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[epistemolgy]]></category>
		<category><![CDATA[network theory]]></category>
		<category><![CDATA[social networks]]></category>
		<category><![CDATA[softwareproject]]></category>

		<guid isPermaLink="false">http://thepoliticsofsystems.net/?p=176</guid>
		<description><![CDATA[The Association of Internet Researchers (AOIR) is an important venue if you&#8217;re interested in, like the name indicates, Internet research. But it is also a good primary source if one wants to inquire into how and why people study the Internet, which aspects of it, etc. Conveniently for the lazy empirical researcher that I am,]]></description>
			<content:encoded><![CDATA[<p>The <a href="http://aoir.org">Association of Internet Researchers</a> (AOIR) is an important venue if you&#8217;re interested in, like the name indicates, Internet research. But it is also a good primary source if one wants to inquire into how and why people study the Internet, which aspects of it, etc. Conveniently for the lazy empirical researcher that I am, the AOIR has an <a href="http://listserv.aoir.org/listinfo.cgi/air-l-aoir.org">archive</a> of its mailing-list, which has about 22K mails posted by 3K addresses, enough for a little playing around with the impatient person&#8217;s tool, the algorithm. I have downloaded the data and I hope I can motivate some of my students to build something interesting with it, but I just had to put it into <a href="http://gephi.org/">gephi</a> right away. Some of the tools we&#8217;ll hopefully build will concentrate more on text mining but using an address as a node and a mail-reply relationship as a link, one can easily build a social graph.</p>
<p>I would like to take this example as an occasion to show how different algorithms can produce quite different views on the same data:</p>
<p><a title="4 network layout algorithms" href="http://thepoliticsofsystems.net/wp-content/uploads/2010/10/4-algos-big.png"><img class="alignnone size-full wp-image-177" title="4 algos small" src="http://thepoliticsofsystems.net/wp-content/uploads/2010/10/4-algos-small.png" alt="" width="500" height="396" /></a></p>
<p>So, these are the air-l posters with more than 60 messages posted since 2001. Node size indicates the number of posts, a node&#8217;s color (from blue to red) shows its connectivity in the graph (click on the image to see a much larger version). Link strength, i.e. number of replies between two people, is taken into account. You can download the full <a href="http://thepoliticsofsystems.net/wp-content/uploads/2010/10/social_undirected.gdf">.gdf</a> here. The only difference between the four graphs is the layout algorithm used (Force Atlas, Force Atlas with attraction distribution, Yifan Hu, and Fruchterman Reingold). You can instantly notice that Yifan Hu pushes nodes with low link count much more strongly to the periphery than the others, while Fruchterman Reingold as always keeps its symmetrical sphere shape, suggesting a more harmonious picture than the rest. Force Atlas&#8217; attraction distribution feature will try to differentiate between <a href="http://en.wikipedia.org/wiki/Hubs_and_authorities">hubs and authorities</a>, pushing the former to the periphery while keeping the latter in the center; just compare Barry Wellman&#8217;s position over the different graphs.</p>
<p>I&#8217;ll probably repeat this experiment with a more segmented graph, but I think this already shows that layout algorithms are not just innocently rendering a graph readable. Every method puts some features of the graph to the forefront and the capacity for critical reading is as important as the willingness for &#8220;critical use&#8221; that does not gloss over the differences in tools used.</p>
]]></content:encoded>
			<wfw:commentRss>http://thepoliticsofsystems.net/2010/10/one-network-and-four-algorithms/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>&quot;seeing&quot; the Web and a Karl Pearson citation</title>
		<link>http://thepoliticsofsystems.net/2009/07/seeing-the-web-and-and-a-karl-pearson-citation/</link>
		<comments>http://thepoliticsofsystems.net/2009/07/seeing-the-web-and-and-a-karl-pearson-citation/#comments</comments>
		<pubDate>Fri, 24 Jul 2009 10:29:11 +0000</pubDate>
		<dc:creator>Bernhard</dc:creator>
				<category><![CDATA[actor-network theory]]></category>
		<category><![CDATA[epistemolgy]]></category>
		<category><![CDATA[network theory]]></category>
		<category><![CDATA[statistics]]></category>

		<guid isPermaLink="false">http://thepoliticsofsystems.net/?p=50</guid>
		<description><![CDATA[Over the last couple of years, the social sciences have been increasingly interested in using computer-based tools to analyze the complexity of the social ant farm that is the Web. Issuecrawler was one of the first of such tools and today researchers are indeed using very sophisticated pieces of software to &#8220;see&#8221; the Web. Sciences-Po,]]></description>
			<content:encoded><![CDATA[<p>Over the last couple of years, the social sciences have been increasingly interested in using computer-based tools to analyze the complexity of the social ant farm that is the Web. <a href="http://www.issuecrawler.net" target="_blank">Issuecrawler</a> was one of the first of such tools and today researchers are indeed using very sophisticated pieces of software to <a href="http://rtgi.fr/" target="_blank">&#8220;see&#8221; the Web</a>. Sciences-Po, one of these rather strange french institutions that were founded to educate the elite but which now have to increasingly justify their existence by producing research, has recently hired Bruno Latour to head their new <a href="http://medialab.sciences-po.fr" target="_blank">médialab</a>, which will most probably head into that very direction. Given Latour&#8217;s background (and the fact that Paul Girard, a very competent former colleague at my lab, heads the R&amp;D departement), this should be really very  interesting. I do hope that there will be occasion to tackle the most compelling methodological question when in comes to the application of computers (or mathematics in general) to analyzing human life, which is beautifully framed in a rather reluctant statement from 1889 by Karl Pearson, a major figure in the history of statistics:</p>
<blockquote><p>&#8220;Personally I ought to say that there is, in my own opinion, considerable danger in applying the methods of exact science to problems in descriptive science, whether they be problems of heredity or of political economy; the grace and logical accuracy of the mathematical processes are apt to so fascinate the descriptive scientist that he seeks for sociological hypotheses which fit his mathematical reasoning and this without first ascertaining whether the basis of his hypotheses is as broad as that human life to which the theory is to be applied.&#8221; cit. in. Stigler, Stephen M.: The History of Statistics. Harvard University Press, 1990 p. 304</p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://thepoliticsofsystems.net/2009/07/seeing-the-web-and-and-a-karl-pearson-citation/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>statistics vs. science (and why this is rather political)</title>
		<link>http://thepoliticsofsystems.net/2008/06/statistics-vs-science-and-why-this-is-rather-political/</link>
		<comments>http://thepoliticsofsystems.net/2008/06/statistics-vs-science-and-why-this-is-rather-political/#comments</comments>
		<pubDate>Mon, 30 Jun 2008 15:06:38 +0000</pubDate>
		<dc:creator>Bernhard</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[epistemolgy]]></category>
		<category><![CDATA[network theory]]></category>
		<category><![CDATA[search engines]]></category>

		<guid isPermaLink="false">http://thepoliticsofsystems.net/2008/06/30/statistics-vs-science-and-why-this-is-rather-political/</guid>
		<description><![CDATA[This morning Jonah Bossewitch pointed me to an article over at Wired, authored by Chris Anderson which announces “The End of Theory”. The article’s main argument in itself is not very interesting for anybody with a knack for epistemology – Anderson has apparently never heard of the induction / deduction discussion and a limited idea]]></description>
			<content:encoded><![CDATA[<p>This morning <a href="http://alchemicalmusings.org/2008/06/30/the-end-of-digirati-philosophizing/">Jonah Bossewitch</a> pointed me to an <a href="http://www.wired.com/science/discoveries/magazine/16-07/pb_theory#" target="_blank">article</a> over at Wired, authored by Chris Anderson which announces “The End of Theory”. The article’s main argument in itself is not very interesting for anybody with a knack for epistemology – Anderson has apparently never heard of the induction / deduction discussion and a <a href="http://earningmyturns.blogspot.com/2008/06/end-of-theory-data-deluge-makes.html" target="_blank">limited idea</a> about what statistics does – but there is a very interesting question lurking somewhere behind all the <a href="http://en.wikipedia.org/wiki/Californian_Ideology" target="_blank">Californian Ideology</a> and the following citation points right to it:</p>
<blockquote><p>We can stop looking for models. We can analyze the data without hypotheses about what it might show. We can throw the numbers into the biggest computing clusters the world has ever seen and let statistical algorithms find patterns where science cannot.</p></blockquote>
<p>One could point to the fact that the natural sciences had their experimental side for quite a while (Roger Bacon advocated his<span style="font-style: italic"> scientia experimentalis</span> in the 13th century) and that a laboratory is in a sense a pattern-finding machine where induction continuously plays an important role. What interests me more though is Anderson’s insinuation that statistical algorithms are not models. Let’s just look at one of the examples he uses:</p>
<blockquote><p>Google&#8217;s founding philosophy is that we don&#8217;t know why this page is better than that one: If the statistics of incoming links say it is, that&#8217;s good enough. No semantic or causal analysis is required.</p></blockquote>
<p>This is a very limited understanding of what constitutes a model. I would argue that PageRank does in fact rely very explicitly on a model which combines several layers of justification. In their <a href="http://infolab.stanford.edu/~backrub/google.html" target="_blank">seminal paper</a> on Google, Brin and Page write the following:</p>
<blockquote><p>PageRank can be thought of as a model of user behavior. We assume there is a &#8220;random surfer&#8221; who is given a web page at random and keeps clicking on links, never hitting &#8220;back&#8221; but eventually gets bored and starts on another random page. The probability that the random surfer visits a page is its PageRank.</p></blockquote>
<p>The assumption behind this graph oriented justification is that people do not randomly place links but they do so with purpose. Linking implies attribution of importance: we don’t link to documents that we’re indifferent about. The statistical exploration of the huge graph that is the Web is indeed oriented by this basic assumption and adds the quite contestable ruling according to which shall be most visible what is thought important by the greatest number of linkers. I would, then, argue that there is no experimental method that is purely inductive, not even neural networks. Sure, on the mathematical side we can explore data without limitations concerning their dimensionality, i.e. the number of characteristics that can be taken into account; the method of gathering data is however always a process of selection that is influenced by some idea or intuition that at least implicitly has the characteristic of a model. There is a deductive side to even the most inductive approach. Data is <em>made</em> not <em>given</em> and every projection of that data is oriented. To quote <a href="http://earningmyturns.blogspot.com/2008/06/end-of-theory-data-deluge-makes.html" target="_blank">Fernando Pereira</a>:</p>
<blockquote><p>[W]ithout well-chosen constraints — from scientific theories — all that number crunching will just memorize the experimental data.</p></blockquote>
<p>As Jonah points out, Anderson’s article is probably a straw man argument whose sole purpose is to attract attention but it points to something that is really important: too many people think that mathematical methods for knowledge discovery (datamining that is) are neutral and objective tools that will find what’s really there and show the world as it is without the stain of human intentionality; these algorithms are therefore not seen as objects of political inquiry. In this view statistics is all about counting facts and only higher layers of abstraction (models, theories,…) can have a political dimension. But it matters what we count and how we count.</p>
<p>In the end, Anderson&#8217;s piece is little more than the habitual prostration before the altar of emergence and self-organization. Just exchange the invisible hand for the invisible brain and you’ll get pop epistemology for hive minds&#8230;</p>
]]></content:encoded>
			<wfw:commentRss>http://thepoliticsofsystems.net/2008/06/statistics-vs-science-and-why-this-is-rather-political/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
	</channel>
</rss>

