<?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: Demystifying Networks</title>
	<atom:link href="http://www.scottbot.net/HIAL/?feed=rss2&#038;p=6279" rel="self" type="application/rss+xml" />
	<link>http://www.scottbot.net/HIAL/?p=6279</link>
	<description>data are everywhen</description>
	<lastBuildDate>Sun, 13 Mar 2016 17:49:37 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=4.4.2</generator>
	<item>
		<title>By: Developing a Workshop in Network Analysis for Humanities – DH @ The Queen&#039;s University Library</title>
		<link>http://www.scottbot.net/HIAL/?p=6279#comment-12462</link>
		<dc:creator><![CDATA[Developing a Workshop in Network Analysis for Humanities – DH @ The Queen&#039;s University Library]]></dc:creator>
		<pubDate>Sun, 13 Mar 2016 17:49:37 +0000</pubDate>
		<guid isPermaLink="false">http://www.scottbot.net/HIAL/?p=6279#comment-12462</guid>
		<description><![CDATA[[&#8230;] Demystifying Networks &#8211; Scott Weingart [&#8230;]]]></description>
		<content:encoded><![CDATA[<p>[&#8230;] Demystifying Networks &#8211; Scott Weingart [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Explore The Historian’s Digital Toolbox &#124; exodus777blog</title>
		<link>http://www.scottbot.net/HIAL/?p=6279#comment-12418</link>
		<dc:creator><![CDATA[Explore The Historian’s Digital Toolbox &#124; exodus777blog]]></dc:creator>
		<pubDate>Thu, 10 Mar 2016 01:43:08 +0000</pubDate>
		<guid isPermaLink="false">http://www.scottbot.net/HIAL/?p=6279#comment-12418</guid>
		<description><![CDATA[[&#8230;] Weingart, Scott, “Demystifying Networks,” scottbot irregular, December 14, 2011, http://www.scottbot.net/HIAL/?p=6279 [&#8230;]]]></description>
		<content:encoded><![CDATA[<p>[&#8230;] Weingart, Scott, “Demystifying Networks,” scottbot irregular, December 14, 2011, <a href="http://www.scottbot.net/HIAL/?p=6279" rel="nofollow">http://www.scottbot.net/HIAL/?p=6279</a> [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Palladio and Google Fusion Tables Mapping &#124; Introduction to Digital Humanities</title>
		<link>http://www.scottbot.net/HIAL/?p=6279#comment-11619</link>
		<dc:creator><![CDATA[Palladio and Google Fusion Tables Mapping &#124; Introduction to Digital Humanities]]></dc:creator>
		<pubDate>Tue, 10 Nov 2015 20:41:43 +0000</pubDate>
		<guid isPermaLink="false">http://www.scottbot.net/HIAL/?p=6279#comment-11619</guid>
		<description><![CDATA[[&#8230;] more things, represented by nodes and edges, as explained by Scott Weingart in his article, &#8220;Demystifying Networks.&#8221; In the example I used, the data set was of primarily the relationships of Ralph Neumann to [&#8230;]]]></description>
		<content:encoded><![CDATA[<p>[&#8230;] more things, represented by nodes and edges, as explained by Scott Weingart in his article, &#8220;Demystifying Networks.&#8221; In the example I used, the data set was of primarily the relationships of Ralph Neumann to [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Citation Networks and Disciplinary Histories &#124; FSU Digital Scholars</title>
		<link>http://www.scottbot.net/HIAL/?p=6279#comment-11376</link>
		<dc:creator><![CDATA[Citation Networks and Disciplinary Histories &#124; FSU Digital Scholars]]></dc:creator>
		<pubDate>Sun, 04 Oct 2015 08:06:58 +0000</pubDate>
		<guid isPermaLink="false">http://www.scottbot.net/HIAL/?p=6279#comment-11376</guid>
		<description><![CDATA[[&#8230;] Weingart, &#8220;Demystifying Networks&#8221; (Dec. 14, 2011), &#8220;From Trees to Webs: Uprooting Knowledge through Visualization&#8221; [&#8230;]]]></description>
		<content:encoded><![CDATA[<p>[&#8230;] Weingart, &#8220;Demystifying Networks&#8221; (Dec. 14, 2011), &#8220;From Trees to Webs: Uprooting Knowledge through Visualization&#8221; [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Learning about Networks &#124; Caitlin Chaves Yates</title>
		<link>http://www.scottbot.net/HIAL/?p=6279#comment-10016</link>
		<dc:creator><![CDATA[Learning about Networks &#124; Caitlin Chaves Yates]]></dc:creator>
		<pubDate>Wed, 13 May 2015 08:46:53 +0000</pubDate>
		<guid isPermaLink="false">http://www.scottbot.net/HIAL/?p=6279#comment-10016</guid>
		<description><![CDATA[[&#8230;] in an attempt to learn more about how networks work. So far I&#8217;ve found Scott Weingart&#8217;s Networks Demystified series to be super helpful for an introduction. I&#8217;ve also made good use of Shawn [&#8230;]]]></description>
		<content:encoded><![CDATA[<p>[&#8230;] in an attempt to learn more about how networks work. So far I&#8217;ve found Scott Weingart&#8217;s Networks Demystified series to be super helpful for an introduction. I&#8217;ve also made good use of Shawn [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Data Visualization and Network Analysis &#124; stokesj8</title>
		<link>http://www.scottbot.net/HIAL/?p=6279#comment-6630</link>
		<dc:creator><![CDATA[Data Visualization and Network Analysis &#124; stokesj8]]></dc:creator>
		<pubDate>Mon, 20 Oct 2014 14:48:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.scottbot.net/HIAL/?p=6279#comment-6630</guid>
		<description><![CDATA[[&#8230;] tools in the DH field when used appropriately and correctly. Like Scott Weingart said in his Demystifying Networks blog, &#8220;networks can be used on any project. Networks should be used on far [&#8230;]]]></description>
		<content:encoded><![CDATA[<p>[&#8230;] tools in the DH field when used appropriately and correctly. Like Scott Weingart said in his Demystifying Networks blog, &#8220;networks can be used on any project. Networks should be used on far [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Christof</title>
		<link>http://www.scottbot.net/HIAL/?p=6279#comment-6249</link>
		<dc:creator><![CDATA[Christof]]></dc:creator>
		<pubDate>Fri, 05 Sep 2014 15:33:04 +0000</pubDate>
		<guid isPermaLink="false">http://www.scottbot.net/HIAL/?p=6279#comment-6249</guid>
		<description><![CDATA[Hi Scott, thanks for this very clear and to-the-point post. When I recently experimented with making a network of crime fiction novels and their topics, I had to deal precisely with some of the issues you discuss: how to deal with a bimodal network and how to deal with high density. 
As for the bimodality, for example, depending on the relative number of topics and novels, topics may just on account of their smaller number have higher centrality, which I guess would then be a misleading measure. In my case, even with a ratio of 200 novels to 40 topics, this is certainly noticeable. 
And as for the sparsity issue, cutting out a relatively large part of the low-scoring novel-topic associations certainly helped with visualization. But it seems choosing the cut-off point is a matter of trial-and-error and experience. In my case, I took out any novel-topic associations with a score lower than 0.05, of which there were many, reducing the number of edges by about two thirds. But this will vary with the number of documents and number of topics in the dataset. 
Anyway, this post is still a good read!]]></description>
		<content:encoded><![CDATA[<p>Hi Scott, thanks for this very clear and to-the-point post. When I recently experimented with making a network of crime fiction novels and their topics, I had to deal precisely with some of the issues you discuss: how to deal with a bimodal network and how to deal with high density.<br />
As for the bimodality, for example, depending on the relative number of topics and novels, topics may just on account of their smaller number have higher centrality, which I guess would then be a misleading measure. In my case, even with a ratio of 200 novels to 40 topics, this is certainly noticeable.<br />
And as for the sparsity issue, cutting out a relatively large part of the low-scoring novel-topic associations certainly helped with visualization. But it seems choosing the cut-off point is a matter of trial-and-error and experience. In my case, I took out any novel-topic associations with a score lower than 0.05, of which there were many, reducing the number of edges by about two thirds. But this will vary with the number of documents and number of topics in the dataset.<br />
Anyway, this post is still a good read!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Scott Weingart</title>
		<link>http://www.scottbot.net/HIAL/?p=6279#comment-5424</link>
		<dc:creator><![CDATA[Scott Weingart]]></dc:creator>
		<pubDate>Mon, 23 Sep 2013 19:17:54 +0000</pubDate>
		<guid isPermaLink="false">http://www.scottbot.net/HIAL/?p=6279#comment-5424</guid>
		<description><![CDATA[Dan, thanks for the comment, that&#039;s a great point, I&#039;ll update accordingly in my next write-through.]]></description>
		<content:encoded><![CDATA[<p>Dan, thanks for the comment, that&#8217;s a great point, I&#8217;ll update accordingly in my next write-through.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Daniel Shore (@DanAShore)</title>
		<link>http://www.scottbot.net/HIAL/?p=6279#comment-5423</link>
		<dc:creator><![CDATA[Daniel Shore (@DanAShore)]]></dc:creator>
		<pubDate>Mon, 23 Sep 2013 18:29:08 +0000</pubDate>
		<guid isPermaLink="false">http://www.scottbot.net/HIAL/?p=6279#comment-5423</guid>
		<description><![CDATA[Hey Scott, 
This is a really helpful, clear, post on what networks do and don&#039;t do well.  One thing that you might consider clarifying is what you mean by &quot;useful,&quot; as when you say that &quot;dense networks networks are rarely useful.&quot;  I gather that by &quot;useful&quot; you mean &quot;susceptible to algorithmic analysis.&quot;  But of course there are plenty of other things for which networks are useful.  
d]]></description>
		<content:encoded><![CDATA[<p>Hey Scott,<br />
This is a really helpful, clear, post on what networks do and don&#8217;t do well.  One thing that you might consider clarifying is what you mean by &#8220;useful,&#8221; as when you say that &#8220;dense networks networks are rarely useful.&#8221;  I gather that by &#8220;useful&#8221; you mean &#8220;susceptible to algorithmic analysis.&#8221;  But of course there are plenty of other things for which networks are useful.<br />
d</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Networks Demystified 5: Communities, PageRank, and Sampling Caveats &#124; the scottbot irregular</title>
		<link>http://www.scottbot.net/HIAL/?p=6279#comment-5409</link>
		<dc:creator><![CDATA[Networks Demystified 5: Communities, PageRank, and Sampling Caveats &#124; the scottbot irregular]]></dc:creator>
		<pubDate>Wed, 18 Sep 2013 20:59:32 +0000</pubDate>
		<guid isPermaLink="false">http://www.scottbot.net/HIAL/?p=6279#comment-5409</guid>
		<description><![CDATA[[&#8230;] installment of Networks Demystified will be a bit more applied than the previous bunch (1 network basics, 2 degree, 3 power laws, 4 co-citation analysis). Like many of my recent posts, [&#8230;]]]></description>
		<content:encoded><![CDATA[<p>[&#8230;] installment of Networks Demystified will be a bit more applied than the previous bunch (1 network basics, 2 degree, 3 power laws, 4 co-citation analysis). Like many of my recent posts, [&#8230;]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
