Skip to content

Instantly share code, notes, and snippets.

@fyoorer

fyoorer/rss-xss

Created March 4, 2016 08:38
Show Gist options
  • Save fyoorer/0c8d881cad02f6958afe to your computer and use it in GitHub Desktop.
Save fyoorer/0c8d881cad02f6958afe to your computer and use it in GitHub Desktop.
Download ZIP
Raw
rss-xss
<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:cc="http://web.resource.org/cc/" xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:media="http://search.yahoo.com/mrss/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
<channel>
<atom:link href="http://dataskeptic.libsyn.com/rss" rel="self" type="application/rss+xml"/>
<title>Data Skeptic</title>
<pubDate>Fri, 15 Jan 2016 15:00:00 +0000</pubDate>
<lastBuildDate>Fri, 15 Jan 2016 15:08:58 +0000</lastBuildDate>
<generator>Libsyn WebEngine 2.0</generator>
<link>http://dataskeptic.com</link>
<language>en</language>
<copyright><![CDATA[Creative Commons Attribution License 3.0]]></copyright>
<docs>http://dataskeptic.com</docs>
<managingEditor>kylepolich@gmail.com (kylepolich@gmail.com)</managingEditor>
<itunes:summary><![CDATA[The Data Skeptic Podcast features interviews and discussion of topics related to data science, statistics, machine learning, artificial intelligence and the like, all from the perspective of applying critical thinking and the scientific method to evaluate the veracity of claims and efficacy of approaches.]]></itunes:summary>
<image>
<url>http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg</url>
<title>Data Skeptic</title>
<link><![CDATA[http://dataskeptic.com]]></link>
</image>
<itunes:author>Kyle Polich</itunes:author>
<itunes:keywords>datamining,datascience,machinelearning,science,skepticism,statistics</itunes:keywords>
<itunes:category text="Science &amp; Medicine"/>
<itunes:category text="Technology"/>
<itunes:category text="Education">
<itunes:category text="Higher Education"/>
</itunes:category>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<itunes:explicit>clean</itunes:explicit>
<itunes:owner>
<itunes:name><![CDATA[Kyle Polich]]></itunes:name>
<itunes:email>kylepolich@gmail.com</itunes:email>
</itunes:owner>
<description><![CDATA[Data Skeptic alternates between short mini episodes with the host explaining concepts from data science to his non-data scientist wife, and longer interviews featuring practitioners and experts on interesting topics related to data, all through the eye of scientific skepticism.]]></description>
<itunes:subtitle><![CDATA[Applying critical thinking to Data Science]]></itunes:subtitle>
<item>
<title>hello</title>
<pubDate>Fri, 15 Jan 2016 15:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[18102dbc685d36dea2556055eea4ed76]]></guid>
<link><![CDATA[javascript:alert(document.domain)]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<div id="bbody">
<p>A recent paper in the journal of Judgment and Decision Making titled <a href="http://journal.sjdm.org/15/15923a/jdm15923a.pdf">On the reception and detection of pseudo-profound bullshit</a> explores empirical questions around a reader's ability to detect statements which may sound profound but are actually a collection of buzzwords that fail to contain adequate meaning or truth. These statements are definitively different from lies and nonesense, as we discuss in the episode.</p>
<p>This paper proposes the Bullshit Receptivity scale (BSR) and empirically demonstrates that it correlates with existing metrics like the Cognitive Reflection Test, building confidence that this can be a useful, repeatable, empirical measure of a person's ability to detect pseudo-profound statements as being different from genuinely profound statements. Additionally, the correlative results provide some insight into possible root causes for why individuals might find great profundity in these statements based on other beliefs or cognitive measures.</p>
<p>The paper's lead author <a href="https://uwaterloo.ca/psychology/people-profiles/gordon-pennycook">Gordon Pennycook</a> joins me to discuss this study's results.</p>
<p>If you'd like some examples of pseudo-profound bullshit, you can randomly generate some based on <a href="http://www.wisdomofchopra.com/">Deepak Chopra</a>'s twitter feed.</p>
<p>To read other work from Gordon, check out his <a href="https://scholar.google.ca/citations?user=AIbJenwAAAAJ&hl=en&oi=ao">Google Scholar</a> page and find him on twitter via <a href="https://twitter.com/gordpennycook">@GordonPennycook</a>.</p>
<p>And just for fun, if you think you've dreamed up a Data Skeptic related pseudo-profound bullshit statement, tweet it with hashtag <a href="https://twitter.com/search?q=%23pseudoprofound&src=typd">#pseudoprofound</a>. If I see an especially clever or humorous one, I might want to send you a free <a href="http://dataskeptic.com/store.php">Data Skeptic sticker</a>.</p>
</div>
<div id="audiojs_wrapper0" class="audiojs error"> </div>]]></description>
<enclosure length="45125402" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/pseudo-profound-episode.mp3" />
<itunes:duration>37:37</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[A recent paper in the journal of Judgment and Decision Making titled On the reception and detection of pseudo-profound bullshit explores empirical questions around a reader's ability to detect statements which may sound profound but are actually a...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Gradient Descent</title>
<pubDate>Fri, 08 Jan 2016 08:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[f36f572f85bbf937a7bc381b89ead322]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/gradient-descent.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/5/c/b/d/5cbdb35291f50d46/gradient-descent.png" />
<description><![CDATA[<p>Today's mini episode discusses the widely known optimization algorithm gradient descent in the context of hiking in a foggy hillside.</p>]]></description>
<enclosure length="17810202" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/gradient_descent.mp3" />
<itunes:duration>14:51</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[Today's mini episode discusses the widely known optimization algorithm gradient descent in the context of hiking in a foggy hillside.]]></itunes:subtitle>
</item>
<item>
<title>Let's Kill the Word Cloud</title>
<pubDate>Fri, 01 Jan 2016 08:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[75537da8a555a0072d6c2fed5529b68d]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/kill-the-word-cloud.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/0/8/a/a/08aa84aadef1e9d5/DataSkeptic-Podcast-2.jpg" />
<description><![CDATA[<p>This episode is a discussion of data visualization and a proposed New Year's resolution for Data Skeptic listeners. Let's kill the word cloud.</p>]]></description>
<enclosure length="20532577" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/lets_kill_the_word_cloud.mp3" />
<itunes:duration>15:03</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[This episode is a discussion of data visualization and a proposed New Year's resolution for Data Skeptic listeners. Let's kill the word cloud.]]></itunes:subtitle>
</item>
<item>
<title>2015 Holiday Special</title>
<pubDate>Fri, 25 Dec 2015 08:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[f8c6c4e71f269487485d6d407ba0922b]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/2015-holiday-special.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/b/6/0/2b608d7db6b04470/DataSkeptic-Podcast-2.jpg" />
<description><![CDATA[<p>Today's episode is a reading of Isaac Asimov's <a href="http://www.amazon.com/Isaac-Asimov-Complete-Stories-Vol/dp/038541627X/ref=sr_1_5?ie=UTF8&qid=1449253483&sr=8-5&keywords=asimov">The Machine that Won the War</a>. I can't think of a story that's more appropriate for Data Skeptic.</p>]]></description>
<enclosure length="19684801" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/2015_Holiday_Special.mp3" />
<itunes:duration>14:22</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[Today's episode is a reading of Isaac Asimov's The Machine that Won the War. I can't think of a story that's more appropriate for Data Skeptic.]]></itunes:subtitle>
</item>
<item>
<title>Wikipedia Revision Scoring as a Service</title>
<pubDate>Fri, 18 Dec 2015 14:30:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[19903e6141c04516eddbc8e697bb4281]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/wikipedia-revision-scoring-as-a-service.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>In this interview with <a href="http://halfaker.info/">Aaron Halfaker</a> of the Wikimedia Foundation, we discuss his research and career related to the study of Wikipedia. In his paper <a href="https://www-users.cs.umn.edu/~halfak/publications/The_Rise_and_Decline/">The Rise and Decline of an open Collaboration Community</a>, he highlights a trend in the declining rate of active editors on Wikipedia which began in 2007. I asked Aaron about a variety of possible hypotheses for the phenomenon, in particular, how automated quality control tools that revert edits automatically could play a role. This lead Aaron and his collaborators to develop <a href="http://www-users.cs.umn.edu/~halfak/publications/Snuggle/">Snuggle</a>, an optimized interface to help Wikipedians better welcome new comers to the community.</p>
<p>We discuss the details of these topics as well as <a href="https://meta.wikimedia.org/wiki/Objective_Revision_Evaluation_Service">ORES</a>, which provides <a href="https://meta.wikimedia.org/wiki/Research:Revision_scoring_as_a_service">revision scoring as a service</a> to any software developer that wants to consume the output of their machine learning based scoring.</p>
<p>You can find Aaron on Twitter as <a href="https://twitter.com/halfak">@halfak</a>.</p>]]></description>
<enclosure length="53489943" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/wikipedia-revision-scoring-as-a-service.mp3" />
<itunes:duration>42:56</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[In this interview with Aaron Halfaker of the Wikimedia Foundation, we discuss his research and career related to the study of Wikipedia. In his paper The Rise and Decline of an open Collaboration Community, he highlights a trend in the declining rate...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Term Frequency - Inverse Document Frequency</title>
<pubDate>Fri, 11 Dec 2015 16:45:11 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[7afffa66c10aafc7ebea01cdcacb133b]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/tf-idf.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/0/5/a/b/05abf34e8a161f0e/tf-idf.png" />
<description><![CDATA[<p>Today's topic is term frequency inverse document frequency, which is a statistic for estimating the importance of words and phrases in a set of documents.</p>]]></description>
<enclosure length="12335459" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/tf_-_idf.mp3" />
<itunes:duration>10:17</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[Today's topic is term frequency inverse document frequency, which is a statistic for estimating the importance of words and phrases in a set of documents.]]></itunes:subtitle>
</item>
<item>
<title>The Hunt for Vulcan</title>
<pubDate>Fri, 04 Dec 2015 08:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[abdf4560049259ece64cc06cf96c07d1]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/the-hunt-for-vulcan.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>Early astronomers could see several of the planets with the naked eye. The invention of the telescope allowed for further understanding of our solar system. The work of Isaac Newton allowed later scientists to accurately predict Neptune, which was later observationally confirmed exactly where predicted. It seemed only natural that a similar unknown body might explain anomalies in the orbit of Mercury, and thus began the search for the hypothesized planet Vulcan.</p>
<p><a href="http://cmsw.mit.edu/profile/tom-levenson/">Thomas Levenson</a>'s book "The Hunt for Vulcan" is a narrative of the key scientific minds involved in the search and eventual refutation of an unobserved planet between Mercury and the sun. Thomas joins me in this episode to discuss his book and the fascinating story of the quest to find this planet.</p>
<p>During the discussion, we mention one of the contributions made by Urbain-Jean-Joseph Le Verrier which involved some complex calculations which enabled him to predict where to find the planet that would eventually be called Neptune. The calculus behind this work is difficult, and some of that work is demonstrated in a Jupyter notebook I recently discovered from <a href="http://pmarques.eu/">Paulo Marques</a> titled <a href="http://nbviewer.ipython.org/github/pjpmarques/Julia-Modeling-the-World/blob/master/Three-Body%20Problem.ipynb">The-Body Problem</a>.</p>
<table>
<tbody>
<tr>
<td valign="top"><img src="http://images.randomhouse.com/cover/9780812998986" alt="" /></td>
<td valign="top">
<p>Thomas Levenson is a professor at MIT and head of its science writing program. He is the author of several books, including Einstein in Berlin and Newton and the Counterfeiter: The Unknown Detective Career of the World’s Greatest Scientist. He has also made ten feature-length documentaries (including a two-hour Nova program on Einstein) for which he has won numerous awards. In his most recent book "The Hunt for Vulcan", explores the century spanning quest to explain the movement of the cosmos via theory and the role the hypothesized planet Vulcan played in the story.</p>
<p>Follow Thomas on twitter <a href="https://twitter.com/tomlevenson">@tomlevenson</a> and check out his blog at<a href="https://inversesquare.wordpress.com/">https://inversesquare.wordpress.com/</a>.</p>
<p>Pick up your copy of <a href="http://www.penguinrandomhouse.com/books/254788/the-hunt-for-vulcan-by-thomas-levenson/">The Hunt for Vulcan</a> at your local bookstore, preferred book buying place, or at the <a href="http://www.penguinrandomhouse.com/books/254788/the-hunt-for-vulcan-by-thomas-levenson/">Penguin Random House site</a>.</p>
</td>
</tr>
</tbody>
</table>]]></description>
<enclosure length="49805500" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/the-hunt-for-vulcan.mp3" />
<itunes:duration>41:31</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[Early astronomers could see several of the planets with the naked eye. The invention of the telescope allowed for further understanding of our solar system. The work of Isaac Newton allowed later scientists to accurately predict Neptune, which was...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] The Accuracy Paradox</title>
<pubDate>Fri, 27 Nov 2015 08:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[11e28027d156b297cb5ddc84da75c767]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/the-accuracy-paradox.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/b/2/9/8/b2989c2c2f52dc83/accuracy-paradox.png" />
<description><![CDATA[<p>Today's episode discusses the accuracy paradox. There are cases when one might prefer a less accurate model because it yields more predictive power or better captures the underlying causal factors describing the outcome variable you are interested in. This is especially relevant in machine learning when trying to predict rare events. We discuss how the accuracy paradox might apply if you were trying to predict the likelihood a person was a bird owner.</p>]]></description>
<enclosure length="20465288" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/the-accuracy-paradox.mp3" />
<itunes:duration>17:04</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[Today's episode discusses the accuracy paradox. There are cases when one might prefer a less accurate model because it yields more predictive power or better captures the underlying causal factors describing the outcome variable you are interested in....]]></itunes:subtitle>
</item>
<item>
<title>Neuroscience from a Data Scientist's Perspective</title>
<pubDate>Fri, 20 Nov 2015 08:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[be662d4d6dbf8db532c060ca817fcb41]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/neuroscience-from-a-data-scientists-perspective.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>... or should this have been called data science from a neuroscientist's perspective? Either way, I'm sure you'll enjoy this discussion with <a href="https://twitter.com/laurieskelly">Laurie Skelly</a>. Laurie earned a PhD in Integrative Neuroscience from the Department of Psychology at the University of Chicago. In her life as a social neuroscientist, using fMRI to study the neural processes behind empathy and psychopathy, she learned the ropes of zooming in and out between the macroscopic and the microscopic -- how millions of data points come together to tell us something meaningful about human nature. She's currently at <a href="http://www.thisismetis.com/">Metis Data Science</a>, an organization that helps people learn the skills of data science to transition in industry.</p>
<p>In this episode, we discuss fMRI technology, Laurie's research studying empathy and psychopathy, as well as the skills and tools used in common between neuroscientists and data scientists. For listeners interested in more on this subject, Laurie recommended the blogs <a href="http://blogs.discovermagazine.com/neuroskeptic/">Neuroskeptic</a>, <a href="http://neurocritic.blogspot.com/">Neurocritic</a>, and <a href="https://neuroecology.wordpress.com/">Neuroecology</a>.</p>
<p>We conclude the episode with a mention of the upcoming Metis Data Science San Francisco cohort which Laurie will be teaching. If anyone is interested in applying to participate, they can do so <a href="http://www.thisismetis.com/data-science/apply">here</a>.</p>]]></description>
<enclosure length="48347867" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/neuroscience.mp3" />
<itunes:duration>40:18</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[... or should this have been called data science from a neuroscientist's perspective? Either way, I'm sure you'll enjoy this discussion with Laurie Skelly. Laurie earned a PhD in Integrative Neuroscience from the Department of Psychology at the...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Bias Variance Tradeoff</title>
<pubDate>Fri, 13 Nov 2015 08:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[23fa13aacf0940fc4f8d7889caf4e6b9]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/bias-variance-tradeoff.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/7/0/d/b/70db0da2d9da31a0/bias_variance_tradeoff.png" />
<description><![CDATA[<p>A discussion of the expected number of cars at a stoplight frames today's discussion of the bias variance tradeoff. The central ideal of this concept relates to model complexity. A very simple model will likely generalize well from training to testing data, but will have a very high variance since it's simplicity can prevent it from capturing the relationship between the covariates and the output. As a model grows more and more complex, it may capture more of the underlying data but the risk that it overfits the training data and therefore does not generalize (is biased) increases. The tradeoff between minimizing variance and minimizing bias is an ongoing challenge for data scientists, and an important discussion for skeptics around how much we should trust models.</p>]]></description>
<enclosure length="16285173" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/bias-variance-tradeoff.mp3" />
<itunes:duration>13:35</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[A discussion of the expected number of cars at a stoplight frames today's discussion of the bias variance tradeoff. The central ideal of this concept relates to model complexity. A very simple model will likely generalize well from training to testing...]]></itunes:subtitle>
</item>
<item>
<title>Big Data Doesn't Exist</title>
<pubDate>Fri, 06 Nov 2015 08:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[2407283aea97cb88e7147ae3cc152e7a]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/big-data-doesnt-exist.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>The recent opinion piece Big Data Doesn't Exist on Tech Crunch by Slater Victoroff is an interesting discussion about the usefulness of data both big and small. Slater joins me this episode to discuss and expand on this discussion.</p>
<p>Slater Victoroff is CEO of indico Data Solutions, a company whose services turn raw text and image data into human insight. He, and his co-founders, studied at Olin College of Engineering where indico was born. indico was then accepted into the "Techstars Accelarator Program" in the Fall of 2014 and went on to raise $3M in seed funding. His recent essay "Big Data Doesn't Exist" received a lot of traction on TechCrunch, and I have invited Slater to join me today to discuss his perspective and touch on a few topics in the machine learning space as well.</p>]]></description>
<enclosure length="38955279" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/big-data-doesnt-exist.mp3" />
<itunes:duration>32:28</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[The recent opinion piece Big Data Doesn't Exist on Tech Crunch by Slater Victoroff is an interesting discussion about the usefulness of data both big and small. Slater joins me this episode to discuss and expand on this discussion.
Slater Victoroff...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Covariance and Correlation</title>
<pubDate>Fri, 30 Oct 2015 07:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[f69c021cb000d94652b27721621af0c0]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep79_covariance-and-correlation.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/b/d/1/2bd1713290199214/covariance_correlation.png" />
<description><![CDATA[<p>The degree to which two variables change together can be calculated in the form of their covariance. This value can be normalized to the correlation coefficient, which has the advantage of transforming it to a unitless measure strictly bounded between -1 and 1. This episode discusses how we arrive at these values and why they are important.</p>]]></description>
<enclosure length="17372912" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/covariance_and_correlation.mp3" />
<itunes:duration>14:29</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[The degree to which two variables change together can be calculated in the form of their covariance. This value can be normalized to the correlation coefficient, which has the advantage of transforming it to a unitless measure strictly bounded between...]]></itunes:subtitle>
</item>
<item>
<title>Bayesian A/B Testing</title>
<pubDate>Fri, 23 Oct 2015 07:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[3646397a9caee83882f1a78339bdf542]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep78_bayesian-a-b-testing.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>Today's guest is <a href="http://camdp.com/">Cameron Davidson-Pilon</a>. Cameron has a masters degree in quantitative finance from the University of Waterloo. Think of it as statistics on stock markets. For the last two years he's been the team lead of data science at <a href="https://www.shopify.com/">Shopify</a>. He's the founder of <a href="http://dataorigami.net/">dataoragami.net</a> which produces screencasts teaching methods and techniques of applied data science. He's also the author of the just released in print book <a href="http://www.amazon.com/Bayesian-Methods-Hackers-Probabilistic-Addison-Wesley/dp/0133902838">Bayesian Methods for Hackers: Probabilistic Programming and Bayesian Inference</a>, which you can also get in a <a href="http://camdavidsonpilon.github.io/Probabilistic-Programming-and-Bayesian-Methods-for-Hackers/">digital form</a>.</p>
<p>This episode focuses on the topic of Bayesian A/B Testing which spans just one chapter of the book. Related to today's discussion is the Data Origami post <a href="http://dataorigami.net/blogs/napkin-folding/17987495-the-class-imbalance-problem-in-a-b-testing">The class imbalance problem in A/B testing</a>.</p>
<p>Lastly, Data Skeptic will be giving away a copy of the print version of the book to one lucky listener who has a US based delivery address. To participate, you'll need to write a review of any site, book, course, or podcast of your choice on <a href="http://www.datasciguide.com/">datasciguide.com</a>. After it goes live, tweet a link to it with the hashtag <a href="https://twitter.com/search?f=tweets&q=%23windsbook&src=typd">#WinDSBook</a> to be given an entry in the contest. This contest will end November 20th, 2015, at which time I'll draw a single randomized winner and contact them for delivery details via direct message on Twitter.</p>]]></description>
<enclosure length="36205630" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/bayesian-methods-for-hackers.mp3" />
<itunes:duration>30:11</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[Today's guest is Cameron Davidson-Pilon. Cameron has a masters degree in quantitative finance from the University of Waterloo. Think of it as statistics on stock markets. For the last two years he's been the team lead of data science at Shopify. He's...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] The Central Limit Theorem</title>
<pubDate>Fri, 16 Oct 2015 07:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[e9d6423ec527424cfec4add6948d31fd]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep77_central-limit-theorem.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/5/9/d/7/59d727f2484333a5/central_limit_theorem.png" />
<description><![CDATA[<p>The central limit theorem is an important statistical result which states that typically, the mean of a large enough set of independent trials is approximately normally distributed.  This episode explores how this might be used to determine if an amazon parrot like Yoshi produces or or less waste than an African Grey, under the assumption that the individual distributions are not normal.</p>]]></description>
<enclosure length="15732945" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Central_Limit_Theorem.mp3" />
<itunes:duration>13:07</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[The central limit theorem is an important statistical result which states that typically, the mean of a large enough set of independent trials is approximately normally distributed.  This episode explores how this might be used to determine if an...]]></itunes:subtitle>
</item>
<item>
<title>Accessible Technology</title>
<pubDate>Fri, 09 Oct 2015 07:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[6daf2add7b3e35f3f1078e5b6b739839]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep76_accessible-technology.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>Today's guest is Chris Hofstader <a href="https://twitter.com/gonz_blinko">(@gonz_blinko)</a>, an accessibility researcher and advocate, as well as an activist for causes such as improving access to information for blind and vision impaired people. His background in computer programming enabled him to be the leader of JAWS, a Windows program that allowed people with a visual impairment to read their screen either through text-to-speech or a refreshable braille display. He's the Managing Member of <a href="http://3mousetech.com/">3 Mouse Technology</a>. He's also a frequent blogger primarily at <a href="http://chrishofstader.com/">chrishofstader.com</a>.</p>
<p>For web developers and site owners, Chris recommends two tools to help test for accessibility issues: <a href="http://tenon.io/">tenon.io</a> and <a href="http://www.dqtech.co/">dqtech.co</a>.</p>
<p>A guest post from Chris appeared on the Skepchick blogged titled <a href="http://skepchick.org/2011/07/skepticism-and-disability-by-chris-gonz-blinko-hofstader/">Skepticism and Disability</a> which lead to the formation of the sister site <a href="http://skeptability.com/">Skeptibility</a>.</p>
<p>In a discussion of skepticism and favorite podcasts, Chris mentioned a number of great shows, most notably <a href="http://poddelusion.co.uk/blog/">The Pod Delusion</a> to which he was a contributor. Additionally, Chris has also appeared on <a href="http://www.atheistnomads.com/2012/atheist-nomads-episode-12-disability-and-accessibility-with-chris-hofstader/">The Atheist Nomads</a>.</p>
<p>Lastly, a shout out from Chris to musician <a href="http://www.shelleysegal.com/">Shelley Segal</a> whom he hosted just before the date of recording of this episode. Her music can be found on her site or via <a href="https://shelleysegal.bandcamp.com/">bandcamp</a>.</p>]]></description>
<enclosure length="46472798" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/accessible-technology.mp3" />
<itunes:duration>38:44</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[Today's guest is Chris Hofstader (@gonz_blinko), an accessibility researcher and advocate, as well as an activist for causes such as improving access to information for blind and vision impaired people. His background in computer programming enabled...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Multi-armed Bandit Problems</title>
<pubDate>Fri, 02 Oct 2015 07:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[6dc612de13cd11c25547f70380f0a49b]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep75_multi-armed-bandit-problems.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/c/2/b/6/c2b6b178136434c4/bandit.png" />
<description><![CDATA[<p>The multi-armed bandit problem is named with reference to slot machines (one armed bandits). Given the chance to play from a pool of slot machines, all with unknown payout frequencies, how can you maximize your reward? If you knew in advance which machine was best, you would play exclusively that machine. Any strategy less than this will, on average, earn less payout, and the difference can be called the "regret".</p>
<p>You can try each slot machine to learn about it, which we refer to as exploration. When you've spent enough time to be convinced you've identified the best machine, you can then double down and exploit that knowledge. But how do you best balance exploration and exploitation to minimize the regret of your play?</p>
<p>This mini-episode explores a few examples including restaurant selection and A/B testing to discuss the nature of this problem. In the end we touch briefly on Thompson sampling as a solution.</p>]]></description>
<enclosure length="15325435" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/multi-armed-bandit.mp3" />
<itunes:duration>12:47</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[The multi-armed bandit problem is named with reference to slot machines (one armed bandits). Given the chance to play from a pool of slot machines, all with unknown payout frequencies, how can you maximize your reward? If you knew in advance which...]]></itunes:subtitle>
</item>
<item>
<title>Shakespeare, Abiogenesis, and Exoplanets</title>
<pubDate>Fri, 25 Sep 2015 07:30:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[6bd2a3a4d1af3fbc95077f3edae7bd7b]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep74_shakespeare-abiogenesis-and-exoplanets.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>Our episode this week begins with a correction. Back in episode 28 (Monkeys on Typewriters), Kyle made some bold claims about the probability that monkeys banging on typewriters might produce the entire works of Shakespeare by chance. The proof shown in the show notes turned out to be a bit dubious and Dave Spiegel joins us in this episode to set the record straight.</p>
<p>In addition to that, out discussion explores a number of interesting topics in astronomy and astrophysics. This includes a paper Dave wrote with Ed Turner titled "Bayesian analysis of the astrobiological implications of life's early emergence on Earth" as well as exoplanet discovery.</p>]]></description>
<enclosure length="61957227" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Shakespeare-abiogenesis-exoplanets.mp3" />
<itunes:duration>58:14</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[Our episode this week begins with a correction. Back in episode 28 (Monkeys on Typewriters), Kyle made some bold claims about the probability that monkeys banging on typewriters might produce the entire works of Shakespeare by chance. The proof shown...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Sample Sizes</title>
<pubDate>Fri, 18 Sep 2015 06:47:29 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[49ebf86d840675237ad098739a5ed535]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep73_small-sample-sizes.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/0/f/6/8/0f6824c5c54ab58b/samplesize.png" />
<description><![CDATA[<p>There are several factors that are important to selecting an appropriate sample size and dealing with small samples. The most important questions are around representativeness - how well does your sample represent the total population and capture all it's variance?</p>
<p>Linhda and Kyle talk through a few examples including elections, picking an Airbnb, produce selection, and home shopping as examples of cases in which the amount of observations one has are more or less important depending on how complex the underlying system one is observing is.</p>]]></description>
<enclosure length="16516609" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/sample_sizes.mp3" />
<itunes:duration>13:22</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[There are several factors that are important to selecting an appropriate sample size and dealing with small samples. The most important questions are around representativeness - how well does your sample represent the total population and capture all...]]></itunes:subtitle>
</item>
<item>
<title>The Model Complexity Myth</title>
<pubDate>Fri, 11 Sep 2015 07:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[6b82c4971e7b62765c5cf463f53faf37]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep72_model-complexity-myth.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>There's an old adage which says you cannot fit a model which has more parameters than you have data. While this is often the case, it's not a universal truth. Today's guest Jake VanderPlas explains this topic in detail and provides some excellent examples of when it holds and doesn't. Some excellent visuals articulating the points can be found on Jake's blog Pythonic Perambulations, specifically on his post The Model Complexity Myth.</p>
<p>We also touch on Jake's work as an astronomer, his noteworthy open source contributions, and forthcoming book (currently available in an Early Edition) Python Data Science Handbook.</p>]]></description>
<enclosure length="22515987" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/model_complexity_myth.mp3" />
<itunes:duration>30:01</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[There's an old adage which says you cannot fit a model which has more parameters than you have data. While this is often the case, it's not a universal truth. Today's guest Jake VanderPlas explains this topic in detail and provides some excellent...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Distance Measures</title>
<pubDate>Fri, 04 Sep 2015 07:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[b598c86c1e090dca5004687425ca20a6]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep71_distance-measures.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/9/4/c/a/94caf4e0ad290101/distance_measures.png" />
<description><![CDATA[<p>There are many occasions in which one might want to know the distance or similarity between two things, for which the means of calculating that distance is not necessarily clear. The distance between two points in Euclidean space is generally straightforward, but what about the distance between the top of Mount Everest to the bottom of the ocean? What about the distance between two sentences?</p>
<p>This mini-episode summarizes some of the considerations and a few of the means of calculating distance. We touch on Jaccard Similarity, Manhattan Distance, and a few others.</p>]]></description>
<enclosure length="13969321" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/distance_measures.mp3" />
<itunes:duration>12:44</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[There are many occasions in which one might want to know the distance or similarity between two things, for which the means of calculating that distance is not necessarily clear. The distance between two points in Euclidean space is generally...]]></itunes:subtitle>
</item>
<item>
<title>ContentMine</title>
<pubDate>Fri, 28 Aug 2015 07:30:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[adbe1600cc9bc786518d97761b862140]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep70_contentmine.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>ContentMine is a project which provides the tools and workflow to convert scientific literature into machine readable and machine interpretable data in order to facilitate better and more effective access to the accumulated knowledge of human kind. The program's founder Peter Murray-Rust joins us this week to discuss ContentMine. Our discussion covers the project, the scientific publication process, copywrite, and several other interesting topics.</p>]]></description>
<enclosure length="63818104" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/contentmine.mp3" />
<itunes:duration>53:11</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[ContentMine is a project which provides the tools and workflow to convert scientific literature into machine readable and machine interpretable data in order to facilitate better and more effective access to the accumulated knowledge of human kind....]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Structured and Unstructured Data</title>
<pubDate>Fri, 21 Aug 2015 06:22:41 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[b459290fbc797256bcc26ac519306172]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep69_structured-and-unstructured.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/9/6/8/4/9684e62b9a3f18e5/structured_unstructured.png" />
<description><![CDATA[<p>Today's mini-episode explains the distinction between structured and unstructured data, and debates which of these categories best describe recipes.</p>]]></description>
<enclosure length="14672187" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/structured_unstructured.mp3" />
<itunes:duration>13:20</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[Today's mini-episode explains the distinction between structured and unstructured data, and debates which of these categories best describe recipes.]]></itunes:subtitle>
</item>
<item>
<title>Measuring the Influence of Fashion Designers</title>
<pubDate>Fri, 14 Aug 2015 07:01:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[964951817b4ddfd4419a9a2f0b286257]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep68_measuring-the-influence-of-fashion-designers.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><a href="http://yusanlin.com/">Yusan Lin</a> shares her research on using data science to explore the fashion industry in this episode. She has applied techniques from data mining, natural language processing, and social network analysis to explore who are the innovators in the fashion world and how their influence effects other designers.</p>
<p>If you found this episode interesting and would like to read more, Yusan's papers <a href="http://yusanlin.com/files/papers/2014_hicss_Text_Generated_Fashion_Influence_Model.pdf">Text-Generated Fashion Influence Model: An Empirical Study on Style.com</a> and <a href="http://www.yusanlin.com/files/papers/wits_2014_hidden_influence_network_fashion_industry.pdf">The Hidden Influence Network in the Fashion Industry</a> are worth reading.</p>]]></description>
<enclosure length="29635312" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/yusan_lin.mp3" />
<itunes:duration>24:42</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>fashion</itunes:keywords>
<itunes:subtitle><![CDATA[Yusan Lin shares her research on using data science to explore the fashion industry in this episode. She has applied techniques from data mining, natural language processing, and social network analysis to explore who are the innovators in the fashion...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] PageRank</title>
<pubDate>Fri, 07 Aug 2015 07:01:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[b4c71227192bc2d628eabaf2e057f6b3]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep67_pagerank.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/e/3/1/2e31a2ead31495d7/pagerank.png" />
<description><![CDATA[<p>PageRank is the algorithm most famous for being one of the original innovations that made Google stand out as a search engine. It was defined in the classic paper <a href="http://infolab.stanford.edu/~backrub/google.html">The Anatomy of a Large-Scale Hypertextual Web Search Engine</a> by Sergey Brin and Larry Page. While this algorithm clearly impacted web searching, it has also been useful in a variety of other applications. This episode presents a high level description of this algorithm and how it might apply when trying to establish who writes the most influencial academic papers.</p>]]></description>
<enclosure length="9694911" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/pagerank.mp3" />
<itunes:duration>08:29</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>pagerank</itunes:keywords>
<itunes:subtitle><![CDATA[PageRank is the algorithm most famous for being one of the original innovations that made Google stand out as a search engine. It was defined in the classic paper The Anatomy of a Large-Scale Hypertextual Web Search Engine by Sergey Brin and Larry...]]></itunes:subtitle>
</item>
<item>
<title>Data Science at Work in LA County</title>
<pubDate>Wed, 29 Jul 2015 19:32:13 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[c3b34c543cd4d8a070beba2bbc81b5a6]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep66_data-science-at-work-in-la-county.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>In this episode, Benjamin Uminsky enlightens us about some of the ways the Los Angeles County Registrar-Recorder/County Clerk leverages data science and analysis to help be more effective and efficient with the services and expectations they provide citizens. Our topics range from forecasting to predicting the likelihood that people will volunteer to be poll workers.</p>
<p>Benjamin recently spoke at Big Data Day LA. Videos have not yet been posted, but you can see the slides from his talk <a href="http://www.slideshare.net/sawjd/data-mining-forecasting-and-bi-at-the-rrcc-by-benjamin-uminsky-of-la-county-registrarrecordercounty-clerk">Data Mining Forecasting and BI at the RRCC</a> if this episode has left you hungry to learn more.</p>
<p>During the show, Benjamin encouraged any Los Angeles residents who have some time to serve their community consider <a href="https://www.lavote.net/home/voting-elections/pollworker-information/become-a-pollworker/about-pollworkers">becoming a pollworker</a>.</p>]]></description>
<enclosure length="46323730" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/uminsky.mp3" />
<itunes:duration>41:26</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>la,county,forecasting,pollworkers</itunes:keywords>
<itunes:subtitle><![CDATA[with Benjamin Uminsky]]></itunes:subtitle>
</item>
<item>
<title>[MINI] k-Nearest Neighbors</title>
<pubDate>Fri, 24 Jul 2015 05:51:15 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[ba648ba7cde7d7a31df38ce0f7feb359]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep65_k-nearest-neighbors.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/3/1/6/8/3168a617277a4bbe/knn.png" />
<description><![CDATA[<p>This episode explores the k-nearest neighbors algorithm which is an unsupervised, non-parametric method that can be used for both classification and regression. The basica concept is that it leverages some distance function on your dataset to find the $k$ closests other observations of the dataset and averaging them to impute an unknown value or unlabelled datapoint.</p>]]></description>
<enclosure length="9437371" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_knn.mp3" />
<itunes:duration>08:33</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>learning,neighbors,unsupervised,knearest</itunes:keywords>
<itunes:subtitle><![CDATA[This episode explores the k-nearest neighbors algorithm which is an unsupervised, non-parametric method that can be used for both classification and regression. The basica concept is that it leverages some distance function on your dataset to find the...]]></itunes:subtitle>
</item>
<item>
<title>Crypto</title>
<pubDate>Fri, 17 Jul 2015 09:34:34 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[e83f1ecb8a43eddef118a4b046ec3748]]></guid>
<link><![CDATA[http://dataskeptic.com/bf/]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/4/2/2/0/42209c93ee73992c/DataSkeptic-Podcast-1.jpg" />
<description><![CDATA[<p><span style="font-size: 14pt;">How do people think rationally about small probability events?</span></p>
<p><span style="font-size: 14pt;">What is the optimal statistical process by which one can update their beliefs in light of new evidence?</span></p>
<p><span style="font-size: 14pt;">This episode of Data Skeptic explores questions like this as Kyle consults a cast of previous guests and experts to try and answer the question "What is the probability, however small, that Bigfoot is real?"</span></p>]]></description>
<enclosure length="64416261" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Data_Skeptic_-_Crypto.mp3" />
<itunes:duration>01:24:42</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>statistics,bigfoot,yeti,cryptozoology,sasquatch,probability</itunes:keywords>
<itunes:subtitle><![CDATA[How do people think rationally about small probability events?
What is the optimal statistical process by which one can update their beliefs in light of new evidence?
This episode of Data Skeptic explores questions like this as Kyle consults a cast...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] MapReduce</title>
<pubDate>Fri, 10 Jul 2015 05:17:46 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[731d9aa87826ffe99e42bb6217b1b9ce]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep63_map-reduce.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">This mini-episode is a high level explanation of the basic idea behind MapReduce, which is a fundamental concept in big data. The origin of the idea comes from a Google paper titled </span><a style="color: #337ab7; text-decoration: none; font-family: sans-serif; font-size: 14px; line-height: 24px;" href="http://research.google.com/archive/mapreduce.html">MapReduce: Simplified Data Processing on Large Clusters</a><span style="color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">. This episode makes an analogy to tabulating paper voting ballets as a means of helping to explain how and why MapReduce is an important concept.</span></p>]]></description>
<enclosure length="15350512" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Map_Reduce.mp3" />
<itunes:duration>12:48</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>big,data,mapreduce,hadoop</itunes:keywords>
<itunes:subtitle><![CDATA[This mini-episode is a high level explanation of the basic idea behind MapReduce, which is a fundamental concept in big data. The origin of the idea comes from a Google paper titled MapReduce: Simplified Data Processing on Large Clusters. This...]]></itunes:subtitle>
</item>
<item>
<title>Genetically Engineered Food and Trends in Herbicide Usage</title>
<pubDate>Fri, 03 Jul 2015 07:30:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[5d5f51fe85279e182ff4e8d3dcc6d4d7]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep62_genetically-engineered-food-and-trends-in-herbicide-usage.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">The <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://www.crediblehulk.org/">Credible Hulk</a> joins me in this episode to discuss a recent <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://www.crediblehulk.org/index.php/2015/06/02/about-those-more-caustic-herbicides-that-glyphosate-helped-replace-by-credible-hulk/">blog post he wrote about glyphosate</a> and the data about how it's introduction changed the historical usage trends of other herbicides. Links to all the sources and references can be found in the blog post.</p>
<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">In this discussion, we also mention the <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="https://www.sciencebasedmedicine.org/tag/food-babe/">food babe</a> and <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://rationalwiki.org/wiki/Last_Thursdayism">Last Thursdayism</a> which may be worth some further reading. Kyle also mentioned the list of ingredients or <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="https://jameskennedymonash.wordpress.com/2013/12/12/ingredients-of-an-all-natural-banana/">chemical composition of a banana</a>.</p>
<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">Credible Hulk mentioned the <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="https://www.facebook.com/MommyPhD">Mommy PhD</a> facebook page. An interesting article about Mommy PhD can be found <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://www.geneticliteracyproject.org/2015/03/12/scientistsarepeople-mommy-phd-on-proliferation-of-anti-gmo-death-and-rape-threats-against-scientists/">here</a>. Lastly, if you enjoyed the show, please "Like" the <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="https://www.facebook.com/therealcrediblehulk">Credible Hulk facebook group</a>.</p>]]></description>
<enclosure length="41915998" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/glyphosate.mp3" />
<itunes:duration>34:56</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>hulk,gmo,credible,glyphosate</itunes:keywords>
<itunes:subtitle><![CDATA[The Credible Hulk joins me in this episode to discuss a recent blog post he wrote about glyphosate and the data about how it's introduction changed the historical usage trends of other herbicides. Links to all the sources and...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] The Curse of Dimensionality</title>
<pubDate>Fri, 26 Jun 2015 07:01:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[a53337d2d2b39058ebd2a54085947527]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep61_the-curse-of-dimensionality.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">More features are not always better! With an increasing number of features to consider, machine learning algorithms suffer from the curse of dimensionality, as they have a wider set and often sparser coverage of examples to consider. This episode explores a real life example of this as Kyle and Linhda discuss their thoughts on purchasing a home.</p>
<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">The curse of dimensionality was defined by Richard Bellman, and applies in several slightly nuanced cases. This mini-episode discusses how it applies on machine learning.</p>
<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">This episode does not, however, discuss a slightly different version of the curse of dimensionality which appears in decision theoretic situations. Consider the game of chess. One must think ahead several moves in order to execute a successful strategy. However, thinking ahead another move requires a consideration of every possible move of every piece controlled, and every possible response one's opponent may take. The space of possible future states of the board grows exponentially with the horizon one wants to look ahead to. This is present in the notably useful <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="https://en.wikipedia.org/wiki/Bellman_equation">Bellman equation</a>.</p>]]></description>
<enclosure length="13135328" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_The_Curse_of_Dimensionality.mp3" />
<itunes:duration>10:57</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[More features are not always better! With an increasing number of features to consider, machine learning algorithms suffer from the curse of dimensionality, as they have a wider set and often sparser coverage of examples to consider. This episode...]]></itunes:subtitle>
</item>
<item>
<title>Video Game Analytics</title>
<pubDate>Fri, 19 Jun 2015 11:51:19 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[422eae440e6a08f1cfa9c8bcbf865586]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep60_game-analytics.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">This episode discusses video game analytics with guest <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://andersdrachen.com/">Anders Drachen</a>. The way in which people get access to games and the opportunity for game designers to ask interesting questions with data has changed quite a bit in the last two decades. Anders shares his insights about the past, present, and future of game analytics. We explore not only some of the innovations and interesting ways of examining user experience in the gaming industry, but also touch on some of the exciting opportunities for innovation that are right on the horizon.</p>
<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">You can find more from Anders online at <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://andersdrachen.com/">andersdrachen.com</a>, and follow him on twitter <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="https://twitter.com/andersdrachen">@andersdrachen</a></p>]]></description>
<enclosure length="44630226" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Game_Analytics_with_Anders_Dracken.mp3" />
<itunes:duration>31:00</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[with Anders Drachen]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Anscombe's Quartet</title>
<pubDate>Fri, 12 Jun 2015 08:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[387ce17ae5c1ea83dc941d6344143fd3]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep59_anscombes_quartet.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/b/8/9/4/b894768703c5a71c/anscombes_quartet.png" />
<description><![CDATA[<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">This mini-episode discusses <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://en.wikipedia.org/wiki/Anscombe%27s_quartet">Anscombe's Quartet</a>, a series of four datasets which are clearly very different but share some similar statistical properties with one another. For example, each of the four plots has the same mean and variance on both axis, as well as the same correlation coefficient, and same linear regression.</p>
<p> </p>
<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; orphans: auto; text-align: left; text-indent: 0px; text-transform: none; white-space: normal; widows: 1; word-spacing: 0px; -webkit-text-stroke-width: 0px; background-color: #ffffff;">The episode tries to add some context by imagining each of these datasets as data about a sports team, and why it can be important to look beyond basic summary statistics when exploring your dataset.</p>]]></description>
<enclosure length="10925369" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Anscombes_Quartet.mp3" />
<itunes:duration>09:07</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>summary,statistics,quartet,anscombes</itunes:keywords>
<itunes:subtitle><![CDATA[This mini-episode discusses Anscombe's Quartet, a series of four datasets which are clearly very different but share some similar statistical properties with one another. For example, each of the four plots has the same mean and variance on both...]]></itunes:subtitle>
</item>
<item>
<title>Proposing Annoyance Mining</title>
<pubDate>Tue, 09 Jun 2015 06:18:27 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[f32f57aff53eed8f22207b6b06595b36]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/proposing-annoyance-mining.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/9/5/9/6/9596ffc13c402742/DataSkeptic-Podcast-2.jpg" />
<description><![CDATA[<p>A recent episode of the Skeptics Guide to the Universe included a slight rant by Dr. Novella and the rouges about a shortcoming in operating systems.  This episode explores why such a (seemingly obvious) flaw might make sense from an engineering perspective, and how data science might be the solution.</p>
<p>In this solo episode, Kyle proposes the concept of "annoyance mining" - the idea that with proper logging and enough feedback, data scientists could be provided the right dataset from which they can detect flaws and annoyances in software and other systems and automatically detect potential bugs, flaws, and improvements which could make those systems better.</p>
<p>As system complexity grows, it seems that an abstraction like this might be required in order to keep maintaining an effective development cycle.  This episode is a bit of a soap box for Kyle as he explores why and how we might track an appropriate amount of data to be able to make better software and systems more suited for the users.</p>]]></description>
<enclosure length="36978855" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/annoyance_mining.mp3" />
<itunes:duration>30:49</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[A recent episode of the Skeptics Guide to the Universe included a slight rant by Dr. Novella and the rouges about a shortcoming in operating systems.  This episode explores why such a (seemingly obvious) flaw might make sense from an engineering...]]></itunes:subtitle>
</item>
<item>
<title>Preserving History at Cyark</title>
<pubDate>Fri, 05 Jun 2015 07:30:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[8875fac7e71743faf373a91890329fe0]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep57_preserving-history-at-cyark.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">Elizabeth Lee from <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://www.cyark.org/">CyArk</a> joins us in this episode to share stories of the work done capturing important historical sites digitally. CyArk is a non-profit focused on using technology to preserve the world's important historic and cultural locations digitally. CyArk's founder Ben Kacyra, a pioneer in 3D capture technology, and his wife, founded CyArk after seeing the need to preserve important artifacts and locations digitally before they are lost to natural disasters, human destruction, or the passage of time. We discuss their technology, data, and site selection including the upcoming themes of locations and the CyArk 500.</p>
<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">Elizabeth puts out the call to all listeners to share their opinions on what important sites should be included in <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://www.cyark.org/about/the500/">The Cyark 500 Challenge</a> - an effort to digitally preserve 500 of the most culturally important heritage sites within the next five years. You can <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://www.cyark.org/forms/CyArk_500_Submissions.pdf">Nominate a site</a> by submitting a short form at <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://www.cyark.org/">CyArk.org</a></p>
<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">Visit <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://www.cyark.org/projects/">http://www.cyark.org/projects/</a> to view an immersive, interactive experience of many of the sites preserved.</p>]]></description>
<enclosure length="27965565" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Cyark.mp3" />
<itunes:duration>23:19</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[with Elizabeth Lee]]></itunes:subtitle>
</item>
<item>
<title>[MINI] A Critical Examination of a Study of Marriage by Political Affiliation</title>
<pubDate>Fri, 29 May 2015 07:07:34 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[dec997af6f57de553cb67023b9433813]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep56_a-critical-examination-of-a-study-of-marriage-by-political-affiliation.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">Linhda and Kyle review a New York Times article titled </span><a style="color: #337ab7; text-decoration: none; font-family: sans-serif; font-size: 14px; line-height: 24px;" href="http://www.nytimes.com/interactive/2015/05/15/upshot/the-places-that-discourage-marriage-most.html">How Your Hometown Affects Your Chances of Marriage</a><span style="color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">. This article explores research about what correlates with the likelihood of being married by age 26 by county. Kyle and LinhDa discuss some of the fine points of this research and the process of identifying factors for consideration.</span></p>]]></description>
<enclosure length="12475475" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/marriage-analysis.mp3" />
<itunes:duration>10:24</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[Linhda and Kyle review a New York Times article titled How Your Hometown Affects Your Chances of Marriage. This article explores research about what correlates with the likelihood of being married by age 26 by county. Kyle and LinhDa discuss some...]]></itunes:subtitle>
</item>
<item>
<title>Detecting Cheating in Chess</title>
<pubDate>Fri, 22 May 2015 05:37:49 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[070447a4cef6e418f53c0fa0d2968ee6]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep55_detecting-cheating-in-chess.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">With the advent of algorithms capable of beating highly ranked chess players, the temptation to cheat has emmerged as a potential threat to the integrity of this ancient and complex game. Yet, there are aspects of computer play that are measurably different than human play. Dr. Kenneth Regan has developed a methodology for looking at a long series of modes and measuring the likelihood that the moves may have been selected by an algorithm.</p>
<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">The <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://dataskeptic.com/trans/ep55_detecting-cheating-in-chess.php">full transcript</a> of this episode is well annotated and has a wealth of excellent links to the things discussed.</p>
<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">If you're interested in learning more about Dr. Regan, his homepage (<a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://www.cse.buffalo.edu/~regan/">Kenneth Regan</a>), his page on <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="https://chessprogramming.wikispaces.com/Kenneth+Wingate+Regan">wikispaces</a>, and the amazon page of books by <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://www.amazon.com/Kenneth-W.-Regan/e/B00J3G6JT8/ref=sr_ntt_srch_lnk_1?qid=1432233233&sr=1-1">Kenneth W. Regan</a> are all great resources.</p>]]></description>
<enclosure length="53503916" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/detecting-cheating-in-chess.mp3" />
<itunes:duration>44:35</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[with Dr. Kenneth Regan]]></itunes:subtitle>
</item>
<item>
<title>[MINI] z-scores</title>
<pubDate>Fri, 15 May 2015 05:08:03 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[6f45383e523b8da393b058122b8b247c]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep54_z-scores.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/e/1/9/b/e19bf100b7f7e8b5/z-scores.png" />
<description><![CDATA[<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">This week's episode dicusses z-scores, also known as standard score. This score describes the distance (in standard deviations) that an observation is away from the mean of the population. A closely related top is the <a style="color: #337ab7; text-decoration: none; background-color: transparent;" href="http://en.wikipedia.org/wiki/68%E2%80%9395%E2%80%9399.7_rule">68-95-99.7 rule</a> which tells us that (approximately) 68% of a normally distributed population lies within one standard deviation of the mean, 95 within 2, and 99.7 within 3.</p>
<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">Kyle and Linh Da discuss z-scores in the context of human height. If you'd like to calculate your own z-score for height, you can do so below. They further discuss how a z-score can also describe the likelihood that some statistical result is due to chance. Thus, if the significance of a finding can be said to be <span id="MathJax-Element-1-Frame" class="MathJax" style="display: inline; line-height: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px;"><span id="MathJax-Span-1" class="math" style="transition: none; -webkit-transition: none; display: inline-block; position: static; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px; width: 1.374em;"><span style="transition: none; -webkit-transition: none; display: inline-block; position: relative; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px; width: 1.089em; height: 0px; font-size: 17.5px;"><span style="transition: none; -webkit-transition: none; position: absolute; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px; clip: rect(1.66em 1000.003em 2.689em -999.997em); top: -2.511em; left: 0.003em;"><span id="MathJax-Span-2" class="mrow" style="transition: none; -webkit-transition: none; display: inline; position: static; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px;"><span id="MathJax-Span-3" class="mn" style="transition: none; -webkit-transition: none; display: inline; position: static; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px; font-family: STIXGeneral-Regular;">3</span><span id="MathJax-Span-4" class="mi" style="transition: none; -webkit-transition: none; display: inline; position: static; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px; font-family: STIXGeneral-Italic;">σ</span></span></span></span></span></span>, that means that it's 99.7% likely not due to chance, or only 0.3% likely to be due to chance.</p>]]></description>
<enclosure length="12518316" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/z-scores.mp3" />
<itunes:duration>10:26</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>standard,distribution,normal,deviation,kurtosis,zscore,gausian,skewness</itunes:keywords>
<itunes:subtitle><![CDATA[This week's episode dicusses z-scores, also known as standard score. This score describes the distance (in standard deviations) that an observation is away from the mean of the population. A closely related top is the 68-95-99.7 rule which...]]></itunes:subtitle>
</item>
<item>
<title>Using Data to Help Those in Crisis</title>
<pubDate>Fri, 08 May 2015 10:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[b5faa5780f11e8bd4e3d8ca485171cdb]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep53_using-data-to-help-those-in-crisis.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/9/9/7/6/9976a16c7ce8f69e/crisis.jpg" />
<description><![CDATA[<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">This week Noelle Sio Saldana discusses her volunteer work at Crisis Text Line - a 24/7 service that connects anyone with crisis counselors. In the episode we discuss Noelle's career and how, as a participant in the Pivotal for Good program (a partnership with DataKind), she spent three months helping find insights in the messaging data collected by Crisis Text Line. These insights helped give visibility into a number of different aspects of Crisis Text Line's services. Listen to this episode to find out how!</p>
<p style="margin: 0px 0px 10px; color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">If you or someone you know is in a moment of crisis, there's someone ready to talk to you by texting the shortcode 741741.</p>]]></description>
<enclosure length="41725304" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Crisis_Text_Line.mp3" />
<itunes:duration>34:47</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>data,philanthropy,line,text,crisis,kind</itunes:keywords>
<itunes:subtitle><![CDATA[A DataKind project with Crisis Text Line and Pivotal for Good]]></itunes:subtitle>
</item>
<item>
<title>The Ghost in the MP3</title>
<pubDate>Fri, 01 May 2015 05:57:32 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[0caaaaad476c906023d336775439847d]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep52_the-ghost-in-the-mp3-with-Ryan-Maguire.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">Have you ever wondered what is lost when you compress a song into an MP3? This week's guest Ryan Maguire did more than that. He worked on software to issolate the sounds that are lost when you convert a lossless digital audio recording into a compressed MP3 file.</p>
<p style="color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">To complete his project, Ryan worked primarily in python using the <a href="http://ajaxsoundstudio.com/software/pyo/">pyo</a> library as well as the <a href="https://github.com/bregmanstudio/BregmanToolkit">Bregman Toolkit</a></p>
<p style="color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">Ryan mentioned humans having a dynamic range of hearing from <a href="https://www.youtube.com/watch?v=qNf9nzvnd1k">20 hz to 20,000 hz</a>, if you'd like to hear those tones, check the previous link.</p>
<p style="color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">If you'd like to know more about our guest <a href="http://www.ryanmaguiremusic.com/">Ryan Maguire</a><a> you can find his website at the previous link. To follow The Ghost in the MP3 project, please checkout their </a><a href="https://www.google.com/search?q=the+ghost+in+the+mp3+facebook&oq=the+ghost+in+the+mp3+facebook&aqs=chrome..69i57j69i64l2.3798j0j4&sourceid=chrome&es_sm=91&ie=UTF-8">Facebook page</a>, or on the site<a href="http://theghostinthemp3.com/">theghostinthemp3.com</a>.</p>
<p style="color: #224422; font-family: sans-serif; font-size: 14px; line-height: 24px;">A PDF of Ryan's publication quality write up can be found at this link: <a href="http://www.ryanmaguiremusic.com/media_files/pdf/TheGhostICMC.pdf">The Ghost in the MP3</a> and it is definitely worth the read if you'd like to know more of the technical details.</p>]]></description>
<enclosure length="42440536" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/The_Ghost_in_the_MP3.mp3" />
<itunes:duration>35:22</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords>ghost,mp3,compression,fft</itunes:keywords>
<itunes:subtitle><![CDATA[Have you ever wondered what is lost when you compress a song into an MP3? This week's guest Ryan Maguire did more than that. He worked on software to issolate the sounds that are lost when you convert a lossless digital audio recording into a...]]></itunes:subtitle>
</item>
<item>
<title>Data Fest 2015</title>
<pubDate>Tue, 28 Apr 2015 06:55:04 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[5e84f0223a564051ee25bf1fd70655ed]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep51_data-fest-2015.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>This episode contains converage of the 2015 Data Fest hosted at UCLA.  Data Fest is an analysis competition that gives teams of students 48 hours to explore a new dataset and present novel findings.  This year, data from Edmunds.com was provided, and students competed in three categories: best recommendation, best use of external data, and best visualization.</p>]]></description>
<enclosure length="32857777" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Data_Fest_2015.mp3" />
<itunes:duration>27:23</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>data,fest,ucla</itunes:keywords>
<itunes:subtitle><![CDATA[This episode contains converage of the 2015 Data Fest hosted at UCLA.  Data Fest is an analysis competition that gives teams of students 48 hours to explore a new dataset and present novel findings.  This year, data from Edmunds.com was...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Cornbread and Overdispersion</title>
<pubDate>Fri, 24 Apr 2015 07:19:45 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[a51f9c1c1a28f1d5130478ced8271521]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep50_the-cornbread-episode-on-over-dispersion.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>For our 50th episode we enduldge a bit by cooking Linhda's previously mentioned "healthy" cornbread.  This leads to a discussion of the statistical topic of overdispersion in which the variance of some distribution is larger than what one's underlying model will account for.</p>]]></description>
<enclosure length="12924054" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Cornbread_and_Overdispersion.mp3" />
<itunes:duration>15:47</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>recipe,cornbread,overdispersion</itunes:keywords>
<itunes:subtitle><![CDATA[For our 50th episode we enduldge a bit by cooking Linhda's previously mentioned "healthy" cornbread.  This leads to a discussion of the statistical topic of overdispersion in which the variance of some distribution is larger than what...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Natural Language Processing</title>
<pubDate>Fri, 17 Apr 2015 06:44:56 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[5f98d606f25c9371356fd9d40bafad3f]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep49_natural-language-processing.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">This episode overviews some of the fundamental concepts of natural language processing including stemming, n-grams, part of speech tagging, and th bag of words approach.</span></p>]]></description>
<enclosure length="16140455" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/nlp.mp3" />
<itunes:duration>13:27</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>of,language,words,processing,speech,natural,part,bag,tagging,nlp,ngrams,stemming</itunes:keywords>
<itunes:subtitle><![CDATA[This episode overviews some of the fundamental concepts of natural language processing including stemming, n-grams, part of speech tagging, and th bag of words approach.]]></itunes:subtitle>
</item>
<item>
<title>Computer-based Personality Judgments</title>
<pubDate>Fri, 10 Apr 2015 03:08:41 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[81b51f09dcbe7d643dd87e17a9756e4e]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep48_computer-based-personality-judgments-with-Youyou-Wu.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">Guest Youyou Wu discuses the work she and her collaborators did to measure the accuracy of computer based personality judgments. Using Facebook "like" data, they found that machine learning approaches could be used to estimate user's self assessment of the "big five" personality traits: openness, agreeableness, extraversion, conscientiousness, and neuroticism. Interestingly, the computer-based assessments outperformed some of the assessments of certain groups of human beings. Listen to the episode to learn more.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">The original paper <a href="http://www.pnas.org/content/112/4/1036.full.pdf+html">Computer-based personality judgements are more accurate than those made by humans</a>appeared in the January 2015 volume of the <a href="http://www.pnas.org/">Proceedings of the National Academy of Sciences (PNAS)</a>.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">For her benevolent Youyou recommends <a href="http://www.pnas.org/content/110/15/5802.full">Private traits and attributes are predictable from digital records of human behavior</a> by Michal Kosinski, David Stillwell, and Thore Graepel. It's a similar paper by her co-authors which looks at demographic traits rather than personality traits.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">And for her self-serving recommendation, Youyou has a link that I'm very excited about. You can visit<a href="http://applymagicsauce.com/">ApplyMagicSauce.com</a> to see how this model evaluates <em>your</em> personality based on your Facebook like information. I'd love it if listeners participated in this research and shared your perspective on the results via <a href="https://www.facebook.com/dataskeptic">The Data Skeptic Podcast Facebook page</a>. I'm going to be posting mine there for everyone to see.</p>]]></description>
<enclosure length="38316324" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Computer_Based_Personality_Judgments_with_Youyou_Wu.mp3" />
<itunes:duration>31:56</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords>learning,personality,machine,pnas</itunes:keywords>
<itunes:subtitle><![CDATA[Guest Youyou Wu discuses the work she and her collaborators did to measure the accuracy of computer based personality judgments. Using Facebook "like" data, they found that machine learning approaches could be used to estimate user's self assessment...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Markov Chain Monte Carlo</title>
<pubDate>Fri, 03 Apr 2015 06:24:25 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[491c724a8486005c97d86fd3ef8c38d9]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep47_Markov-chain-monte-carlo.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">This episode explores how going wine testing could teach us about using markov chain monte carlo (mcmc).</span></p>]]></description>
<enclosure length="18985190" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_mcmc.mp3" />
<itunes:duration>15:50</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>wine,tasting,mcmc</itunes:keywords>
<itunes:subtitle><![CDATA[This episode explores how going wine testing could teach us about using markov chain monte carlo (mcmc).]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Markov Chains</title>
<pubDate>Fri, 20 Mar 2015 07:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[b2d17b22a034899302e03aaeffdfdd10]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep46_Markov-Chains.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">This episode introduces the idea of a Markov Chain. A Markov Chain has a set of states describing a particular system, and a probability of moving from one state to another along every valid connected state. Markov Chains are memoryless, meaning they don't rely on a long history of previous observations. The current state of a system depends only on the previous state and the results of a random outcome.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">Markov Chains are a useful way method for describing non-deterministic systems. They are useful for destribing the state and transition model of a stochastic system.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">As examples of Markov Chains, we discuss stop light signals, bowling, and text prediction systems in light of whether or not they can be described with Markov Chains.</p>]]></description>
<enclosure length="13766447" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Markov_Chains.mp3" />
<itunes:duration>11:29</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords>systems,chains,processes,markov,stochastic,nondeterministic</itunes:keywords>
<itunes:subtitle><![CDATA[This episode introduces the idea of a Markov Chain. A Markov Chain has a set of states describing a particular system, and a probability of moving from one state to another along every valid connected state. Markov Chains are memoryless, meaning they...]]></itunes:subtitle>
</item>
<item>
<title>Oceanography and Data Science</title>
<pubDate>Fri, 13 Mar 2015 07:06:06 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[7c4ce44ff8ecbf88a2e08db7dde600f6]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep45_Oceanography-and-Data-Science.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><a style="font-family: 'Lucida Bright', Georgia, serif; font-size: medium;" href="https://twitter.com/nicolegoebel">Nicole Goebel</a><span style="font-family: 'Lucida Bright', Georgia, serif; font-size: medium;"> joins us this week to share her experiences in oceanography studying phytoplankton and other aspects of the ocean and how data plays a role in that science.</span></p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;"> </p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">We also discuss <a href="http://www.thinkful.com/">Thinkful</a> where Nicole and I are both mentors for the Introduction to Data Science course.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">Last but not least, check out Nicole's blog <a href="http://www.datasciencegirl.com/">Data Science Girl</a> and the videos Kyle mentioned on her Youtube channel featuring one on the <a href="https://www.youtube.com/user/nicolegoebel/videos">diversity of phytoplankton and how that changes in time and space</a>.</p>]]></description>
<enclosure length="39891508" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Oceanography_and_Data_Science.mp3" />
<itunes:duration>33:15</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>data,marine,oceanography,phytoplankton</itunes:keywords>
<itunes:subtitle><![CDATA[Nicole Goebel joins us this week to share her experiences in oceanography studying phytoplankton and other aspects of the ocean and how data plays a role in that science.
 
We also discuss Thinkful where Nicole and I are both...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Ordinary Least Squares Regression</title>
<pubDate>Fri, 06 Mar 2015 08:43:33 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[3166421e74cb58401e4f4463795425bc]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ordinary-least-squares.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>This episode explores Ordinary Least Squares or OLS - a method for finding a good fit which describes a given dataset.</p>]]></description>
<enclosure length="21735361" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Ordinary_Least_Squares_Regression.mp3" />
<itunes:duration>18:07</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>regression,squares,ordinary,least,ols</itunes:keywords>
<itunes:subtitle><![CDATA[This episode explores Ordinary Least Squares or OLS - a method for finding a good fit which describes a given dataset.]]></itunes:subtitle>
</item>
<item>
<title>NYC Speed Camera Analysis with Tim Schmeier</title>
<pubDate>Fri, 27 Feb 2015 06:16:05 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[5611b602565f6ea3cce6e30d94264bcd]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep43_NYC-Speed-Camera-Analysis-with-Tim-Schmeier.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">New York State approved the use of automated speed cameras within a specific range of schools. Tim Schmeier did an analysis of publically available data related to these cameras as part of a project at the <a href="http://nycdatascience.com/">NYC Data Science Academy</a>. Tim's work leverages several open data sets to ask the questions: are the speed cameras succeeding in their intended purpose of increasing public safety near schools? What he found using open data may surprise you.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">You can read Tim's write up titled <a href="http://nycdatascience.com/students-work/speed-cameras-revenue-or-public-safety-well-get-you-up-to-speed-in-a-flash/">Speed Cameras: Revenue or Public Safety?</a> on the NYC Data Science Academy blog. His original write up, reproducible analysis, and figures are a great compliment to this episode.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">For his benevolent recommendation, Tim suggests listeners visit <a href="http://www.maddiesfund.org/index.htm">Maddie's Fund</a> - a data driven charity devoted to helping achieve and sustain a no-kill pet nation. And for his self-serving recommendation, <a href="https://www.linkedin.com/pub/timothy-schmeier/46/949/8b9">Tim Schmeier</a> will very shortly be on the job market. If you, your employeer, or someone you know is looking for data science talent, you can reach time at his gmail account which is timothy.schmeier at gmail dot com.</p>]]></description>
<enclosure length="20315345" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/NYC_Speed_Camera_Analysis.mp3" />
<itunes:duration>16:56</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>open,nyc,data,street,cameras</itunes:keywords>
<itunes:subtitle><![CDATA[New York State approved the use of automated speed cameras within a specific range of schools. Tim Schmeier did an analysis of publically available data related to these cameras as part of a project at the NYC Data Science Academy. Tim's work...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] k-means clustering</title>
<pubDate>Fri, 20 Feb 2015 07:38:54 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[0495bdb47bc4ccb2776a5bdb1effa7c8]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/k-means-clustering.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>The k-means clustering algorithm is an algorithm that computes a deterministic label for a given "k" number of clusters from an n-dimensional datset.  This mini-episode explores how Yoshi, our lilac crowned amazon's biological processes might be a useful way of measuring where she sits when there are no humans around.  Listen to find out how!</p>]]></description>
<enclosure length="17184308" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_k-means_clustering.mp3" />
<itunes:duration>14:20</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>learning,unsupervised,kmeans</itunes:keywords>
<itunes:subtitle><![CDATA[The k-means clustering algorithm is an algorithm that computes a deterministic label for a given "k" number of clusters from an n-dimensional datset.  This mini-episode explores how Yoshi, our lilac crowned amazon's biological processes might be...]]></itunes:subtitle>
</item>
<item>
<title>Shadow Profiles on Social Networks</title>
<pubDate>Fri, 13 Feb 2015 02:26:36 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[04a6c6c4ca99b6382e5b586ee44c95c2]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep41_Shadow-Profiles-on-Social-Networks-with-Emre-Sarigol.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;"><a href="https://www.sg.ethz.ch/team/people/esarigol/">Emre Sarigol</a> joins me this week to discuss his paper <a href="http://arxiv.org/abs/1409.6197">Online Privacy as a Collective Phenomenon</a>. This paper studies data collected from social networks and how the sharing behaviors of individuals can unintentionally reveal private information about other people, including those that have not even joined the social network! For the specific test discussed, the researchers were able to accurately predict the sexual orientation of individuals, even when this information was withheld during the training of their algorithm.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">The research produces a surprisingly accurate predictor of this private piece of information, and was constructed only with publically available data from myspace.com found on archive.org. As Emre points out, this is a small shadow of the potential information available to modern social networks. For example, users that install the Facebook app on their mobile phones are (perhaps unknowningly) sharing all their phone contacts. Should a social network like Facebook choose to do so, this information could be aggregated to assemble "shadow profiles" containing rich data on users who may not even have an account.</p>]]></description>
<enclosure length="46325467" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Shadow_Profiles_on_Social_Networks.mp3" />
<itunes:duration>38:37</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>facebook,myspace,shadow,privacy,profiles,deanonymization</itunes:keywords>
<itunes:subtitle><![CDATA[Emre Sarigol joins me this week to discuss his paper Online Privacy as a Collective Phenomenon. This paper studies data collected from social networks and how the sharing behaviors of individuals can unintentionally reveal private...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] The Chi-Squared Test</title>
<pubDate>Fri, 06 Feb 2015 05:58:44 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[506341926d902b8d1ebe403ee71a1bd9]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep40_chi_sq_test.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">The </span><span id="MathJax-Element-1-Frame" class="MathJax" style="display: inline; font-size: medium; word-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; color: #224422; font-family: 'Lucida Bright', Georgia, serif;"><span id="MathJax-Span-1" class="math" style="transition: none; -webkit-transition: none; display: inline-block; position: static; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px; width: 1.353em;"><span style="transition: none; -webkit-transition: none; display: inline-block; position: relative; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px; width: 1.052em; height: 0px; font-size: 20px;"><span style="transition: none; -webkit-transition: none; position: absolute; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px; clip: rect(0.003em 1000.002em 1.353em -999.998em); top: -0.997em; left: 0.003em;"><span id="MathJax-Span-2" class="mrow" style="transition: none; -webkit-transition: none; display: inline; position: static; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px;"><span id="MathJax-Span-3" class="msubsup" style="transition: none; -webkit-transition: none; display: inline; position: static; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px;"><span style="transition: none; -webkit-transition: none; display: inline-block; position: relative; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px; width: 1.002em; height: 0px;"><span style="transition: none; -webkit-transition: none; position: absolute; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px; clip: rect(3.402em 1000.002em 4.353em -999.998em); top: -3.998em; left: 0.003em;"><span id="MathJax-Span-4" class="mi" style="transition: none; -webkit-transition: none; display: inline; position: static; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px; font-family: STIXGeneral-Italic;">χ</span></span><span style="transition: none; -webkit-transition: none; position: absolute; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px; top: -4.348em; left: 0.552em;"><span id="MathJax-Span-5" class="mn" style="transition: none; -webkit-transition: none; display: inline; position: static; border: 0px; padding: 0px; margin: 0px; vertical-align: 0px; font-size: 14.1400003433228px; font-family: STIXGeneral-Regular;">2</span></span></span></span></span></span></span></span></span><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;"> (</span><a style="font-family: 'Lucida Bright', Georgia, serif; font-size: medium;" href="http://en.wikipedia.org/wiki/Chi-square_test">Chi-Squared</a><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">) test is a methodology for hypothesis testing. When one has categorical data, in the form of frequency counts or observations (e.g. Vegetarian, Pescetarian, and Omnivore), split into two or more categories (e.g. Male, Female), a question may arrise such as "Are women more likely than men to be vegetarian?" or put more accurately, "Is any observed difference in the frequency with which women report being vegetarian differ in a statistically significant way from the frequency men report that?"</span></p>]]></description>
<enclosure length="21024308" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Chi-Squared_Test.mp3" />
<itunes:duration>17:32</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>crime,testing,hypothesis,miniepisode,chisquared</itunes:keywords>
<itunes:subtitle><![CDATA[The χ2 (Chi-Squared) test is a methodology for hypothesis testing. When one has categorical data, in the form of frequency counts or observations (e.g. Vegetarian, Pescetarian, and Omnivore), split into two or more categories (e.g. Male,...]]></itunes:subtitle>
</item>
<item>
<title>Mapping Reddit Topics with Randy Olson</title>
<pubDate>Fri, 30 Jan 2015 09:00:37 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[8c5916b08cd552f4cc63c14614116990]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep39_mapping-reddit-topics.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">My quest this week is noteworthy a.i. researcher <a href="https://twitter.com/randal_olson">Randy Olson</a> who joins me to share his work creating the <a href="http://www.randalolson.com/2014/10/27/the-reddit-world-map/">Reddit World Map</a> - a visualization that illuminates clusters in the reddit community based on user behavior.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">Randy's blog post on <a href="http://www.randalolson.com/2014/10/27/the-reddit-world-map/">created the reddit world map</a> is well complimented by a more detailed write up titled <a href="http://arxiv.org/abs/1312.3387">Navigating the massive world of reddit: using backbone networks to map user interests in social media</a>. Last but not least, an interactive version of the results (which leverages <a href="http://gephi.github.io/">Gephi</a>) can be found <a href="http://rhiever.github.io/redditviz/clustered/">here</a>.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">For a benevolent recommendation, Randy suggetss people check out <a href="http://stanford.edu/~mwaskom/software/seaborn/">Seaborn</a> - a python library for statistical data visualization. For a self serving recommendation, Randy recommends listeners visit the <a href="http://www.reddit.com/r/dataisbeautiful">Data is beautiful</a> subreddit where he's a moderator.</p>]]></description>
<enclosure length="35938659" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Mapping_Reddit_Topics.mp3" />
<itunes:duration>29:57</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>data,visualization,reddit,viz</itunes:keywords>
<itunes:subtitle><![CDATA[My quest this week is noteworthy a.i. researcher Randy Olson who joins me to share his work creating the Reddit World Map - a visualization that illuminates clusters in the reddit community based on user behavior.
Randy's blog...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Partially Observable State Spaces</title>
<pubDate>Fri, 23 Jan 2015 07:41:59 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[9b37746063da719acf720d6141595371]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/partially-observable-state-spaces.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>When dealing with dynamic systems that are potentially undergoing constant change, its helpful to describe what "state" they are in.  In many applications the manner in which the state changes from one to another is not completely predictable, thus, there is uncertainty over how it transitions from state to state.  Further, in many applications, one cannot directly observe the true state, and thus we describe such situations as partially observable state spaces.  This episode explores what this means and why it is important in the context of chess, poker, and the mood of Yoshi the lilac crowned amazon parrot.</p>]]></description>
<enclosure length="15287818" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Partially_Observable_State_Spaces.mp3" />
<itunes:duration>12:45</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>poker,chess,parrot</itunes:keywords>
<itunes:subtitle><![CDATA[When dealing with dynamic systems that are potentially undergoing constant change, its helpful to describe what "state" they are in.  In many applications the manner in which the state changes from one to another is not completely predictable,...]]></itunes:subtitle>
</item>
<item>
<title>Easily Fooling Deep Neural Networks</title>
<pubDate>Fri, 16 Jan 2015 04:04:05 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[b525d5764ce20bd71a169b41791c2780]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep37_easily-fooling-deep-neural-networks.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">My guest this week is Anh Nguyen, a PhD student at the University of Wyoming working in the </span><a style="font-family: 'Lucida Bright', Georgia, serif; font-size: medium;" href="http://www.evolvingai.org/">Evolving AI lab</a><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">. The episode discusses the paper </span><a style="font-family: 'Lucida Bright', Georgia, serif; font-size: medium;" href="http://arxiv.org/pdf/1412.1897v2.pdf">Deep Neural Networks are Easily Fooled [pdf]</a><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;"> by Anh Nguyen, Jason Yosinski, and Jeff Clune. It describes a process for creating images that a trained deep neural network will mis-classify. If you have a deep neural network that has been trained to recognize certain types of objects in images, these "fooling" images can be constructed in a way which the network will mis-classify them. To a human observer, these fooling images often have no resemblance whatsoever to the assigned label. Previous work had shown that some images which appear to be unrecognizable white noise images to us can fool a deep neural network. This paper extends the result showing abstract images of shapes and colors, many of which have form (just not the one the network thinks) can also trick the network.</span></p>]]></description>
<enclosure length="34085532" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Easily_fooling_deep_neural_networks_1.mp3" />
<itunes:duration>28:25</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>networks,data,mining,deep,learning,neural</itunes:keywords>
<itunes:subtitle><![CDATA[My guest this week is Anh Nguyen, a PhD student at the University of Wyoming working in the Evolving AI lab. The episode discusses the paper Deep Neural Networks are Easily Fooled [pdf] by Anh Nguyen, Jason Yosinski, and Jeff Clune. It...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Data Provenance</title>
<pubDate>Fri, 09 Jan 2015 02:14:18 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[1df0ed270b044cc1f90c8753aae9f11c]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep36_data-provenance.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">This episode introduces a high level discussion on the topic of Data Provenance, with more MINI episodes to follow to get into specific topics. Thanks to listener Sara L who wrote in to point out the Data Skeptic Podcast has focused alot about <em>using</em> data to be skeptical, but not necessarily being skeptical <em>of</em> data.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">Data Provenance is the concept of knowing the full origin of your dataset. Where did it come from? Who collected it? How as it collected? Does it combine independent sources or one singular source? What are the error bounds on the way it was measured? These are just some of the questions one should ask to understand their data. After all, if the antecedent of an argument is built on dubious grounds, the consequent of the argument is equally dubious.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">For a more technical discussion than what we get into in this mini epiosode, I recommend <a href="http://www.cs.indiana.edu/pub/techreports/TR618.pdf">A Survey of Data Provenance Techniques</a> by authors Simmhan, Plale, and Gannon.</p>]]></description>
<enclosure length="13112341" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Data_Provenance.mp3" />
<itunes:duration>10:56</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>data,provenance</itunes:keywords>
<itunes:subtitle><![CDATA[This episode introduces a high level discussion on the topic of Data Provenance, with more MINI episodes to follow to get into specific topics. Thanks to listener Sara L who wrote in to point out the Data Skeptic Podcast has focused alot...]]></itunes:subtitle>
</item>
<item>
<title>Doubtful News, Geology, Investigating Paranormal Groups, and Thinking Scientifically with Sharon Hill</title>
<pubDate>Sat, 03 Jan 2015 04:36:36 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[c72a7bc437bfd4285abfbc3b4afdd180]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep35_doubtful-news-geology-and-thinking-scientifically-with-Sharon-Hill.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">I had the change to speak with well known </span><a style="font-family: 'Lucida Bright', Georgia, serif; font-size: medium;" href="http://sharonahill.com/">Sharon Hill</a><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;"> (</span><a style="font-family: 'Lucida Bright', Georgia, serif; font-size: medium;" href="http://twitter.com/idoubtit">@idoubtit</a><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">) for the first episode of 2015. We discuss a number of interesting topics including the contributions </span><a style="font-family: 'Lucida Bright', Georgia, serif; font-size: medium;" href="http://doubtfulnews.com/">Doubtful News</a><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;"> makes to getting scientific and skeptical information ranked highly in search results, sink holes, why earthquakes are hard to predict, and data collection about paranormal groups via the internet.</span></p>]]></description>
<enclosure length="37751557" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Sharon_Hill.mp3" />
<itunes:duration>31:28</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>news,paranormal,skepticism,investigation,earthquakes,geology,doubtful</itunes:keywords>
<itunes:subtitle><![CDATA[I had the change to speak with well known Sharon Hill (@idoubtit) for the first episode of 2015. We discuss a number of interesting topics including the contributions Doubtful News makes to getting scientific and skeptical...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Belief in Santa</title>
<pubDate>Fri, 26 Dec 2014 07:36:04 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[e48f47748897090f3d0fec268e99287a]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/belief-in-santa.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>In this quick holiday episode, we touch on how one would approach modeling the statistical distribution over the probability of belief in Santa Claus given age.</p>]]></description>
<enclosure length="8991064" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Belief_in_Santa_Claus.mp3" />
<itunes:duration>09:55</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>christmas,santa,claus</itunes:keywords>
<itunes:subtitle><![CDATA[In this quick holiday episode, we touch on how one would approach modeling the statistical distribution over the probability of belief in Santa Claus given age.]]></itunes:subtitle>
</item>
<item>
<title>Economic Modeling and Prediction, Charitable Giving, and a Follow Up with Peter Backus</title>
<pubDate>Fri, 19 Dec 2014 08:01:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[2038d446c3a4fad79e76b8f994f78fa5]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep33_Economic-Modeling-and-Prediction-with-Peter-Backus.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">Economist Peter Backus joins me in this episode to discuss a few interesting topics. You may recall Linhda and I previously discussed his paper "<a href="http://www2.warwick.ac.uk/fac/soc/economics/staff/pbackus/girlfriend">The Girlfriend Equation</a>" on a recent mini-episode. We start by touching base on this fun paper and get a follow up on where Peter stands years after writing w.r.t. a successful romantic union. Additionally, we delve in to some fascinating economics topics.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">We touch on questions of the role models, for better or for worse, played a role in the ~2008 economic crash, statistics in economics and the difficulty of measurement, and some insightful discussion about the economics charities. Peter encourages listeners to be open to giving money to charities that are good at fundraising, and his arguement is a (for me) suprisingly insightful logic. Lastly, we have a teaser of some of Peter's upcoming work using unconventional data sources.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">For his benevolent recommendation, Peter recommended the book <a href="http://www.amazon.com/The-Conquest-Happiness-Bertrand-Russell/dp/0871401622">The Conquest of Happiness</a> by Bertrand Russell, and for his self-serving recommendation, follow Peter on twitter at <a href="https://twitter.com/Awesomnomics">@Awesomnomics</a>.</p>]]></description>
<enclosure length="28448830" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Peter_Backus.mp3" />
<itunes:duration>23:43</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>love,charity,giving,economics,charitable,girlfriend</itunes:keywords>
<itunes:subtitle><![CDATA[Economist Peter Backus joins me in this episode to discuss a few interesting topics. You may recall Linhda and I previously discussed his paper "The Girlfriend Equation" on a recent mini-episode. We start by touching base on this fun paper and get a...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] The Battle of the Sexes</title>
<pubDate>Fri, 12 Dec 2014 02:34:20 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[08b08c5b7b777b51fade4ecac97448ff]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep32_battle-of-the-sexes.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">Love and Data is the continued theme in this mini-episode as we discuss the game theory example of The Battle of the Sexes. In this textbook example, a couple must strategize about how to spend their Friday night. One partner prefers football games while the other partner prefers to attend the opera. Yet, each person would rather be at their non-preferred location so long as they are still with their spouse. So where should they decide to go?</span></p>]]></description>
<enclosure length="21672145" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINIBattle_of_the_sexes.mp3" />
<itunes:duration>18:04</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>love,mixed,game,theory,strategies,equilibrium,equilibria</itunes:keywords>
<itunes:subtitle><![CDATA[Love and Data is the continued theme in this mini-episode as we discuss the game theory example of The Battle of the Sexes. In this textbook example, a couple must strategize about how to spend their Friday night. One partner prefers football games...]]></itunes:subtitle>
</item>
<item>
<title>The Science of Online Data at Plenty of Fish with Thomas Levi</title>
<pubDate>Fri, 05 Dec 2014 08:07:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[324c65354b33e9a641a2809ee2d85c3a]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep31_plenty-of-fish-data-science-approaches-with-thomas-levi.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">Can algorithms help you find love? Many happy couples successfully brought together via online dating websites show us that data science can help you find love. I'm joined this week by Thomas Levi, Senior Data Scientist at <a href="http://www.pof.com/">Plenty of Fish</a>, to discuss some of his work which helps people find one another as efficiently as possible.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">Matchmaking is a truly non-trivial problem, and one that's dynamically changing all the time as new users join and leave the "pool of fish". This episode explores the aspects of what makes this a tough problem and some of the ways POF has been successfully using data science to solve it, and continues to try to innovate with new techniques like interest matching.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">For his benevolent references, Thomas suggests readers check out <a href="http://www.amazon.com/All-Statistics-Statistical-Inference-Springer/dp/0387402721">All of Statistics</a> as well as the <a href="http://topepo.github.io/caret/index.html">caret</a>library for R. And for a self serving recommendation, follow him on twitter (<a href="https://twitter.com/tslevi">@tslevi</a>) or connect with<a href="https://ca.linkedin.com/pub/thomas-levi/32/94/40a">Thomas Levi on Linkedin</a>.</p>]]></description>
<enclosure length="70504928" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/The20Science20of20Online20Data20at20Plenty20of20Fish20with20Thomas20Levi.mp3" />
<itunes:duration>58:46</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>and,love,of,science,fish,online,dating,data,plenty,algorithms,matchmaking,pof</itunes:keywords>
<itunes:subtitle><![CDATA[Can algorithms help you find love? Many happy couples successfully brought together via online dating websites show us that data science can help you find love. I'm joined this week by Thomas Levi, Senior Data Scientist at Plenty of Fish, to...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] The Girlfriend Equation</title>
<pubDate>Fri, 28 Nov 2014 08:03:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[72f854852237ddf76993e50e8436b422]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep30_the_girlfriend_equation.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">Economist Peter Backus put forward "The Girlfriend Equation" while working on his PhD - a probabilistic model attempting to estimate the likelihood of him finding a girlfriend. In this mini episode we explore the soundness of his model and also share some stories about how Linhda and Kyle met.</span></p>]]></description>
<enclosure length="19405239" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_The_Girlfriend_Equation.mp3" />
<itunes:duration>16:11</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>love,dating,girlfriend,equation</itunes:keywords>
<itunes:subtitle><![CDATA[Economist Peter Backus put forward "The Girlfriend Equation" while working on his PhD - a probabilistic model attempting to estimate the likelihood of him finding a girlfriend. In this mini episode we explore the soundness of his model and also share...]]></itunes:subtitle>
</item>
<item>
<title>The Secret and the Global Consciousness Project with Alex Boklin</title>
<pubDate>Fri, 21 Nov 2014 08:05:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[f0f6d734996d4289c1da372743e00ceb]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep29_the-secret-and-the-global-consciousness-project.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">I'm joined this week by Alex Boklin to explore the topic of magical thinking especially in the context of Rhonda Byrne's "The Secret", and the similarities it bears to The Global Consciousness Project (GCP). The GCP puts forward the hypothesis that random number generators elicit statistically significant changes as a result of major world events.</span></p>]]></description>
<enclosure length="50086055" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/The_Secret_and_the_Global_Consciousness_Project.mp3" />
<itunes:duration>41:45</itunes:duration>
<itunes:explicit>yes</itunes:explicit>
<itunes:keywords>the,secret,global,project,rhonda,consciousness,byrne</itunes:keywords>
<itunes:subtitle><![CDATA[I'm joined this week by Alex Boklin to explore the topic of magical thinking especially in the context of Rhonda Byrne's "The Secret", and the similarities it bears to The Global Consciousness Project (GCP). The GCP puts forward the hypothesis that...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Monkeys on Typewriters</title>
<pubDate>Fri, 14 Nov 2014 03:18:54 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[87d86e0f7e98ed6fd388d93fae3f4fe1]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep28_random-numbers.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p class="p1"><span class="s1">What is randomness? How can we determine if some results are randomly generated or not? Why are random numbers important to us in our everyday life? These topics and more are discussed in this mini-episode on random numbers.</span></p>
<p>Many readers will be vaguely familar with the idea of "X number of monkeys banging on Y number of typewriters for Z number of years" - the idea being that such a setup would produce random sequences of letters. The origin of this idea was the mathemetician Borel who was interested in whether or not 1,000,000 monkeys working for 10 hours per day might eventually reproduce the works of shakespeare.</p>
<p class="p1"><span class="s1">We explore this topic and provide some further details in the show notes which you can find over at <a href="http://dataskeptic.com">dataskeptic.com</a></span></p>]]></description>
<enclosure length="20405206" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Random_Numbers.mp3" />
<itunes:duration>03:05</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords>on,monkeys,random,randomness,uniform,entropy,typewriters</itunes:keywords>
<itunes:subtitle><![CDATA[What is randomness? How can we determine if some results are randomly generated or not? Why are random numbers important to us in our everyday life? These topics and more are discussed in this mini-episode on random numbers.
Many readers will be...]]></itunes:subtitle>
</item>
<item>
<title>Mining the Social Web with Matthew Russell</title>
<pubDate>Fri, 07 Nov 2014 06:36:43 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[fb0717157059388bb1e7199a3ce4e2f3]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep27_mining-the-social-web.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">This week's episode explores the possibilities of extracting novel insights from the many great social web APIs available. Matthew Russell's <a href="http://miningthesocialweb.com/">Mining the Social Web</a> is a fantastic exploration of the tools and methods, and we explore a few related topics.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">One helpful feature of the book is it's use of a <a href="https://www.vagrantup.com/">Vagrant</a> virtual machine. Using it, readers can easily reproduce the examples from the book, and there's a short video available that will walk you through <a href="http://vimeo.com/72383764">setting up the Mining the Social Web virtual machine</a>.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">The book also has an accompanying github repository which can be found <a href="https://github.com/ptwobrussell/Mining-the-Social-Web-2nd-Edition">here</a>.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">A quote from Matthew that particularly reasonates for me was "The first commandment of Data Science is to 'Know thy data'." Take a listen for a little more context around this sage advice.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">In addition to the book, we also discuss some of the work done by <a href="http://www.digitalreasoning.com/">Digital Reasoning</a> where Matthew serves as CTO. One of their products we spend some time discussing is <a href="http://www.digitalreasoning.com/uncommon-technology/intro-synthesys">Synthesys</a>, a service that processes unstructured data and delivers knowledge and insight extracted from the data.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">Some listeners might already be familiar with Digital Reasoning from recent coverage in Fortune Magazine on their <a href="http://fortune.com/2014/08/14/digital-reasoning-cognitive-computing/">cognitive computing</a> efforts.</p>
<p style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">For his benevolent recommendation, Matthew recommends the <a href="http://www.dancarlin.com/hardcore-history-series/">Hardcore History Podcast</a>, and for his self-serving recommendation, Matthew mentioned that they are currently hiring for <a href="http://www.digitalreasoning.com/careers">Data Science job opportunities at Digital Reasoning</a> if any listeners are looking for new opportunities.</p>]]></description>
<enclosure length="60369940" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Mining_the_Social_Web.mp3" />
<itunes:duration>50:19</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>social,web,computing,digital,cognitive,reasoning,apis</itunes:keywords>
<itunes:subtitle><![CDATA[This week's episode explores the possibilities of extracting novel insights from the many great social web APIs available. Matthew Russell's Mining the Social Web is a fantastic exploration of the tools and methods, and we explore a few...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Is the Internet Secure?</title>
<pubDate>Fri, 31 Oct 2014 07:41:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[98a4dafd6a25a2d0fc8b6ace4ce64e23]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/is-the-internet-secure.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>This episode explores the basis of why we can trust encryption.  Suprisingly, a discussion of looking up a word in the dictionary (binary search) and efficiently going wine tasting (the travelling salesman problem) help introduce computational complexity as well as the P ?= NP question, which is paramount to the trustworthiness RSA encryption.</p>
<p>With a high level foundation of computational theory, we talk about NP problems, and why prime factorization is a difficult problem, thus making it a great basis for the RSA encryption algorithm, which most of the internet uses to encrypt data.  Unlike the encryption scheme Ray Romano used in "Everybody Loves Raymond", RSA has nice theoretical foundations.</p>
<p>It should be noted that although this episode gives good reason to trust that properly encrypted data, based on well choosen public/private keys where the private key is not compromised, is safe.  However, having safe encryption doesn't necessarily mean that the Internet is secure.  Topics like Man in the Middle attacks as well as the Snowden revelations are a topic for another day, not for this record length "mini" episode.</p>]]></description>
<enclosure length="31421043" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Is_the_Internet_Secure.mp3" />
<itunes:duration>26:11</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>computational,encryption,prime,pnp,complexity,rsa,factorization</itunes:keywords>
<itunes:subtitle><![CDATA[This episode explores the basis of why we can trust encryption.  Suprisingly, a discussion of looking up a word in the dictionary (binary search) and efficiently going wine tasting (the travelling salesman problem) help introduce computational...]]></itunes:subtitle>
</item>
<item>
<title>Practicing and Communicating Data Science with Jeff Stanton</title>
<pubDate>Fri, 24 Oct 2014 05:18:40 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[798edc7cc1994f0f4fa8b5e47f8007d0]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/practicing-and-communicating-data-science.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><a style="font-family: 'Lucida Bright', Georgia, serif; font-size: medium;" href="http://jsresearch.net/">Jeff Stanton</a><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;"> joins me in this episode to discuss his book </span><a style="font-family: 'Lucida Bright', Georgia, serif; font-size: medium;" href="http://101.datascience.community/tag/jeffrey-m-stanton/">An Introduction to Data Science</a><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">, and some of the unique challenges and issues faced by someone doing applied data science. A challenge to any data scientist is making sure they have a good input data set and apply any necessary data munging steps before their analysis. We cover some good advise for how to approach such problems.</span></p>]]></description>
<enclosure length="44325532" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Practicing_and_Communicating_Data_Science.mp3" />
<itunes:duration>36:57</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords>science,data,survey,analysis</itunes:keywords>
<itunes:subtitle><![CDATA[Jeff Stanton joins me in this episode to discuss his book An Introduction to Data Science, and some of the unique challenges and issues faced by someone doing applied data science. A challenge to any data scientist is making sure they have a...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] The T-Test</title>
<pubDate>Fri, 17 Oct 2014 02:49:07 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[33deca5be38f815b530997db73b4a679]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/t-test.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">The t-test is this week's mini-episode topic. The t-test is a statistical testing procedure used to determine if the mean of two datasets differs by a statistically significant amount. We discuss how a wine manufacturer might apply a t-test to determine if the sweetness, acidity, or some other property of two separate grape vines might differ in a statistically meaningful way.</span></p>]]></description>
<enclosure length="20453271" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_The_T-Test.mp3" />
<itunes:duration>17:03</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords>test,wine,statistical,testing,distributed,ttest,normally</itunes:keywords>
<itunes:subtitle><![CDATA[The t-test is this week's mini-episode topic. The t-test is a statistical testing procedure used to determine if the mean of two datasets differs by a statistically significant amount. We discuss how a wine manufacturer might apply a t-test to...]]></itunes:subtitle>
</item>
<item>
<title>Data Myths with Karl Mamer</title>
<pubDate>Fri, 10 Oct 2014 02:35:44 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[e370b842216b317c48b9bb7872f40ef3]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep023.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="color: #224422; font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">This week I'm joined by Karl Mamer to discuss the data behind three well known urban legends. Did a large blackout in New York and surrounding areas result in a baby boom nine months later? Do subliminal messages affect our behavior? Is placing beer alongside diapers a recipe for generating more revenue than these products in separate locations? Listen as Karl and I explore these claims.</span></p>]]></description>
<enclosure length="58170430" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Data_Myths_with_Karl_Mamer.mp3" />
<itunes:duration>48:29</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>beer,baby,boom,walmart,messages,blackout,subliminal</itunes:keywords>
<itunes:subtitle><![CDATA[Black out baby boom | Subliminal messages | Beer and Diapers]]></itunes:subtitle>
</item>
<item>
<title>Contest Announcement</title>
<pubDate>Wed, 08 Oct 2014 04:49:18 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[ffbe8ee49a546f80b10bfd807721d5ba]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep022.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p style="color: rgb(34, 68, 34); font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">The Data Skeptic Podcast is launching a contest- not one of chance, but one of skill. Listeners are encouraged to put their data science skills to good use, or if all else fails, guess!</p>
<p style="color: rgb(34, 68, 34); font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">The contest works as follows. Below is some data about the cumulative number of downloads the podcast has achieved on a few given dates. Your job is to predict the date and time at which the podcast will recieve download number 27,182. Why this arbitrary number? It's as good as any other arbitrary number!</p>
<p style="color: rgb(34, 68, 34); font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">Use whatever means you want to formulate a prediction. Once you have it, wait until that time and then post a review of the Data Skeptic Podcast on iTunes. You don't even have to leave a good review! The review which is posted closest to the actual time at which this download occurs will win a free copy of Matthew Russell's "Mining the Social Web" courtesy of the Data Skeptic Podcast. "Price is Right" rules are in play - the winner is the person that posts their review closest to the actual time without going over.</p>
<p style="color: rgb(34, 68, 34); font-family: 'Lucida Bright', Georgia, serif; font-size: medium;">More information at dataskeptic.com</p>]]></description>
<enclosure length="14747084" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/contest.mp3" />
<itunes:duration>12:18</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>the,social,web,data,mining,modeling,contest,predictive</itunes:keywords>
<itunes:subtitle><![CDATA[The Data Skeptic Podcast is launching a contest- not one of chance, but one of skill. Listeners are encouraged to put their data science skills to good use, or if all else fails, guess!
The contest works as follows. Below is some data about the...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Selection Bias</title>
<pubDate>Fri, 03 Oct 2014 08:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[1bac90c0acb828a82df3681fe2fd2bb2]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/selection-bias.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>A discussion about conducting US presidential election polls helps frame a converation about selection bias.</p>]]></description>
<enclosure length="17422022" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Selection_Bias.mp3" />
<itunes:duration>14:31</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>us,elections,statistical,statistics,bias</itunes:keywords>
<itunes:subtitle><![CDATA[A discussion about conducting US presidential election polls helps frame a converation about selection bias.]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Confidence Intervals</title>
<pubDate>Fri, 26 Sep 2014 05:47:51 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[a839f50bc805c3b47184fbed409c605a]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/confidence-intervals.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/4/b/d/2/4bd2af77219f416d/confidence-intervals.png" />
<description><![CDATA[<p>Commute times and BBQ invites help frame a discussion about the statistical concept of confidence intervals.</p>]]></description>
<enclosure length="13795704" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Confidence_Intervals.mp3" />
<itunes:duration>11:30</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>confidence,interval</itunes:keywords>
<itunes:subtitle><![CDATA[Commute times and BBQ invites help frame a discussion about the statistical concept of confidence intervals.]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Value of Information</title>
<pubDate>Fri, 19 Sep 2014 07:29:19 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[a337510ac895955276cac57a8fd58df6]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/value-of-information.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>A discussion about getting ready in the morning, negotiating a used car purchase, and selecting the best AirBnB place to stay at help frame a conversation about the decision theoretic principal known as the Value of Information equation.</p>]]></description>
<enclosure length="16997794" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Value_of_Information.mp3" />
<itunes:duration>14:10</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords />
<itunes:subtitle><![CDATA[A discussion about getting ready in the morning, negotiating a used car purchase, and selecting the best AirBnB place to stay at help frame a conversation about the decision theoretic principal known as the Value of Information equation.]]></itunes:subtitle>
</item>
<item>
<title>Game Science Dice with Louis Zocchi</title>
<pubDate>Wed, 17 Sep 2014 07:27:08 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[1fe1b7495efdb74f5e449999809a82bc]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep017.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="font-family: Times; font-size: medium;">In this bonus episode, guest Louis Zocchi discusses his background in the gaming industry, specifically, how he became a manufacturer of dice designed to produce statistically uniform outcomes. </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">During the show Louis mentioned a two part video listeners might enjoy: </span><a style="font-family: Times; font-size: medium;" href="https://www.youtube.com/watch?v=NKhpYJzCcSw">part 1</a><span style="font-family: Times; font-size: medium;"> and </span><a style="font-family: Times; font-size: medium;" href="https://www.youtube.com/watch?v=MvLjFBhoFMs">part 2</a><span style="font-family: Times; font-size: medium;"> can both be found on youtube. </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">Kyle mentioned a robot capable of unnoticably cheating at Rock Paper Scissors / Ro Sham Bo. More details can be found </span><a style="font-family: Times; font-size: medium;" href="http://www.bbc.com/news/technology-24803751">here</a><span style="font-family: Times; font-size: medium;">. </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">Louis mentioned dice collector Kevin Cook whose website is </span><a style="font-family: Times; font-size: medium;" href="http://www.dicecollector.com/">DiceCollector.com</a><span style="font-family: Times; font-size: medium;"> </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">While we're on the subject of table top role playing games, Kyle recommends these two related podcasts listeners might enjoy: </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">The Conspiracy Skeptic podcast (on which host Kyle was recently a guest) had a great episode </span><a style="font-family: Times; font-size: medium;" href="http://www.yrad.com/cs/index2013.htm">"Dungeons and Dragons - The Devil's Game?"</a><span style="font-family: Times; font-size: medium;"> which explores claims of D&Ds alleged ties to skepticism. </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">Also, Kyle swears there's a great<a href="http://www.skeptic.com/podcasts/monstertalk/"> </a></span><a href="http://www.skeptic.com/podcasts/monstertalk/">Monster Talk</a><span style="font-family: Times; font-size: medium;"><a href="http://www.skeptic.com/podcasts/monstertalk/"> </a>episode discussing claims of a satanic connection to Dungeons and Dragons, but despite mild efforts to locate it, he came up empty. Regardless, listeners of the Data Skeptic Podcast are encouraged to explore the back catalog to try and find the aforementioned episode of this great podcast. </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">Last but not least, as mentioned in the outro, </span><a style="font-family: Times; font-size: medium;" href="http://www.awesomedice.com/blog/353/d20-dice-randomness-test-chessex-vs-gamescience/">awesomedice.com</a><span style="font-family: Times; font-size: medium;"> did some great independent empirical testing that confirms Game Science dice are much closer to the desired uniform distribution over possible outcomes when compared to one leading manufacturer.</span></p>]]></description>
<enclosure length="56952079" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Game_Science_Dice_with_Louis_Zocchi.mp3" />
<itunes:duration>47:28</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords>science,games,role,game,random,playing,chance,rpgs</itunes:keywords>
<itunes:subtitle><![CDATA[In this bonus episode, guest Louis Zocchi discusses his background in the gaming industry, specifically, how he became a manufacturer of dice designed to produce statistically uniform outcomes. During the show Louis mentioned a two part video...]]></itunes:subtitle>
</item>
<item>
<title>Data Science at ZestFinance with Marick Sinay</title>
<pubDate>Fri, 12 Sep 2014 09:30:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[935a4a467b7ebe9ccf4f52bc730c88c6]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep17_zest-finance-with-marick-sinay.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>Marick Sinay from ZestFianance is our guest this weel.  This episode explores how data science techniques are applied in the financial world, specifically in assessing credit worthiness.</p>
<p> </p>]]></description>
<enclosure length="37692520" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Zest_Finance.mp3" />
<itunes:duration>31:25</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>science,data,credit,financial,underwriting,zestfinance</itunes:keywords>
<itunes:subtitle><![CDATA[Marick Sinay from ZestFianance is our guest this weel.  This episode explores how data science techniques are applied in the financial world, specifically in assessing credit worthiness.
 ]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Decision Tree Learning</title>
<pubDate>Fri, 05 Sep 2014 07:49:54 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[37647ddd83c29c2cee07bac568d61446]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/decision-tree-learning.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/7/5/2/d/752d1ca13b34db35/decision_tree_learning.png" />
<description><![CDATA[<p>Linhda and Kyle talk about Decision Tree Learning in this miniepisode.  Decision Tree Learning is the algorithmic process of trying to generate an optimal decision tree to properly classify or forecast some future unlabeled element based by following each step in the tree.</p>]]></description>
<enclosure length="16175459" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Decision_Tree_Learning.mp3" />
<itunes:duration>13:29</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords>learning,tree,decision,machine,cart,c45</itunes:keywords>
<itunes:subtitle><![CDATA[Linhda and Kyle talk about Decision Tree Learning in this miniepisode.  Decision Tree Learning is the algorithmic process of trying to generate an optimal decision tree to properly classify or forecast some future unlabeled element based by...]]></itunes:subtitle>
</item>
<item>
<title>Jackson Pollock Authentication Analysis with Kate Jones-Smith</title>
<pubDate>Fri, 29 Aug 2014 13:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[71104df99e53e1843b5947c740cb3297]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep014.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="font-family: Times; font-size: medium;">Our guest this week is </span><a style="font-family: Times; font-size: medium;" href="http://www.hamilton.edu/academics/departments/Faculty?dept=Physics">Hamilton physics professor Kate Jones-Smith</a><span style="font-family: Times; font-size: medium;"> who joins us to discuss the evidence for the claim that drip paintings of Jackson Pollock contain fractal patterns. This hypothesis originates in a paper by Taylor, Micolich, and Jonas titled </span><a style="font-family: Times; font-size: medium;" href="http://www.nature.com/nature/journal/v399/n6735/full/399422a0.html">Fractal analysis of Pollock's drip paintings</a><span style="font-family: Times; font-size: medium;"> which appeared in Nature. </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">Kate and co-author </span><a style="font-family: Times; font-size: medium;" href="http://www.phys.cwru.edu/faculty/?mathur">Harsh Mathur</a><span style="font-family: Times; font-size: medium;"> wrote a paper titled </span><a style="font-family: Times; font-size: medium;" href="http://www.nature.com/nature/journal/v444/n7119/full/nature05398.html">Revisiting Pollock's Drip Paintings</a><span style="font-family: Times; font-size: medium;"> which also appeared in Nature. A full text PDF can be found </span><a style="font-family: Times; font-size: medium;" href="http://arxiv.org/pdf/0909.0084v1.pdf">here</a><span style="font-family: Times; font-size: medium;">, but lacks the helpful figures which can be found </span><a style="font-family: Times; font-size: medium;" href="http://www.readcube.com/articles/10.1038/nature05398">here</a><span style="font-family: Times; font-size: medium;">, although two images are blurred behind a paywall. </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">Their paper was covered in the </span><a style="font-family: Times; font-size: medium;" href="http://www.nytimes.com/2006/12/02/books/02frac.html?_r=0">New York Times</a><span style="font-family: Times; font-size: medium;"> as well as in USA Today (albeit with with a much more delightful headline: </span><a style="font-family: Times; font-size: medium;" href="http://usatoday30.usatoday.com/tech/science/columnist/vergano/2006-12-03-pollock-fractals_x.htm">Never mind the Pollock's</a><span style="font-family: Times; font-size: medium;"> [sic]). </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">While discussing the intersection of science and art, the conversation also touched briefly on a few other intersting topics. For example, </span><a style="font-family: Times; font-size: medium;" href="https://www.sciencenews.org/article/ancient-islamic-penrose-tiles-0">Penrose Tiles appearing in islamic art</a><span style="font-family: Times; font-size: medium;"> (pre-dating Roger Penrose's investigation of the interesting properties of these tiling processes), </span><a style="font-family: Times; font-size: medium;" href="http://wwwphy.princeton.edu/~steinh/quasicrystals.html">Quasicrystal designs in art</a><span style="font-family: Times; font-size: medium;">, </span><a style="font-family: Times; font-size: medium;" href="http://www.computer.org/csdl/trans/tp/2012/06/ttp2012061159-abs.html">Automated brushstroke analysis of the works of Vincent van Gogh</a><span style="font-family: Times; font-size: medium;">, and attempts to </span><a style="font-family: Times; font-size: medium;" href="http://www.newyorker.com/magazine/2010/07/12/the-mark-of-a-masterpiece">authenticate a possible work of Leonardo Da Vinci</a><span style="font-family: Times; font-size: medium;"> of uncertain provenance. Last but not least, the conversation touches on the particularly compelling</span><a style="font-family: Times; font-size: medium;" href="http://fp.optics.arizona.edu/SSD/art-optics/index.html">Hockney-Falco Thesis</a><span style="font-family: Times; font-size: medium;"> which is also covered in David Hockney's book </span><a style="font-family: Times; font-size: medium;" href="http://www.amazon.com/Secret-Knowledge-Expanded-Edition-Rediscovering/dp/0142005126/ref=sr_1_1?ie=UTF8&qid=undefined&sr=8-1&keywords=Hockney">Secret Knowledge</a><span style="font-family: Times; font-size: medium;">. </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">For those interested in reading some of Kate's other publications, many </span><a style="font-family: Times; font-size: medium;" href="http://arxiv.org/a/jonessmith_k_1">Katherine Jones-Smith articles</a><span style="font-family: Times; font-size: medium;"> can be found at the given link, all of which have downloadable PDFs.</span></p>]]></description>
<enclosure length="59775393" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Jackson_Pollock_Authentication_Analysis_with_Kate_Jones-Smith.mp3" />
<itunes:duration>49:49</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>art,jackson,review,peer,pollock,fractals,provenance,authentication</itunes:keywords>
<itunes:subtitle><![CDATA[Our guest this week is Hamilton physics professor Kate Jones-Smith who joins us to discuss the evidence for the claim that drip paintings of Jackson Pollock contain fractal patterns. This hypothesis originates in a paper by Taylor, Micolich,...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Noise!!</title>
<pubDate>Fri, 22 Aug 2014 13:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[87a845c4ce3663688818ee177d0d1c4c]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/noise.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/7/9/5/f/795fdd36148adf63/noise.png" />
<description><![CDATA[<p>Our topic for this week is "noise" as in signal vs. noise.  This is not a signal processing discussions, but rather a brief introduction to how the work noise is used to describe how much information in a dataset is useless (as opposed to useful).</p>
<p>Also, Kyle announces having recently had the pleasure of appearing as a guest on <a href="http://www.yrad.com/cs/">The Conspiracy Skeptic Podcast</a> to discussion The Bible Code.  Please check out this other fine program for this and it's many other great episodes.</p>]]></description>
<enclosure length="19264700" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Noise.mp3" />
<itunes:duration>16:04</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>data,processing,noise,signal,governance</itunes:keywords>
<itunes:subtitle><![CDATA[Our topic for this week is "noise" as in signal vs. noise.  This is not a signal processing discussions, but rather a brief introduction to how the work noise is used to describe how much information in a dataset is useless (as opposed to...]]></itunes:subtitle>
</item>
<item>
<title>Guerilla Skepticism on Wikipedia with Susan Gerbic</title>
<pubDate>Fri, 15 Aug 2014 13:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[ab288b5e702c371828ad1f71f769aa58]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep012.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p><span style="font-family: Times; font-size: medium;">Our guest this week is Susan Gerbic. Susan is a skeptical activist involved in many activities, the one we focus on most in this episode is </span><a style="font-family: Times; font-size: medium;" href="http://guerrillaskepticismonwikipedia.blogspot.com/">Guerrilla Skepticism on Wikipedia</a><span style="font-family: Times; font-size: medium;">, an organization working to improve the content and citations of Wikipedia. </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">During the episode, Kyle recommended Susan's talk a The Amazing Meeting 9 which can be found </span><a style="font-family: Times; font-size: medium;" href="https://www.youtube.com/watch?v=5FuJT9mp0jw">here</a><span style="font-family: Times; font-size: medium;">. </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">Some noteworthy topics mentioned during the podcast were </span><a style="font-family: Times; font-size: medium;" href="http://en.wikipedia.org/wiki/Neil_deGrasse_Tyson">Neil deGrasse Tyson's</a><span style="font-family: Times; font-size: medium;"> endorsement of the </span><a style="font-family: Times; font-size: medium;" href="http://www.penny4nasa.org/">Penny for NASA</a><span style="font-family: Times; font-size: medium;"> project. As well as the </span><a style="font-family: Times; font-size: medium;" href="https://www.mywot.com/">Web of Trust</a><span style="font-family: Times; font-size: medium;"> and </span><a style="font-family: Times; font-size: medium;" href="http://rbutr.com/">Rebutr</a> <span style="font-family: Times; font-size: medium;">browser plug ins, as well as how following the </span><a style="font-family: Times; font-size: medium;" href="http://skepticaction.blogspot.com/">Skeptic Action</a><span style="font-family: Times; font-size: medium;"> project on Twitter provides recommendations of sites to visit and rate as you see fit via these tools. </span><br style="font-family: Times; font-size: medium;" /><br style="font-family: Times; font-size: medium;" /><span style="font-family: Times; font-size: medium;">For her benevolent reference, Susan suggested </span><a style="font-family: Times; font-size: medium;" href="http://www.theoddsmustbecrazy.com/">The Odds Must Be Crazy</a><a style="font-family: Times; font-size: medium;">, a fun website that explores the statistical likelihoods of seemingly unlikely situations. For all else, Susan and her various activities can be found via </a><a style="font-family: Times; font-size: medium;" href="http://susangerbic.com/">SusanGerbic.com</a><span style="font-family: Times; font-size: medium;">.</span></p>]]></description>
<enclosure length="83965303" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Guerilla_Skepticism_on_Wikipedia_with_Susan_Gerbic.mp3" />
<itunes:duration>01:09:59</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords>web,independent,group,citations,skepticism,wikipedia,semantic,investigations</itunes:keywords>
<itunes:subtitle><![CDATA[Our guest this week is Susan Gerbic. Susan is a skeptical activist involved in many activities, the one we focus on most in this episode is Guerrilla Skepticism on Wikipedia, an organization working to improve the content and citations of...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Ant Colony Optimization</title>
<pubDate>Fri, 08 Aug 2014 13:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[cfae2f3a596a4572fe009e167b64e5d4]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ant-colony-optimization.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>In this week's mini episode, Linhda and Kyle discuss Ant Colony Optimization - a numerical / stochastic optimization technique which models its search after the process ants employ in using random walks to find a goal (food) and then leaving a pheremone trail in their walk back to the nest.  We even find some way of relating the city of San Francisco and running a restaurant into the discussion.</p>]]></description>
<enclosure length="18137777" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Ant_Colony_Optimization.mp3" />
<itunes:duration>15:07</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>colony,ant,optimization,numerical,stochastic</itunes:keywords>
<itunes:subtitle><![CDATA[In this week's mini episode, Linhda and Kyle discuss Ant Colony Optimization - a numerical / stochastic optimization technique which models its search after the process ants employ in using random walks to find a goal (food) and then leaving a...]]></itunes:subtitle>
</item>
<item>
<title>Data in Healthcare IT with Shahid Shah</title>
<pubDate>Fri, 01 Aug 2014 13:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[f270998a747bfb776f48e30199cb262c]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep010.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>Our guest this week is Shahid Shah. Shahid is CEO at <a href="http://www.netspective.com/">Netspective</a>, and writes three blogs: <a href="http://www.healthcareguy.com/">Health Care Guy</a>, <a href="http://shahid.shah.org/">Shahid Shah</a>, and <a href="http://www.hitsphere.com/">HitSphere - the Healthcare IT Supersite</a>. <br /><br /> During the program, Kyle recommended a talk from the <a href="http://www.mitcio.com/">2014 MIT Sloan CIO Symposium</a> entitled <a href="http://www.mitcio.com/transforming-digital-silos-digital-healthcare-enterprise"> Transforming "Digital Silos" to "Digital Care Enterprise" </a> which was hosted by our guest <a href="http://shahid.shah.org/">Shahid Shah</a>. <br /><br /> In addition to his work in Healthcare IT, he also the chairperson for <a href="http://www.osehra.org/">Open Source Electronic Health Record Alliance</a>, an non-profit organization that, amongst other activities, is hosting an upcoming conference. The 3rd annual <a href="http://www.cvent.com/events/2014-osehra-open-source-ehr-summit-global-collaboration-in-healthcare-it/event-summary-4cca0458427a48a3bd460ab492483f4
0.aspx"> OSEHRA Open Source Summit: Global Collaboration in Healthcare IT </a>, which will be taking place September 3-5, 2014 in Washington DC. <br /><br /> For our benevolent recommendation, Shahid suggested listeners may benefit from taking the time to read <a href="http://www.amazon.com/s/ref=nb_sb_noss_1?url=search-alias%3Daps&field-keywords=LEADERSHIP"> books on leadership</a> for the insights they provide. For our self-serving recommendation, Shahid recommended listeners check out his company <a href="http://www.netspective.com/">Netspective</a> , if you are working with a company looking for help getting started building software utilizing next generation technologies.</p>]]></description>
<enclosure length="68675312" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Data_in_Healthcare_IT_with_Shahid_Shah.mp3" />
<itunes:duration>57:14</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>it,data,health,records,electronic,healthcare,generated,patient,osehra</itunes:keywords>
<itunes:subtitle><![CDATA[Our guest this week is Shahid Shah. Shahid is CEO at Netspective, and writes three blogs: Health Care Guy, Shahid Shah, and HitSphere - the Healthcare IT Supersite. During the program, Kyle recommended a talk from the 2014 MIT Sloan CIO Symposium...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Cross Validation</title>
<pubDate>Fri, 25 Jul 2014 14:51:54 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[184a26bb30dec32c2beaaa12f47243e3]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/cross-validation.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>This miniepisode discusses the technique called Cross Validation - a process by which one randomly divides up a dataset into numerous small partitions. Next, (typically) one is held out, and the rest are used to train some model. The hold out set can then be used to validate how good the model does at describing/predicting new data.</p>]]></description>
<enclosure length="19555181" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Cross_Validation.mp3" />
<itunes:duration>00</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords>training,model,cross,validation,statistical,testing</itunes:keywords>
<itunes:subtitle><![CDATA[This miniepisode discusses the technique called Cross Validation - a process by which one randomly divides up a dataset into numerous small partitions. Next, (typically) one is held out, and the rest are used to train some model. The hold out set can...]]></itunes:subtitle>
</item>
<item>
<title>Streetlight Outage and Crime Rate Analysis with Zach Seeskin</title>
<pubDate>Fri, 18 Jul 2014 13:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[3c548de7b6b5fd3878f336ee12502984]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep008.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>This episode features a discussion with statistics PhD student Zach Seeskin about a project he was involved in as part of the Eric and Wendy Schmidt Data Science for Social Good Summer Fellowship.  The project involved exploring the relationship (if any) between streetlight outages and crime in the City of Chicago.  We discuss how the data was accessed via the City of Chicago data portal, how the analysis was done, and what correlations were discovered in the data.  Won't you listen and hear what ws found? </p>]]></description>
<enclosure length="40165271" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Streetlight_Outage_and_Crime_Rate_Analysis_with_Zach_Seeskin.mp3" />
<itunes:duration>33:29</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>science,good,social,for,data,crime,statistical,analysis</itunes:keywords>
<itunes:subtitle><![CDATA[This episode features a discussion with statistics PhD student Zach Seeskin about a project he was involved in as part of the Eric and Wendy Schmidt Data Science for Social Good Summer Fellowship.  The project involved exploring the...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Experimental Design</title>
<pubDate>Fri, 11 Jul 2014 13:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[f2eb996548a786317cfdb24877d8df22]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/experimental-design.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>This episode loosely explores the topic of Experimental Design including hypothesis testing, the importance of statistical tests, and an everyday and business example.</p>]]></description>
<enclosure length="18848830" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Experimental_Design.mp3" />
<itunes:duration>15:43</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>design,experimental,testing,ab,cornbread</itunes:keywords>
<itunes:subtitle><![CDATA[This episode loosely explores the topic of Experimental Design including hypothesis testing, the importance of statistical tests, and an everyday and business example.]]></itunes:subtitle>
</item>
<item>
<title>The Right (big data) Tool for the Job with Jay Shankar</title>
<pubDate>Mon, 07 Jul 2014 13:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[0700387e79e2a8ad04fa3205ba038af4]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep006.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>In this week's episode, we discuss applied solutions to big data problem with big data engineer Jay Shankar.  The episode explores approaches and design philosophy to solving real world big data business problems, and the exploration of the wide array of tools available.</p>
<p> </p>]]></description>
<enclosure length="59965565" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Data_Skeptic_Podcast_-_Big_Data_Tools.mp3" />
<itunes:duration>49:59</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords>big,data,shopping,map,comparison,reduce,hadoop</itunes:keywords>
<itunes:subtitle><![CDATA[In this week's episode, we discuss applied solutions to big data problem with big data engineer Jay Shankar.  The episode explores approaches and design philosophy to solving real world big data business problems, and the exploration of the wide...]]></itunes:subtitle>
</item>
<item>
<title>[MINI] Bayesian Updating</title>
<pubDate>Fri, 27 Jun 2014 13:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[84d4eb41c617f60c32d9c0c72ec45ff7]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep005.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>In this minisode, we discuss Bayesian Updating - the process by which one can calculate the most likely hypothesis might be true given one's older / prior belief and all new evidence.</p>]]></description>
<enclosure length="13665614" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_Bayesian_Updating.mp3" />
<itunes:duration>11:24</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>bayesian,probability,bayes,prior,posterior,theorem</itunes:keywords>
<itunes:subtitle><![CDATA[In this minisode, we discuss Bayesian Updating - the process by which one can calculate the most likely hypothesis might be true given one's older / prior belief and all new evidence.]]></itunes:subtitle>
</item>
<item>
<title>Personalized Medicine with Niki Athanasiadou</title>
<pubDate>Fri, 20 Jun 2014 13:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[6d319fa38d5da95677aa2391ec25c258]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep004.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>In the second full length episode of the podcast, we discuss the current state of personalized medicine and the advancements in genetics that have made it possible.</p>]]></description>
<enclosure length="46208840" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Data_Skeptic_Podcast_ep_004_-_Personalized_Medicine_with_Niki_Athanasiadou.mp3" />
<itunes:duration>57:14</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>genetics,medicine,genome,personalized</itunes:keywords>
<itunes:subtitle><![CDATA[In the second full length episode of the podcast, we discuss the current state of personalized medicine and the advancements in genetics that have made it possible.]]></itunes:subtitle>
</item>
<item>
<title>[MINI] p-values</title>
<pubDate>Fri, 13 Jun 2014 13:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[cb0d20373c78f83e12aaf04a1c445153]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/p-values.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>In this mini, we discuss p-values and their use in hypothesis testing, in the context of an hypothetical experiment on plant flowering, and end with a reference to the Particle Fever documentary and how statistical significance played a role.</p>]]></description>
<enclosure length="15935279" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/MINI_p-values_.mp3" />
<itunes:duration>16:36</itunes:duration>
<itunes:explicit>no</itunes:explicit>
<itunes:keywords>statistics,testing,hypothesis,pvalues</itunes:keywords>
<itunes:subtitle><![CDATA[In this mini, we discuss p-values and their use in hypothesis testing, in the context of an hypothetical experiment on plant flowering, and end with a reference to the Particle Fever documentary and how statistical significance played a role.]]></itunes:subtitle>
</item>
<item>
<title>Advertising Attribution with Nathan Janos</title>
<pubDate>Fri, 06 Jun 2014 13:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[9e98463c17f42df2b09405ecd4aee57d]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep002.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/2/9/3/8/2938570bb173ccbc/DataSkeptic-Podcast-1A.jpg" />
<description><![CDATA[<p>A conversation with Convertro's Nathan Janos about methodologies used to help advertisers understand the affect each of their marketing efforts (print, SEM, display, skywriting, etc.) contributes to their overall return.</p>]]></description>
<enclosure length="71200182" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Data_Skeptic_Podcast_ep_002_-_Advertising_Attribution_with_Nathan_Janos.mp3" />
<itunes:duration>01:16:29</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>regression,advertising,attribution,convertro</itunes:keywords>
<itunes:subtitle><![CDATA[A conversation with Convertro's Nathan Janos about methodologies used to help advertisers understand the affect each of their marketing efforts (print, SEM, display, skywriting, etc.) contributes to their overall return.]]></itunes:subtitle>
</item>
<item>
<title>[MINI] type i / type ii errors</title>
<pubDate>Fri, 30 May 2014 13:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[7718fa629f059b09818c365e44b745c1]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/type_i_type_ii.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/a/7/e/6/a7e63fbfd34f05cb/type_i_type_ii.png" />
<description><![CDATA[<p>In this first mini-episode of the Data Skeptic Podcast, we define and discuss type i and type ii errors (a.k.a. false positives and false negatives).</p>]]></description>
<enclosure length="13215263" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/type_i_type_ii.mp3" />
<itunes:duration>11:01</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>positive,i,ii,type,false,negative</itunes:keywords>
<itunes:subtitle><![CDATA[In this first mini-episode of the Data Skeptic Podcast, we define and discuss type i and type ii errors (a.k.a. false positives and false negatives).]]></itunes:subtitle>
</item>
<item>
<title>Introduction</title>
<pubDate>Fri, 23 May 2014 10:00:00 +0000</pubDate>
<guid isPermaLink="false"><![CDATA[80d137c5e4a81e2b34752f33db7c03c0]]></guid>
<link><![CDATA[http://dataskeptic.com/epnotes/ep001.php]]></link>
<itunes:image href="http://static.libsyn.com/p/assets/1/1/a/6/11a6925ea0f4027a/introduction.png" />
<description><![CDATA[<p>The Data Skeptic Podcast features conversations with topics related to data science, statistics, machine learning, artificial intelligence and the like, all from the perspective of applying critical thinking and the scientific method to evaluate the veracity of claims and efficacy of approaches.</p>
<p>This first episode is a short discussion about what this podcast is all about.</p>]]></description>
<enclosure length="3481373" type="audio/mpeg" url="http://traffic.libsyn.com/dataskeptic/Data_Skeptic_Podcast_ep000_-_Introduction.mp3" />
<itunes:duration>03:56</itunes:duration>
<itunes:explicit>clean</itunes:explicit>
<itunes:keywords>science,data,skepticism</itunes:keywords>
<itunes:subtitle><![CDATA[The Data Skeptic Podcast features conversations with topics related to data science, statistics, machine learning, artificial intelligence and the like, all from the perspective of applying critical thinking and the scientific method to evaluate the...]]></itunes:subtitle>
</item>
</channel>
</rss>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment