<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>data-science on S Anand</title>
    <link>https://www.s-anand.net/blog/tag/data-science/</link>
    <description>Recent content in data-science on S Anand</description>
    <generator>Hugo -- 0.156.0</generator>
    <language>en-us</language>
    <lastBuildDate>Fri, 12 Sep 2025 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.s-anand.net/blog/tag/data-science/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title></title>
      <link>https://www.s-anand.net/blog/rip-data-scientists/</link>
      <pubDate>Fri, 12 Sep 2025 00:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/rip-data-scientists/</guid>
      <description>&lt;p&gt;Slides for my DataHack Summit talk (controversially) titled &lt;strong&gt;RIP Data Scientists&lt;/strong&gt; are at &lt;a href=&#34;https://sanand0.github.io/talks/2025-08-21-rip-data-scientists/&#34;&gt;https://sanand0.github.io/talks/2025-08-21-rip-data-scientists/&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Summary&lt;/strong&gt;: as data scientists we explore, clean, model, explain, deploy, and anonymize datasets. I live-vibe-coded &lt;em&gt;each&lt;/em&gt; step with DGCA data in 35 minutes using ChatGPT.&lt;/p&gt;
&lt;p&gt;Of course, it&amp;rsquo;s the &lt;em&gt;tasks&lt;/em&gt; that are dying, not the role. Data scientists will leverage AI, differentiate on other skills, and move on.&lt;/p&gt;
&lt;p&gt;But the highlight was an audience comment: &amp;ldquo;I&amp;rsquo;m no data scientist. I&amp;rsquo;m a domain person. I&amp;rsquo;ll tell you all this: If you don&amp;rsquo;t follow these practices, you won&amp;rsquo;t have a job with me!&amp;rdquo;&lt;/p&gt;
&lt;p&gt;They&amp;rsquo;re catching on! 🙂&lt;/p&gt;
&lt;p&gt;&lt;img loading=&#34;lazy&#34; src=&#34;https://files.s-anand.net/images/2025-09-12-rip-data-scientists-linkedin.jpg&#34;&gt;&lt;/p&gt;
&lt;p&gt;&lt;a href=&#34;https://www.linkedin.com/posts/sanand0_slides-for-my-datahack-summit-talk-controversially-activity-7364307983037579266-gnqf&#34;&gt;LinkedIn&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    <item>
      <title></title>
      <link>https://www.s-anand.net/blog/what-online-course-to-publish/</link>
      <pubDate>Mon, 28 Feb 2022 05:10:55 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/what-online-course-to-publish/</guid>
      <description>&lt;p&gt;I&amp;rsquo;m planning to publish a 3-hour self-paced #onlinecourse.&lt;/p&gt;
&lt;p&gt;But I don&amp;rsquo;t know which topic would be more useful.&lt;/p&gt;
&lt;p&gt;One topic is #datascience tools for non-programmers.&lt;/p&gt;
&lt;p&gt;Another is a step-by-step guide to #datastorytelling for analysts.&lt;/p&gt;
&lt;p&gt;What&amp;rsquo;s more useful for you?&lt;/p&gt;
&lt;p&gt;Could you share with people, so I work on the more useful course? (Thanks 🙏)&lt;/p&gt;
&lt;p&gt;&lt;a href=&#34;https://www.linkedin.com/feed/update/urn%3Ali%3AugcPost%3A6903929474736361472&#34;&gt;LinkedIn&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    <item>
      <title></title>
      <link>https://www.s-anand.net/blog/if-you-re-a-seasoned-developer-that-enjoys-working-with-data-have-good-front-end/</link>
      <pubDate>Mon, 08 Apr 2019 10:16:58 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/if-you-re-a-seasoned-developer-that-enjoys-working-with-data-have-good-front-end/</guid>
      <description>&lt;p&gt;If you&amp;rsquo;re a seasoned developer that enjoys working with data, have good front-end skills, and are challenged by impossible deadlines, please drop me a note. I&amp;rsquo;d love to work with you at Gramener Mumbai.&lt;/p&gt;
&lt;p&gt;&lt;a href=&#34;https://www.linkedin.com/feed/update/urn%3Ali%3Ashare%3A6520962522248511488&#34;&gt;LinkedIn&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    <item>
      <title></title>
      <link>https://www.s-anand.net/blog/apparently-i-m-one-of-the-top-10-data-scientists-in-india-https-lnkd-in-dbecsbu/</link>
      <pubDate>Thu, 05 Nov 2015 12:25:36 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/apparently-i-m-one-of-the-top-10-data-scientists-in-india-https-lnkd-in-dbecsbu/</guid>
      <description>&lt;p&gt;Apparently, I&amp;rsquo;m one of the top 10 data scientists in India. &lt;a href=&#34;http://analyticsindiamag.com/top-10-data-scientists-in-india-2015/&#34;&gt;http://analyticsindiamag.com/top-10-data-scientists-in-india-2015/&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;&lt;a href=&#34;https://www.linkedin.com/feed/update/urn%3Ali%3Ashare%3A6068010061538557952&#34;&gt;LinkedIn&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    <item>
      <title>A-Z of my browsing history</title>
      <link>https://www.s-anand.net/blog/a-z-of-my-browsing-history/</link>
      <pubDate>Fri, 09 May 2014 16:16:38 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/a-z-of-my-browsing-history/</guid>
      <description>&lt;p&gt;When you start typing in the address bar, Chrome suggests a link to visit, based on &lt;a href=&#34;http://en.wikipedia.org/wiki/Frecency&#34;&gt;frecency&lt;/a&gt;. What do my recommendations look like?&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;A is for &lt;a href=&#34;http://airtel.in/smartbyte-s/page.html&#34;&gt;airtel.in/smartbyte-s/page.html&lt;/a&gt; – the page where you can check your bandwidth usage. I used to check it infrequently until I upgraded to a 125GB connection. Now I check it every few days and feel miserable that I’ve nowhere near used up my quota. This has coerced me to watch many Telugu movies, of which I don’t understand a word.&lt;/li&gt;
&lt;li&gt;B is for &lt;a href=&#34;http://blog.gramener.com/&#34;&gt;blog.gramener.com&lt;/a&gt; – I blog there on data stories. The last month or so has been fairly active thanks to the elections.&lt;/li&gt;
&lt;li&gt;C is for &lt;a href=&#34;http://calendar.google.com&#34;&gt;calendar.google.com&lt;/a&gt; – which has become primarily a &lt;strong&gt;shared&lt;/strong&gt; calendar. It was always indispensible to manage my time. Now it helps my colleagues pick when to call me. Right now, my calendar has events booked about two months in advance.&lt;/li&gt;
&lt;li&gt;D is for &lt;a href=&#34;https://docs.google.com/&#34;&gt;docs.google.com&lt;/a&gt; – for effectively one single purpose: shared spreadsheets. This is such a common and powerful use case, and I’m surprised it hasn’t become much easier to use.&lt;/li&gt;
&lt;li&gt;E is for &lt;a href=&#34;http://epaper.timesofindia.com/&#34;&gt;epaper.timesofindia.com&lt;/a&gt; – some of our content has been published by The Economic Times, and I keep doing ego-searches in the print edition. But close behind is &lt;a href=&#34;http://eci.nic.in/&#34;&gt;eci.nic.in&lt;/a&gt; which I’ve been scraping a lot, and &lt;a href=&#34;http://election-results.ibnlive.in.com/&#34; title=&#34;http://election-results.ibnlive.in.com/&#34;&gt;election-results.ibnlive.in.com&lt;/a&gt; which we created for CNN-IBN.&lt;/li&gt;
&lt;li&gt;F is for &lt;a href=&#34;http://www.flipkart.com/&#34;&gt;flipkart.com&lt;/a&gt; – not &lt;a href=&#34;https://www.facebook.com/&#34;&gt;facebook.com&lt;/a&gt;. I’m not often on Facebook.&lt;/li&gt;
&lt;li&gt;G is for &lt;a href=&#34;https://gramener.com/&#34;&gt;gramener.com&lt;/a&gt;. Naturally. (It’s not surprising that it’s not google.com: I search directly from the address bar.)&lt;/li&gt;
&lt;li&gt;H is for &lt;a href=&#34;http://handsontable.com/&#34;&gt;handsontable.com&lt;/a&gt; – a library that I’ve been using a lot recently, followed by &lt;a href=&#34;http://html5please.com/&#34; title=&#34;http://html5please.com/&#34;&gt;html5please.com&lt;/a&gt; that tells me which HTML5 features are ready for use.&lt;/li&gt;
&lt;li&gt;I is for &lt;a href=&#34;http://ibn.gramener.com/&#34;&gt;ibn.gramener.com&lt;/a&gt; – another property we created, but it only just beats &lt;a href=&#34;http://www.irctc.co.in/&#34;&gt;irctc.co.in&lt;/a&gt;.&lt;/li&gt;
&lt;li&gt;J is for &lt;a href=&#34;http://join.me/&#34;&gt;join.me&lt;/a&gt; – a clean way to share your screen without the audience having to install anything (though you the sharer do have to install the software.)&lt;/li&gt;
&lt;li&gt;K is for &lt;a href=&#34;https://kraken.io/&#34;&gt;kraken.io&lt;/a&gt; – an amazingly efficient image compressor. As you might have guessed, I lead a strange life.&lt;/li&gt;
&lt;li&gt;L is for &lt;a href=&#34;https://learn.gramener.com/&#34;&gt;learn.gramener.com&lt;/a&gt; – our Intranet. Sorry, you can’t access this one.&lt;/li&gt;
&lt;li&gt;M is for &lt;a href=&#34;https://mail.google.com/&#34;&gt;mail.google.com&lt;/a&gt;. I’ll probably be moving away from gmail as a backend this weekend to &lt;a href=&#34;https://github.com/JoshData/mailinabox/&#34;&gt;Mail-in-a-box&lt;/a&gt;, though. Google’s pulling the plug on Google Reader has shaken my faith.&lt;/li&gt;
&lt;li&gt;N is for &lt;a href=&#34;http://news.ycombinator.com/&#34; title=&#34;http://news.ycombinator.com/&#34;&gt;news.ycombinator.com&lt;/a&gt;. When I’m bored and want to watch something while I have dinner, I don’t open YouTube. I open Hacker News.&lt;/li&gt;
&lt;li&gt;O is for &lt;a href=&#34;http://odc.datameet.org/&#34; title=&#34;http://odc.datameet.org/&#34;&gt;odc.datameet.org&lt;/a&gt; – the Open Data Camp. I’m quite into open data.&lt;/li&gt;
&lt;li&gt;P is for &lt;a href=&#34;https://pay.airtel.com/&#34; title=&#34;https://pay.airtel.com&#34;&gt;pay.airtel.com&lt;/a&gt;, but if you ignore the number of bills I pay, it would be &lt;a href=&#34;http://pandas.pydata.org/&#34; title=&#34;http://pandas.pydata.org/&#34;&gt;pandas.pydata.org&lt;/a&gt;, the home page of a remarkable data processing library.&lt;/li&gt;
&lt;li&gt;Q is for &lt;a href=&#34;http://www.quirksmode.org/&#34;&gt;quirksmode.org&lt;/a&gt;, PPK’s remarkable browser-compatibility guide&lt;/li&gt;
&lt;li&gt;R is for &lt;a href=&#34;http://reader.s-anand.net/&#34;&gt;reader.s-anand.net&lt;/a&gt;, my self-hosted RSS reader. It used to be reader.google.com, but Google let me down there.&lt;/li&gt;
&lt;li&gt;S is for &lt;a href=&#34;http://s-anand.net/&#34; title=&#34;http://s-anand.net/&#34;&gt;s-anand.net&lt;/a&gt; – this blog.&lt;/li&gt;
&lt;li&gt;T is for &lt;a href=&#34;https://twitter.com/&#34;&gt;twitter.com&lt;/a&gt;. Unlike Facebook, I don’t dislike Twitter so much.&lt;/li&gt;
&lt;li&gt;U is for &lt;a href=&#34;http://underscorejs.org/&#34; title=&#34;http://underscorejs.org/&#34;&gt;underscorejs.org&lt;/a&gt;. Clearly I need to get a life.&lt;/li&gt;
&lt;li&gt;V is for &lt;a href=&#34;http://visualizing.org/&#34; title=&#34;http://visualizing.org/&#34;&gt;visualizing.org&lt;/a&gt;. They have a number of interesting data visualisations.&lt;/li&gt;
&lt;li&gt;W is for &lt;a href=&#34;http://www.webpagetest.org&#34;&gt;webpagetest.org&lt;/a&gt; – it helps measure the speed of web pages.&lt;/li&gt;
&lt;li&gt;X is for &lt;a href=&#34;http://xem.github.io/&#34; title=&#34;http://xem.github.io/&#34;&gt;xem.github.io&lt;/a&gt;. I’ve probably visited this page once, but it’s the only one in my recent history that starts with X&lt;/li&gt;
&lt;li&gt;Y is for &lt;a href=&#34;https://www.youtube.com/&#34;&gt;youtube.com&lt;/a&gt;. I lied. I spend an order of magnitude more time watching Telugu movies on YouTube than on Hacker News.&lt;/li&gt;
&lt;li&gt;Z is for &lt;a href=&#34;https://www.zoemob.com/en/&#34;&gt;zoemob.com&lt;/a&gt;. Again, a page I visited only once, but there’s nothing else in Z at the moment.&lt;/li&gt;
&lt;/ul&gt;
&lt;hr&gt;
&lt;h2 id=&#34;comments&#34;&gt;Comments&lt;/h2&gt;
&lt;!-- wp-comments-start --&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://www.s-anand.net/blog/software-i-currently-use/&#34;&gt;Software I currently use | s-anand.net&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;9 May 2014 6:24 pm&lt;/em&gt; &lt;em&gt;(pingback)&lt;/em&gt;:
[…] course, some of my apps apps have moved online, and my earlier post on the A-Z of my browsing history covers that. But there are a few applications that I’ve hosted which I must talk about. […]&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://broadband-chandigarh.in&#34;&gt;chandigarh&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Oct 2015 7:27 pm&lt;/em&gt;:
you can delete your web search history through link
&lt;a href=&#34;https://history.google.com/history&#34;&gt;https://history.google.com/history&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;!-- wp-comments-end --&gt;
</description>
    </item>
    <item>
      <title>The most popular scientific Python modules</title>
      <link>https://www.s-anand.net/blog/the-most-popular-scientific-python-modules/</link>
      <pubDate>Tue, 11 Dec 2012 02:37:52 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/the-most-popular-scientific-python-modules/</guid>
      <description>&lt;p&gt;I just &lt;a href=&#34;https://gist.github.com/4244899&#34;&gt;scraped&lt;/a&gt; the &lt;a href=&#34;http://pypi.python.org/pypi?:action=browse&amp;amp;show=all&amp;amp;c=385&#34;&gt;scientific packages on pypi&lt;/a&gt;. Here are the top 50 by downloads.&lt;/p&gt; &lt;table style=&#34;color: #444; font-size: 80%&#34; class=&#34;lines numbers&#34;&gt; &lt;thead&gt; &lt;tr&gt; &lt;th&gt;Name&lt;/th&gt; &lt;th&gt;Description&lt;/th&gt; &lt;th&gt;Size&lt;/th&gt; &lt;th&gt;Downloads&lt;/th&gt;&lt;/tr&gt;&lt;/thead&gt; &lt;tbody&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/numpy/1.6.2&#34;&gt;numpy&lt;/a&gt;&lt;/td&gt; &lt;td&gt;NumPy: array processing for numbers, strings, records, and objects.&lt;/td&gt; &lt;td&gt;2000000&lt;/td&gt; &lt;td&gt;133076&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/scipy/0.11.0&#34;&gt;scipy&lt;/a&gt;&lt;/td&gt; &lt;td&gt;SciPy: Scientific Library for Python&lt;/td&gt; &lt;td&gt;7000000&lt;/td&gt; &lt;td&gt;33990&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pygraphviz/1.1&#34;&gt;pygraphviz&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Python interface to Graphviz&lt;/td&gt; &lt;td&gt;99000&lt;/td&gt; &lt;td&gt;22828&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/geopy/0.94.2&#34;&gt;geopy&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Python Geocoding Toolbox&lt;/td&gt; &lt;td&gt;32000&lt;/td&gt; &lt;td&gt;18617&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/googlemaps/1.0.2&#34;&gt;googlemaps&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Easy geocoding, reverse geocoding, driving directions, and local search in Python via Google.&lt;/td&gt; &lt;td&gt;69000&lt;/td&gt; &lt;td&gt;15135&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/Rtree/0.7.0&#34;&gt;Rtree&lt;/a&gt;&lt;/td&gt; &lt;td&gt;R-Tree spatial index for Python GIS&lt;/td&gt; &lt;td&gt;495000&lt;/td&gt; &lt;td&gt;14370&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/nltk/2.0.4&#34;&gt;nltk&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Natural Language Toolkit&lt;/td&gt; &lt;td&gt;1000000&lt;/td&gt; &lt;td&gt;12844&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/Shapely/1.2.16&#34;&gt;Shapely&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Geometric objects, predicates, and operations&lt;/td&gt; &lt;td&gt;93000&lt;/td&gt; &lt;td&gt;12635&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pyutilib.component.doc/1.0.1&#34;&gt;pyutilib.component.doc&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Documentation for the PyUtilib Component Architecture.&lt;/td&gt; &lt;td&gt;372000&lt;/td&gt; &lt;td&gt;10181&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/geojson/1.0.1&#34;&gt;geojson&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Encoder/decoder for simple GIS features&lt;/td&gt; &lt;td&gt;12000&lt;/td&gt; &lt;td&gt;9407&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/GDAL/1.9.1&#34;&gt;GDAL&lt;/a&gt;&lt;/td&gt; &lt;td&gt;GDAL: Geospatial Data Abstraction Library&lt;/td&gt; &lt;td&gt;410000&lt;/td&gt; &lt;td&gt;8957&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/scikits.audiolab/0.11.0&#34;&gt;scikits.audiolab&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A python module to make noise from numpy arrays&lt;/td&gt; &lt;td&gt;1000000&lt;/td&gt; &lt;td&gt;8856&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pupynere/1.0.15&#34;&gt;pupynere&lt;/a&gt;&lt;/td&gt; &lt;td&gt;NetCDF file reader and writer.&lt;/td&gt; &lt;td&gt;16000&lt;/td&gt; &lt;td&gt;8809&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/scikits.statsmodels/0.3.1&#34;&gt;scikits.statsmodels&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Statistical computations and models for use with SciPy&lt;/td&gt; &lt;td&gt;3000000&lt;/td&gt; &lt;td&gt;8761&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/munkres/1.0.5.4&#34;&gt;munkres&lt;/a&gt;&lt;/td&gt; &lt;td&gt;munkres algorithm for the Assignment Problem&lt;/td&gt; &lt;td&gt;42000&lt;/td&gt; &lt;td&gt;8409&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/scikit-learn/0.12.1&#34;&gt;scikit-learn&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A set of python modules for machine learning and data mining&lt;/td&gt; &lt;td&gt;2000000&lt;/td&gt; &lt;td&gt;7735&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/networkx/1.7&#34;&gt;networkx&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Python package for creating and manipulating graphs and networks&lt;/td&gt; &lt;td&gt;1009000&lt;/td&gt; &lt;td&gt;7652&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pyephem/3.7.5.1&#34;&gt;pyephem&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Scientific-grade astronomy routines&lt;/td&gt; &lt;td&gt;927000&lt;/td&gt; &lt;td&gt;7644&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/PyBrain/0.3&#34;&gt;PyBrain&lt;/a&gt;&lt;/td&gt; &lt;td&gt;PyBrain is the swiss army knife for neural networking.&lt;/td&gt; &lt;td&gt;255000&lt;/td&gt; &lt;td&gt;7313&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/scikits.learn/0.8.1&#34;&gt;scikits.learn&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A set of python modules for machine learning and data mining&lt;/td&gt; &lt;td&gt;1000000&lt;/td&gt; &lt;td&gt;7088&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/obspy.seisan/0.5.1&#34;&gt;obspy.seisan&lt;/a&gt;&lt;/td&gt; &lt;td&gt;SEISAN read support for ObsPy.&lt;/td&gt; &lt;td&gt;3000000&lt;/td&gt; &lt;td&gt;6990&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/obspy.wav/0.5.1&#34;&gt;obspy.wav&lt;/a&gt;&lt;/td&gt; &lt;td&gt;WAV(audio) read and write support for ObsPy.&lt;/td&gt; &lt;td&gt;241000&lt;/td&gt; &lt;td&gt;6985&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/obspy.seishub/0.5.1&#34;&gt;obspy.seishub&lt;/a&gt;&lt;/td&gt; &lt;td&gt;SeisHub database client for ObsPy.&lt;/td&gt; &lt;td&gt;237000&lt;/td&gt; &lt;td&gt;6941&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/obspy.sh/0.5.2&#34;&gt;obspy.sh&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Q and ASC (Seismic Handler) read and write support for ObsPy.&lt;/td&gt; &lt;td&gt;285000&lt;/td&gt; &lt;td&gt;6926&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/crcmod/1.7&#34;&gt;crcmod&lt;/a&gt;&lt;/td&gt; &lt;td&gt;CRC Generator&lt;/td&gt; &lt;td&gt;128000&lt;/td&gt; &lt;td&gt;6714&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/obspy.fissures/0.4.7&#34;&gt;obspy.fissures&lt;/a&gt;&lt;/td&gt; &lt;td&gt;DHI/Fissures request client for ObsPy.&lt;/td&gt; &lt;td&gt;1000000&lt;/td&gt; &lt;td&gt;6339&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/stsci.distutils/0.3.1&#34;&gt;stsci.distutils&lt;/a&gt;&lt;/td&gt; &lt;td&gt;distutils/packaging-related utilities used by some of STScI&#39;s packages&lt;/td&gt; &lt;td&gt;25000&lt;/td&gt; &lt;td&gt;6215&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pyopencl/2012.1&#34;&gt;pyopencl&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Python wrapper for OpenCL&lt;/td&gt; &lt;td&gt;1000000&lt;/td&gt; &lt;td&gt;6124&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/Kivy/1.4.1&#34;&gt;Kivy&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A software library for rapid development of hardware-accelerated multitouch applications.&lt;/td&gt; &lt;td&gt;11000000&lt;/td&gt; &lt;td&gt;5879&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/speech/0.5.2&#34;&gt;speech&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A clean interface to Windows speech recognition and text-to-speech capabilities.&lt;/td&gt; &lt;td&gt;17000&lt;/td&gt; &lt;td&gt;5809&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/patsy/0.1.0&#34;&gt;patsy&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A Python package for describing statistical models and for building design matrices.&lt;/td&gt; &lt;td&gt;276000&lt;/td&gt; &lt;td&gt;5517&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/periodictable/1.3.0&#34;&gt;periodictable&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Extensible periodic table of the elements&lt;/td&gt; &lt;td&gt;775000&lt;/td&gt; &lt;td&gt;5498&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pymorphy/0.5.6&#34;&gt;pymorphy&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Morphological analyzer (POS tagger + inflection engine) for Russian and English (+perhaps German) languages.&lt;/td&gt; &lt;td&gt;70000&lt;/td&gt; &lt;td&gt;5174&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/imposm.parser/1.0.3&#34;&gt;imposm.parser&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Fast and easy OpenStreetMap XML/PBF parser.&lt;/td&gt; &lt;td&gt;31000&lt;/td&gt; &lt;td&gt;4940&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/hcluster/0.2.0&#34;&gt;hcluster&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A hierarchical clustering package for Scipy.&lt;/td&gt; &lt;td&gt;442000&lt;/td&gt; &lt;td&gt;4761&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/obspy.core/0.7.1&#34;&gt;obspy.core&lt;/a&gt;&lt;/td&gt; &lt;td&gt;ObsPy - a Python framework for seismological observatories.&lt;/td&gt; &lt;td&gt;487000&lt;/td&gt; &lt;td&gt;4608&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/Pyevolve/0.5&#34;&gt;Pyevolve&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A complete python genetic algorithm framework&lt;/td&gt; &lt;td&gt;99000&lt;/td&gt; &lt;td&gt;4509&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/scikits.ann/0.2.dev-r803&#34;&gt;scikits.ann&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Approximate Nearest Neighbor library wrapper for Numpy&lt;/td&gt; &lt;td&gt;82000&lt;/td&gt; &lt;td&gt;4368&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/obspy.imaging/0.7.0&#34;&gt;obspy.imaging&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Plotting routines for ObsPy.&lt;/td&gt; &lt;td&gt;324000&lt;/td&gt; &lt;td&gt;4356&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/obspy.xseed/0.7.0&#34;&gt;obspy.xseed&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Dataless SEED, RESP and XML-SEED read and write support for ObsPy.&lt;/td&gt; &lt;td&gt;2000000&lt;/td&gt; &lt;td&gt;4331&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/obspy.sac/0.7.0&#34;&gt;obspy.sac&lt;/a&gt;&lt;/td&gt; &lt;td&gt;SAC read and write support for ObsPy.&lt;/td&gt; &lt;td&gt;306000&lt;/td&gt; &lt;td&gt;4319&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/obspy.arclink/0.7.1&#34;&gt;obspy.arclink&lt;/a&gt;&lt;/td&gt; &lt;td&gt;ArcLink/WebDC client for ObsPy.&lt;/td&gt; &lt;td&gt;247000&lt;/td&gt; &lt;td&gt;4164&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/obspy.iris/0.7.0&#34;&gt;obspy.iris&lt;/a&gt;&lt;/td&gt; &lt;td&gt;IRIS Web service client for ObsPy.&lt;/td&gt; &lt;td&gt;261000&lt;/td&gt; &lt;td&gt;4153&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/Orange/2.5a4&#34;&gt;Orange&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Machine learning and interactive data mining toolbox.&lt;/td&gt; &lt;td&gt;14000000&lt;/td&gt; &lt;td&gt;4099&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/obspy.neries/0.7.0&#34;&gt;obspy.neries&lt;/a&gt;&lt;/td&gt; &lt;td&gt;NERIES Web service client for ObsPy.&lt;/td&gt; &lt;td&gt;239000&lt;/td&gt; &lt;td&gt;4066&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pandas/0.9.1&#34;&gt;pandas&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Powerful data structures for data analysis, time series,and statistics&lt;/td&gt; &lt;td&gt;2000000&lt;/td&gt; &lt;td&gt;4037&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pycuda/2012.1&#34;&gt;pycuda&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Python wrapper for Nvidia CUDA&lt;/td&gt; &lt;td&gt;1000000&lt;/td&gt; &lt;td&gt;4030&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/GeoAlchemy/0.7.1&#34;&gt;GeoAlchemy&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Using SQLAlchemy with Spatial Databases&lt;/td&gt; &lt;td&gt;159000&lt;/td&gt; &lt;td&gt;3881&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pyfits/3.1&#34;&gt;pyfits&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Reads FITS images and tables into numpy arrays and manipulates FITS headers&lt;/td&gt; &lt;td&gt;748000&lt;/td&gt; &lt;td&gt;3746&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/HTSeq/0.5.3p7&#34;&gt;HTSeq&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A framework to process and analyze data from high-throughput sequencing (HTS) assays&lt;/td&gt; &lt;td&gt;523000&lt;/td&gt; &lt;td&gt;3720&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pyopencv/2.1.0.wr1.2.0&#34;&gt;pyopencv&lt;/a&gt;&lt;/td&gt; &lt;td&gt;PyOpenCV - A Python wrapper for OpenCV 2.x using Boost.Python and NumPy&lt;/td&gt; &lt;td&gt;354000&lt;/td&gt; &lt;td&gt;3660&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/thredds/0.1.5&#34;&gt;thredds&lt;/a&gt;&lt;/td&gt; &lt;td&gt;THREDDS catalog generator.&lt;/td&gt; &lt;td&gt;25000&lt;/td&gt; &lt;td&gt;3622&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/hachoir-subfile/0.5.3&#34;&gt;hachoir-subfile&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Find subfile in any binary stream&lt;/td&gt; &lt;td&gt;16000&lt;/td&gt; &lt;td&gt;3540&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/fluid/0.1.7&#34;&gt;fluid&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Procedures to study geophysical fluids on Python.&lt;/td&gt; &lt;td&gt;210000&lt;/td&gt; &lt;td&gt;3520&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pygeocoder/1.1.4&#34;&gt;pygeocoder&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Python interface for Google Geocoding API V3. Can be used to easily geocode, reverse geocode, validate and format addresses.&lt;/td&gt; &lt;td&gt;7000&lt;/td&gt; &lt;td&gt;3514&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/csc-pysparse/1.1.1.4&#34;&gt;csc-pysparse&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A fast sparse matrix library for Python (Commonsense Computing version)&lt;/td&gt; &lt;td&gt;111000&lt;/td&gt; &lt;td&gt;3455&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/topex/0.1&#34;&gt;topex&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A very simple library to interpret and load TOPEX/JASON altimetry data&lt;/td&gt; &lt;td&gt;7000&lt;/td&gt; &lt;td&gt;3378&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/arrayterator/1.0.1&#34;&gt;arrayterator&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Buffered iterator for big arrays.&lt;/td&gt; &lt;td&gt;7000&lt;/td&gt; &lt;td&gt;3320&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/python-igraph/0.6&#34;&gt;python-igraph&lt;/a&gt;&lt;/td&gt; &lt;td&gt;High performance graph data structures and algorithms&lt;/td&gt; &lt;td&gt;3000000&lt;/td&gt; &lt;td&gt;3260&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/csvkit/0.5.0&#34;&gt;csvkit&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A library of utilities for working with CSV, the king of tabular file formats.&lt;/td&gt; &lt;td&gt;29000&lt;/td&gt; &lt;td&gt;3236&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/PyVISA/1.3&#34;&gt;PyVISA&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Python VISA bindings for GPIB, RS232, and USB instruments&lt;/td&gt; &lt;td&gt;237000&lt;/td&gt; &lt;td&gt;3201&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/Quadtree/0.1.2&#34;&gt;Quadtree&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Quadtree spatial index for Python GIS&lt;/td&gt; &lt;td&gt;40000&lt;/td&gt; &lt;td&gt;3000&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/ProxyHTTPServer/0.0.1&#34;&gt;ProxyHTTPServer&lt;/a&gt;&lt;/td&gt; &lt;td&gt;ProxyHTTPServer -- from the creator of PyWebRun&lt;/td&gt; &lt;td&gt;3000&lt;/td&gt; &lt;td&gt;2991&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/mpmath/0.17&#34;&gt;mpmath&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Python library for arbitrary-precision floating-point arithmetic&lt;/td&gt; &lt;td&gt;1000000&lt;/td&gt; &lt;td&gt;2901&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/bigfloat/0.2.1&#34;&gt;bigfloat&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Arbitrary precision correctly-rounded floating point arithmetic, via MPFR.&lt;/td&gt; &lt;td&gt;126000&lt;/td&gt; &lt;td&gt;2879&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/SimPy/2.3.1&#34;&gt;SimPy&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Event discrete, process based simulation for Python.&lt;/td&gt; &lt;td&gt;5000000&lt;/td&gt; &lt;td&gt;2871&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/Delny/0.4.1&#34;&gt;Delny&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Delaunay triangulation&lt;/td&gt; &lt;td&gt;18000&lt;/td&gt; &lt;td&gt;2790&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pymc/2.2&#34;&gt;pymc&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Markov Chain Monte Carlo sampling toolkit.&lt;/td&gt; &lt;td&gt;1000000&lt;/td&gt; &lt;td&gt;2727&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/PyBUFR/0.4&#34;&gt;PyBUFR&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Pure Python library to encode and decode BUFR.&lt;/td&gt; &lt;td&gt;10000&lt;/td&gt; &lt;td&gt;2676&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/collective.geo.bundle/0.1&#34;&gt;collective.geo.bundle&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Plone Maps (collective.geo)&lt;/td&gt; &lt;td&gt;11000&lt;/td&gt; &lt;td&gt;2676&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/dap/2.2.6.7&#34;&gt;dap&lt;/a&gt;&lt;/td&gt; &lt;td&gt;DAP (Data Access Protocol) client and server for Python.&lt;/td&gt; &lt;td&gt;125000&lt;/td&gt; &lt;td&gt;2598&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/rq/0.3.2&#34;&gt;rq&lt;/a&gt;&lt;/td&gt; &lt;td&gt;RQ is a simple, lightweight, library for creating background jobs, and processing them.&lt;/td&gt; &lt;td&gt;29000&lt;/td&gt; &lt;td&gt;2590&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pyinterval/1.0b21&#34;&gt;pyinterval&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Interval arithmetic in Python&lt;/td&gt; &lt;td&gt;397000&lt;/td&gt; &lt;td&gt;2558&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/StarCluster/0.93.3&#34;&gt;StarCluster&lt;/a&gt;&lt;/td&gt; &lt;td&gt;StarCluster is a utility for creating and managing computing clusters hosted on Amazon&#39;s Elastic Compute Cloud (EC2).&lt;/td&gt; &lt;td&gt;2000000&lt;/td&gt; &lt;td&gt;2521&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/fisher/0.1.4&#34;&gt;fisher&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Fast Fisher&#39;s Exact Test&lt;/td&gt; &lt;td&gt;43000&lt;/td&gt; &lt;td&gt;2503&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/mathdom/0.8&#34;&gt;mathdom&lt;/a&gt;&lt;/td&gt; &lt;td&gt;MathDOM - Content MathML in Python&lt;/td&gt; &lt;td&gt;169000&lt;/td&gt; &lt;td&gt;2482&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/img2txt/2008.11.20&#34;&gt;img2txt&lt;/a&gt;&lt;/td&gt; &lt;td&gt;superseded by asciiporn, http://pypi.python.org/pypi/asciiporn&lt;/td&gt; &lt;td&gt;443000&lt;/td&gt; &lt;td&gt;2436&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/DendroPy/3.12.0&#34;&gt;DendroPy&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A Python library for phylogenetics and phylogenetic computing: reading, writing, simulation, processing and manipulation of phylogenetic trees (phylogenies) and characters.&lt;/td&gt; &lt;td&gt;6000000&lt;/td&gt; &lt;td&gt;2349&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/geolocator/0.1.1&#34;&gt;geolocator&lt;/a&gt;&lt;/td&gt; &lt;td&gt;geolocator library: locate places and calculate distances between them&lt;/td&gt; &lt;td&gt;26000&lt;/td&gt; &lt;td&gt;2342&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/MyProxyClient/1.3.0&#34;&gt;MyProxyClient&lt;/a&gt;&lt;/td&gt; &lt;td&gt;MyProxy Client&lt;/td&gt; &lt;td&gt;67000&lt;/td&gt; &lt;td&gt;2325&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/PyUblas/2011.1&#34;&gt;PyUblas&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Seamless Numpy-UBlas interoperability&lt;/td&gt; &lt;td&gt;51000&lt;/td&gt; &lt;td&gt;2252&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/oroboros/20080712&#34;&gt;oroboros&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Astrology software&lt;/td&gt; &lt;td&gt;1000000&lt;/td&gt; &lt;td&gt;2228&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/textmining/1.0&#34;&gt;textmining&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Python Text Mining Utilities&lt;/td&gt; &lt;td&gt;1000000&lt;/td&gt; &lt;td&gt;2198&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/scikits.talkbox/0.2.5&#34;&gt;scikits.talkbox&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Talkbox, a set of python modules for speech/signal processing&lt;/td&gt; &lt;td&gt;147000&lt;/td&gt; &lt;td&gt;2188&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/asciitable/0.8.0&#34;&gt;asciitable&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Extensible ASCII table reader and writer&lt;/td&gt; &lt;td&gt;312000&lt;/td&gt; &lt;td&gt;2160&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/scikits.samplerate/0.3.3&#34;&gt;scikits.samplerate&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A python module for high quality audio resampling&lt;/td&gt; &lt;td&gt;368000&lt;/td&gt; &lt;td&gt;2151&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/tabular/0.0.8&#34;&gt;tabular&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Tabular data container and associated convenience routines in Python&lt;/td&gt; &lt;td&gt;52000&lt;/td&gt; &lt;td&gt;2114&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pywcs/1.10-4.7&#34;&gt;pywcs&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Python wrappers to WCSLIB&lt;/td&gt; &lt;td&gt;2000000&lt;/td&gt; &lt;td&gt;2081&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/DeliciousAPI/1.6.7&#34;&gt;DeliciousAPI&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Unofficial Python API for retrieving data from Delicious.com&lt;/td&gt; &lt;td&gt;19000&lt;/td&gt; &lt;td&gt;2038&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/hachoir-regex/1.0.5&#34;&gt;hachoir-regex&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Manipulation of regular expressions (regex)&lt;/td&gt; &lt;td&gt;31000&lt;/td&gt; &lt;td&gt;2031&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/Kamaelia/0.6.0&#34;&gt;Kamaelia&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Kamaelia - Multimedia &amp;amp; Server Development Kit&lt;/td&gt; &lt;td&gt;2000000&lt;/td&gt; &lt;td&gt;2007&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/seawater/2.0.1&#34;&gt;seawater&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Seawater Libray for Python&lt;/td&gt; &lt;td&gt;2000000&lt;/td&gt; &lt;td&gt;1985&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/descartes/1.0&#34;&gt;descartes&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Use geometric objects as matplotlib paths and patches&lt;/td&gt; &lt;td&gt;3000&lt;/td&gt; &lt;td&gt;1983&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/vectorformats/0.1&#34;&gt;vectorformats&lt;/a&gt;&lt;/td&gt; &lt;td&gt;geographic data serialization/deserialization library&lt;/td&gt; &lt;td&gt;10000&lt;/td&gt; &lt;td&gt;1949&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/PyMT/0.5.1&#34;&gt;PyMT&lt;/a&gt;&lt;/td&gt; &lt;td&gt;A framework for making accelerated multitouch UI&lt;/td&gt; &lt;td&gt;18000000&lt;/td&gt; &lt;td&gt;1945&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/times/0.6&#34;&gt;times&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Times is a small, minimalistic, Python library for dealing with time conversions between universal time and arbitrary timezones.&lt;/td&gt; &lt;td&gt;4000&lt;/td&gt; &lt;td&gt;1929&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/CocoPy/1.1.0rc&#34;&gt;CocoPy&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Python implementation of the famous CoCo/R LL(k) compiler generator.&lt;/td&gt; &lt;td&gt;302000&lt;/td&gt; &lt;td&gt;1913&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/django-shapes/0.2.0&#34;&gt;django-shapes&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Upload and export shapefiles using GeoDjango.&lt;/td&gt; &lt;td&gt;9000&lt;/td&gt; &lt;td&gt;1901&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/sympy/0.7.2&#34;&gt;sympy&lt;/a&gt;&lt;/td&gt; &lt;td&gt;Computer algebra system (CAS) in Python&lt;/td&gt; &lt;td&gt;5000000&lt;/td&gt; &lt;td&gt;1842&lt;/td&gt;&lt;/tr&gt; &lt;tr&gt; &lt;td&gt;&lt;a href=&#34;http://pypi.python.org/pypi/pyfasta/0.4.5&#34;&gt;pyfasta&lt;/a&gt;&lt;/td&gt; &lt;td&gt;fast, memory-efficient, pythonic (and command-line) access to fasta sequence files&lt;/td&gt; &lt;td&gt;14000&lt;/td&gt; &lt;td&gt;1836&lt;/td&gt;&lt;/tr&gt;&lt;/tbody&gt;&lt;/table&gt;
&lt;hr&gt;
&lt;h2 id=&#34;comments&#34;&gt;Comments&lt;/h2&gt;
&lt;!-- wp-comments-start --&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;Ron Z&lt;/strong&gt; &lt;em&gt;25 Jun 2013 10:19 pm&lt;/em&gt;:
Another good one is simpleCV:
&lt;a href=&#34;http://www.simplecv.org/&#34;&gt;http://www.simplecv.org/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Ravindranath M&lt;/strong&gt; &lt;em&gt;8 Apr 2013 7:13 am&lt;/em&gt;:
Nice list Anand. Very useful.
&amp;ndash; This is Ravi from Comviva, who attended your introduction.&lt;/li&gt;
&lt;/ul&gt;
&lt;!-- wp-comments-end --&gt;
</description>
    </item>
    <item>
      <title>The next chapter of my life</title>
      <link>https://www.s-anand.net/blog/the-next-chapter-of-my-life/</link>
      <pubDate>Fri, 13 Jan 2012 01:01:56 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/the-next-chapter-of-my-life/</guid>
      <description>&lt;p&gt;I&amp;rsquo;m writing this post on a one-way flight from London back to India. I&amp;rsquo;ve moved on from Infosys Consulting, and am starting up on my own.&lt;/p&gt;
&lt;p&gt;I&amp;rsquo;ve wanted to do this for a long time. There&amp;rsquo;s always more freedom in your own company than someone else&amp;rsquo;s. There&amp;rsquo;s often more money in it too, if you&amp;rsquo;re lucky enough. But my upbringing is a bit too conservative to make that bold step. However, given that my father runs his own firm, I figured it was just a question of time for me to do the same.&lt;/p&gt;
&lt;p&gt;Two years ago, in Jan 2010, I picked up Rashmi Bansal&amp;rsquo;s Stay Hungry Stay Foolish at an airport. That book killed the last bit of resistance I had. If the people in that book could succeed, I felt I could too. And if what they did (building small companies, not huge ones) could be called a success, I could be successful too.&lt;/p&gt;
&lt;p&gt;After the flight, it was clear in my mind. I would be an entrepreneur. I would create a small company that would probably fold. Then I&amp;rsquo;d do it again. And again, 10 times, because 1 in 10 companies survive. And finally, I&amp;rsquo;d be running a small business that&amp;rsquo;d be called successful by virtue of having survived. A modest, achievable ambition that I had the courage for.&lt;/p&gt;
&lt;p&gt;I usually make big decisions without analysis, by just sleeping over them. I slept over it and announced it to my family the next day. I&amp;rsquo;m not sure they believed me.&lt;/p&gt;
&lt;p&gt;Two months later, along with a friend, I built a dynamic digital image resizing product. We had our wives start a company in the UK, and tried selling it to retailers. There clearly was a demand. The problem was, we didn&amp;rsquo;t know how to sell. After a year and having spent £500 with no sales, it was clear to us that venture #1 had failed. We eventually shut it down.&lt;/p&gt;
&lt;p&gt;In the middle of this, my ex- boss from IBM told me that he was looking to start a venture, focusing on mobile, rural BPO and energy management. This later on changed to data analytics and visualisation. They all sounded like fun, so I said I&amp;rsquo;ll help out in my spare time.&lt;/p&gt;
&lt;p&gt;A few months later, a classmate told me he&amp;rsquo;d started a business digitising school report cards. That sounded like fun too, so I said I&amp;rsquo;d help out in my spare time.&lt;/p&gt;
&lt;p&gt;Now, if that sounds like I had a lot of spare time on my hands &amp;ndash; you&amp;rsquo;re right, I did. And it&amp;rsquo;s time to talk about the jobs in my life. My first 3 years at IBM were fun. I was coding, learning, and leading a bachelor&amp;rsquo;s life with friends, money, and no responsibilities. My 4 years at BCG were strenuous with 80-hour weeks, but it was interesting and challenging. I was newly married, and between work and home responsibilities, I had no time for fun.&lt;/p&gt;
&lt;p&gt;I moved to Infosys Consulting in the UK with the specific aim of rectifying that (and for health reasons as well). In the last 7 years, the work has (except on occasion) been a bit boring, but very relaxing. On most days, I would spend 4 hours working, and 4 hours learning new stuff. The things I learnt only helped me be more efficient. So I ended up getting even more work done in less time.&lt;/p&gt;
&lt;p&gt;Many things came out of this. Firstly, I recovered my health. We had a daughter, and I spent more time with her. I started coding in earnest again. By 2007, I was writing code as part of my projects &amp;ndash; stuff that others whose job it was were unable to. By 2009, I had a few websites running, like an Indian music search engine, an IMDb Top 250 tracker, a few transliterators, and so on.&lt;/p&gt;
&lt;p&gt;So when I said I&amp;rsquo;d help out with these startups, it wasn&amp;rsquo;t an empty promise. For the last 18 months, I&amp;rsquo;ve had a day job and three night jobs. I never did justice to any of them in my opinion, but I had more fun than ever in my life, I learnt more than ever in my life, and I produced more tangible output than ever in my life. Sometimes, quantity beats quality or reliability.&lt;/p&gt;
&lt;p&gt;Both these startups are doing well today. &lt;a href=&#34;http://gramener.com/&#34;&gt;Gramener.com&lt;/a&gt; offers data visualisation and IT services. I will be joining them as Chief Data Scientist. &lt;a href=&#34;http://www.reportbee.com/&#34;&gt;Reportbee.com&lt;/a&gt; offers a hosted report card solution. I will continue helping them out. And I will continue working with a few NGOs.&lt;/p&gt;
&lt;p&gt;You&amp;rsquo;ll see me a lot more active online now. I can publicly write about my work &amp;ndash; something I&amp;rsquo;ve been unable to do the last 11 years.&lt;/p&gt;
&lt;p&gt;I am relocating to Bangalore. From a professional front, it&amp;rsquo;s an obvious choice. That&amp;rsquo;s where the geeks are. In my last visit to India, I was at Bangalore, Chennai and Hyderabad. In the latter two, it&amp;rsquo;s tough to meet geeks. And when you do, it&amp;rsquo;s no easier to find the next. Bangalore has many more geeks, and they&amp;rsquo;re fairly well networked.&lt;/p&gt;
&lt;p&gt;From a personal front, too, Bangalore works well. It&amp;rsquo;s close enough to Chennai without actually being in Chennai.&lt;/p&gt;
&lt;p&gt;It&amp;rsquo;s 10am on Thu 12th Jan. Our flight is descending into Delhi airport. It&amp;rsquo;s the start of a new chapter in my life. Scary, but exciting. Wish me luck!&lt;/p&gt;
&lt;hr&gt;
&lt;h2 id=&#34;comments&#34;&gt;Comments&lt;/h2&gt;
&lt;!-- wp-comments-start --&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://thejeshgn.com&#34;&gt;Thejesh GN&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 9:19 am&lt;/em&gt;:
Welcome back.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;AnanthRK&lt;/strong&gt; &lt;em&gt;13 Jan 2012 8:51 am&lt;/em&gt;:
Great to hear that you are taking the plunge full-time. All the very best!!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Madhur Singhal&lt;/strong&gt; &lt;em&gt;13 Jan 2012 12:47 pm&lt;/em&gt;:
Anand, best wishes!! Well - I never had a doubt that you take only 4 hrs for 8 hrs of work anyway.
I have been guilty of being lazy in calling but thankfully, I travel to Bangalore sometimes. I am at 9873901163 and if you tell me your #, I will call you.
cheers!!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Ashish&lt;/strong&gt; &lt;em&gt;13 Jan 2012 12:31 pm&lt;/em&gt;:
Hey Anand!
Good to hear that, best of luck for your ventures&amp;hellip;&amp;hellip;happy Independance!! Do let me know if i can be of any help
Ashish&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Raghu&lt;/strong&gt; &lt;em&gt;13 Jan 2012 12:42 pm&lt;/em&gt;:
Enjoy always and lead from the front! All the best and do well!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Kalpesh&lt;/strong&gt; &lt;em&gt;13 Jan 2012 10:22 am&lt;/em&gt;:
Anand,
I am sure, you have all things needed to do better things in life.
Hopefully, we will meet &amp;amp; work together in future.
Best Wishes
Kalpesh&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Vanaja&lt;/strong&gt; &lt;em&gt;13 Jan 2012 11:28 am&lt;/em&gt;:
All the best Anand! I have always wondered why you were stuck with Infosys when you were so much more. This looks like the way to go. Good Luck and God Bless!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://NA&#34;&gt;Pawan Bhargava&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 9:55 am&lt;/em&gt;:
Hi SAnand, good call. It does not matter how it works out (trading in handsight), but all that matters is enjoying what you do. I am sure it would be immensely satisfying. Good luck.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://notmycuppatea!&#34;&gt;Ravish&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 10:00 am&lt;/em&gt;:
People said &amp;ldquo;search&amp;rdquo; was too late for Google.. they also said &amp;ldquo;social networking&amp;rdquo; was too late for Facebook.. good that neither Larry Page nor Mark Zuckerberg listened to them..
All the best Anand.. Good Luck !! Its never too late for new ideas!!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://www.jigsawacademy.in&#34;&gt;Gaurav&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 1:29 pm&lt;/em&gt;:
Way to go Anand! You will love being an entrepreneur - the freedom to try different things and the satisfaction you get when something works&amp;hellip;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;408wij&lt;/strong&gt; &lt;em&gt;13 Jan 2012 2:17 pm&lt;/em&gt;:
Good luck.
&amp;ndash;Joe&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;sriram&lt;/strong&gt; &lt;em&gt;13 Jan 2012 2:49 pm&lt;/em&gt;:
All the best Thala.. :)&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Somnath&lt;/strong&gt; &lt;em&gt;13 Jan 2012 3:35 pm&lt;/em&gt;:
Just goes to show the fan following you have. I am really late in checking your latest post. Welcome back to Bangalore and India. I see couple of batchmates have posted to.
Wish I can join small organization / startup but am hesitant to take the risk.
Then again what is my true skill set :D
Somnath&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://www.raremile.com&#34;&gt;Harish Kashyap&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 4:59 pm&lt;/em&gt;:
Welcome to place where you belong! I am sure you will do well. You can reach me at 99010 32469. It will be good to have a cup of coffee with you!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Suresh&lt;/strong&gt; &lt;em&gt;13 Jan 2012 5:27 pm&lt;/em&gt;:
Wish you success.
&amp;ldquo;Real success comes not from being invited onto the yacht, but from being able to paddle one’s own canoe&amp;rdquo; - Hugh McLeod&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Sridhar&lt;/strong&gt; &lt;em&gt;13 Jan 2012 5:34 pm&lt;/em&gt;:
All the very best Anand! I am sure you&amp;rsquo;ll have no problem adding tremendous value to whatever you produce and that will ensure your success.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://praphul.com&#34;&gt;praphul&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 6:54 pm&lt;/em&gt;:
Congratulations!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://sanspace.in&#34;&gt;San&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 9:12 pm&lt;/em&gt;:
You&amp;rsquo;ve always been an inspiration and it seems like you always will. All the best!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Sathish&lt;/strong&gt; &lt;em&gt;13 Jan 2012 10:13 pm&lt;/em&gt;:
Didn&amp;rsquo;t actually get the technical part you are talking about&amp;hellip; but looks like your are excited and I&amp;rsquo;m happy for you&amp;hellip; ALL THE VERY BEST!!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Madhu&lt;/strong&gt; &lt;em&gt;14 Jan 2012 2:53 am&lt;/em&gt;:
Good luck, many dream of doing it and few take the bold step. I am glad you did.
Congratulations and wish you the best.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Vasant&lt;/strong&gt; &lt;em&gt;13 Jan 2012 4:25 am&lt;/em&gt;:
Awesome! Welcome back. And best of luck ahead.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Girish&lt;/strong&gt; &lt;em&gt;13 Jan 2012 3:07 am&lt;/em&gt;:
Congratulations for new change Anand :-)
S-Anand.net is always at the back of my mind for the content it has.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;satish&lt;/strong&gt; &lt;em&gt;13 Jan 2012 7:09 am&lt;/em&gt;:
Wow. Good to know sir. Wish you all the very best&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://novogeek.com&#34;&gt;Krishna&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 6:43 am&lt;/em&gt;:
Nice to know this Anand. I&amp;rsquo;ve been following your exciting works in our intranet blogs. For sure, this is going to be the best decision you ever made :) Wish you loads of luck!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Cipher&lt;/strong&gt; &lt;em&gt;13 Jan 2012 6:55 am&lt;/em&gt;:
Congrats and the best for your future Anand.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://veerasundar.com/blog&#34;&gt;Veera&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 4:53 am&lt;/em&gt;:
Whoa! that explains the number the data visualization posts in your blog. :)
Congratulations for starting up on your own!
Me too in the same situation, going to work on my own start up from coming March onwards :)&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;harish&lt;/strong&gt; &lt;em&gt;13 Jan 2012 3:44 am&lt;/em&gt;:
Hi Anand&amp;hellip;.. wish you the very best and am sure you will have no problems succeeding&amp;hellip;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://twitter.com/Venkatramanan&#34;&gt;Venkatramanan&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 3:51 am&lt;/em&gt;:
Anand
Surprising to see you very late to entrepreneurship! I thought you were managing your business! All the very best! As they say in school &amp;lsquo;you will definitely come with flying colours!&amp;rsquo;
Regards
Venkat&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://chaitpress.wordpress.com&#34;&gt;chaitanya&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 1:35 am&lt;/em&gt;:
All The Best, Anand. It was always knowledgable and pleasure to follow you. Good luck.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;saurabh nitin&lt;/strong&gt; &lt;em&gt;13 Jan 2012 4:33 am&lt;/em&gt;:
best of luck brother! cheers&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://shijuthomas.blogspot.com&#34;&gt;S_Thomas&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 3:20 am&lt;/em&gt;:
Congratulations Anand, we look forward to hearing more&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Manish&lt;/strong&gt; &lt;em&gt;13 Jan 2012 4:36 am&lt;/em&gt;:
Anand, congrats
I was also struggling with the same thoughts to take up a job or start on own&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Ayyappa&lt;/strong&gt; &lt;em&gt;13 Jan 2012 4:40 am&lt;/em&gt;:
Best of luck Anand!
Btw -I am a daily user of your mixamail for twitter and never said thanks! Thanks a lot for that!
Also, I hope you write your experiences in the startup life for &amp;ldquo;other conservatives who are afraid to jump&amp;rdquo; to learn how it feels to be in the wild outside.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;sadhasivam&lt;/strong&gt; &lt;em&gt;24 Jan 2012 9:33 pm&lt;/em&gt;:
Good Luck Anand. Being associated with you as read for a decades i am thrilled to go through post. We wish a great journey ahead.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;vivek&lt;/strong&gt; &lt;em&gt;22 Jan 2012 5:49 pm&lt;/em&gt;:
Best of luck Anand.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Sankar&lt;/strong&gt; &lt;em&gt;23 Jan 2012 2:05 am&lt;/em&gt;:
All the best Anand!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;MohaN&lt;/strong&gt; &lt;em&gt;23 Jan 2012 3:26 pm&lt;/em&gt;:
As someone mentioned, I stumbled across on a pursuit&amp;hellip;Life an Unwrapped GIFT&amp;hellip;&amp;hellip;Tear it or Peal it or Break it&amp;hellip;something underneath it&amp;hellip;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://twitter.com/karthickk&#34;&gt;Karthick&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 8:41 am&lt;/em&gt;:
All the best.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Naveen&lt;/strong&gt; &lt;em&gt;14 Jan 2012 5:37 am&lt;/em&gt;:
Anand- Congratulations , the day I had been waiting for long time. You will make a big impact where ever you are. Good Luck to you and Gramener&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Rajesh bhura&lt;/strong&gt; &lt;em&gt;14 Jan 2012 2:10 pm&lt;/em&gt;:
Finally! This is teriffic news. From our campus days I always thought that this was the way to go for u.
Remember the digital signature idea which u had come up with as our e-commerce project? It&amp;rsquo;s a big industry now in 10 yrs. I don&amp;rsquo;t have any doubt whatever u do will be successful in it&amp;rsquo;s own way. All the best. Your fan for always - rajesh&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://none&#34;&gt;Ashwin&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;14 Jan 2012 5:42 pm&lt;/em&gt;:
Anand - I have been following your blog for several years now. I wish you all the best !!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://connectthedots.wordpress.com&#34;&gt;Nirav Kanakia&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;3 Feb 2012 6:09 pm&lt;/em&gt;:
Good luck&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Shobha&lt;/strong&gt; &lt;em&gt;9 Feb 2012 9:27 am&lt;/em&gt;:
Hi Anand,
You do not know me. But I had read your posts in 2007 and I was inspired by your diverse interests in almost every area. Suddenly I remembered you today and read your recent post and gotta know you are starting your own firm in India. All the best and kudos to you.
-Shobha-&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://tildekarthik.blogspot.com&#34;&gt;Karthik A&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;12 Feb 2012 3:30 am&lt;/em&gt;:
All the best - have thought several times of making the leap but never got out of the comfort zone - Very happy you did. Maybe probability of this visualization thing becoming the next infy is 100%
All the best&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Ravindra&lt;/strong&gt; &lt;em&gt;3 Feb 2012 12:17 pm&lt;/em&gt;:
Thaliva&amp;hellip;All the best!
Looking forward the IPO in Year 2015 or earlier!
Cheers&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://sramana.in&#34;&gt;Ramana&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;16 Jan 2012 3:13 am&lt;/em&gt;:
All the best Anand!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://www.anands.net&#34;&gt;Anand S&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;16 Jan 2012 1:08 am&lt;/em&gt;:
Anand
Good luck. Our paths are similar (I am anand @ anands.net). After 12 years in silicon valley, I returned to Bangalore an year ago to run my own venture (started this 4 years ago). Let&amp;rsquo;s meet in Bangalore.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Venkataragavan&lt;/strong&gt; &lt;em&gt;25 Jan 2012 5:25 pm&lt;/em&gt;:
Hey Anand,
wish you good luck and great success ahead. I got interested into data visualization after reading your blogs and now I am actively learning it. Hope to move on someday.
Cheers&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;ravi atluri&lt;/strong&gt; &lt;em&gt;13 Jan 2012 2:19 am&lt;/em&gt;:
this is great. Congratulations. Data in India is going to get more exciting :D&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;https://plus.google.com/103962380414689139140&#34;&gt;Ravi&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;13 Jan 2012 6:01 am&lt;/em&gt;:
All the best Anand. I&amp;rsquo;ve loved your site and all the tools you&amp;rsquo;ve built around it. I&amp;rsquo;ve always wondered how you got so much time to do all that you do. Gramener seems to be a happening place now and I am sure you will make it a grand success.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Amitesh Jasrotia&lt;/strong&gt; &lt;em&gt;13 Jan 2012 1:24 am&lt;/em&gt;:
Hey Anand, I was not really inspired by Rashmi Bansal&amp;rsquo;s book but I am mighty inspired by the piece you have written. Nothing else is more self-liberating than becoming the master of your own destiny. I have been following your blogs/site for quite some time now. Something tells me you will be successful. Still, Best of luck for your future endeavors!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Nithin&lt;/strong&gt; &lt;em&gt;16 Jan 2012 11:50 am&lt;/em&gt;:
All the Best Anand&amp;hellip;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Anuradha Shastry&lt;/strong&gt; &lt;em&gt;16 Jan 2012 3:46 am&lt;/em&gt;:
Lots of good luck!!
Landed on this blog just an hour ago.
best,
another Infoscion&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Sumit Dhar&lt;/strong&gt; &lt;em&gt;16 Jan 2012 6:32 am&lt;/em&gt;:
Now that you have moved to Bangalore, we should exchange numbers and plan on catching up. Where, in Bangalore, are you based out of ?
Cheers,
D.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://dhammo.blogspot.com&#34;&gt;D&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;2 Mar 2012 12:10 pm&lt;/em&gt;:
Anand,
Wish you tremendous amount of luck.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Nikhil&lt;/strong&gt; &lt;em&gt;31 Jan 2012 9:31 am&lt;/em&gt;:
Might be of interest to you &lt;a href=&#34;http://kurt.karmalab.org/2012/01/30/building-a-data-team/&#34;&gt;http://kurt.karmalab.org/2012/01/30/building-a-data-team/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Sreenivasan L&lt;/strong&gt; &lt;em&gt;1 Feb 2012 11:11 am&lt;/em&gt;:
All the best Anand. Wishing you a great success ahead in your new journey.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Judy H&lt;/strong&gt; &lt;em&gt;23 Feb 2012 7:22 am&lt;/em&gt;:
I have no idea how I found your website today for the first time, but I&amp;rsquo;ve enjoyed reading it. I wish you all the best in your endeavors!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Sri&lt;/strong&gt; &lt;em&gt;19 Jan 2012 2:50 pm&lt;/em&gt;:
Hi Anand
I have followed your blog several years now. It&amp;rsquo;s great to hear about the new venture. Very inspirational post. Good luck and all the best.
Vaalga Valamudan
Sri&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Sajiv&lt;/strong&gt; &lt;em&gt;18 Jan 2012 4:20 pm&lt;/em&gt;:
All the best Anand.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://www.pankajnath.in&#34;&gt;pankaj&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;18 Jan 2012 6:39 pm&lt;/em&gt;:
Good luck with your new venture.
Keep us posted. :)&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Ranganathan&lt;/strong&gt; &lt;em&gt;18 Jan 2012 7:53 pm&lt;/em&gt;:
Hey Anand,
I used to follow ur blogs for the past 2 years. I think i came to know about ur blog when i was searching about the tips in excel . Sometimes if I am bored i used to check ur site for the movie list..:-) ..
I just want to say &amp;lsquo;All the very best &amp;rsquo; for ur new journey.. I am sure definitely u will succeed&amp;hellip;..this will be an inspiration for me some day for starting a new company&amp;hellip;.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://www.s-anand.net/&#34;&gt;S Anand&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;16 Jan 2012 1:26 pm&lt;/em&gt;:
@Sumit: definitely. Still haven&amp;rsquo;t move into Bangalore just yet, but my contact number is on the home page. Please feel free to call any time,&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Shankar V&lt;/strong&gt; &lt;em&gt;16 Jan 2012 2:04 pm&lt;/em&gt;:
hey Anand
All the very best and trust me&amp;hellip;..I knew this was coming! :)
Welcome back to India and welcome to Bangalore. Hope you continue to post interesting stuff.
Please do stay in touch. I had your Infosys email id. Don&amp;rsquo;t think I have your personal id. Please pass it on.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;ranjit bawa&lt;/strong&gt; &lt;em&gt;16 Jan 2012 4:09 pm&lt;/em&gt;:
hey Anand - great to hear!! good luck with the new chapter and look forward to seeing you soon. hope to follow suit, but till then, shall live vicariously&amp;hellip;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://www.s-anand.net/&#34;&gt;S Anand&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;18 Jan 2012 1:46 am&lt;/em&gt;:
@Shankar, I keep my latest phone number at the top of my home page. Will be good to hear from you!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://suddhospeak.blogspot.com/&#34;&gt;Rajesh B&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;18 Jan 2012 7:00 am&lt;/em&gt;:
Great to know you are starting off on your own. Good luck. I took my one way ticket to India 3 years ago. Still burning through my first venture. Inspiring post. Am planning to start 9 other on the side just to be on the correct side of the odds.
Jokes apart, can think of few others more equipped to start off on something. If ever you are interested in doing something on the education space, drop me an email. Will try to make that as my night job. Am good with creating content, abysmal poor in trying to sell it. So, ideal for a night-job.
Best wishes.
Cheers,
Bee&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://www.tiruven.com&#34;&gt;Ravi Tiruvaipati&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;18 Jan 2012 1:13 pm&lt;/em&gt;:
Hi Anand, I have been following your posts and your applications&amp;hellip;It is good hear that you are planning to start your own. I wish you all the best!!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Sriram S&lt;/strong&gt; &lt;em&gt;15 Jan 2012 6:14 am&lt;/em&gt;:
Welcome back and all the best&amp;hellip;I stay in BTM Layout in Bangalore..lets catch up sometime&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;http://sudheernarayan.blogspot.com&#34;&gt;Sudheer&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;15 Jan 2012 9:35 am&lt;/em&gt;:
All the best Anand! Looking forward to hear more and more about you in the coming days from sources other than the blog&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Jitendra&lt;/strong&gt; &lt;em&gt;15 Jan 2012 3:25 pm&lt;/em&gt;:
Wish you luck Anand! I am sure with your attitude and energy you&amp;rsquo;d do well in whatever you try to do!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Raja&lt;/strong&gt; &lt;em&gt;24 Aug 2012 3:25 am&lt;/em&gt;:
I try to visit you website since 2008 whenever I get a chance and look for what geeks are doing lately :-) and just noticed today that you moved to India starting out your own venture. Hard work pays off for sure. I am sure you will succeed. Good Luck!&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Michael&lt;/strong&gt; &lt;em&gt;22 Oct 2012 7:16 pm&lt;/em&gt;:
Good luck with this Anand. hope it is going well.. Michael&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;mohan&lt;/strong&gt; &lt;em&gt;11 Nov 2012 7:50 am&lt;/em&gt;:
all the best mr anand
keep going
your website is so informative with high entertainment value ,
you will suceed
god bless you
mohan.
you will definitely suceed in&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Amutha&lt;/strong&gt; &lt;em&gt;25 Nov 2013 9:37 pm&lt;/em&gt;:
It&amp;rsquo;s very late if I say gud luck,:) and I hope you are going great with your plans.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Ankur&lt;/strong&gt; &lt;em&gt;15 Apr 2013 8:22 am&lt;/em&gt;:
Hi Anand,
I first heard of you courtesy Rahul Guha during my first year at BCG in Mumbai in 2006. He mentioned you as a Consultant he had a very high opinion of.
I came across you next a couple of years later, as I was trying to index by IMDB 250 list - I used the app you&amp;rsquo;d created and recommended it to many friends too.
Today, I reached your blog while browsing through some data on poverty in India (datastories.in).
Just wanted to let you know. I wish you all the best in your venture(s).
Ankur&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;https://www.s-anand.net/blog/father-of-the-bride/&#34;&gt;Father of the bride - S Anand&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;1 Nov 2023 8:25 pm&lt;/em&gt; &lt;em&gt;(pingback)&lt;/em&gt;:
[…] In 2012, I started Gramener with half a dozen friends. […]&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;https://www.s-anand.net/blog/10-years-later/&#34;&gt;10 years later - S Anand&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;17 Mar 2022 1:24 pm&lt;/em&gt; &lt;em&gt;(pingback)&lt;/em&gt;:
[…] 12 Jan 2012, on a flight back from London, I […]&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;https://www.s-anand.net/blog/moving-to-singapore/&#34;&gt;Moving to Singapore - S Anand&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;2 Aug 2022 6:37 pm&lt;/em&gt; &lt;em&gt;(pingback)&lt;/em&gt;:
[…] “I lost my job. Please don’t tell anyone. Let’s go back to India.” We left 2 weeks later to join […]&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;&lt;a href=&#34;https://www.s-anand.net/blog/a-challenge-of-blog-questions/&#34;&gt;A challenge of blog questions - S Anand&lt;/a&gt;&lt;/strong&gt; &lt;em&gt;4 Mar 2025 4:44 pm&lt;/em&gt; &lt;em&gt;(pingback)&lt;/em&gt;:
[…] The next chapter of my life, which I wrote on a one-way flight back from the UK to India to start Gramener. […]&lt;/li&gt;
&lt;/ul&gt;
&lt;!-- wp-comments-end --&gt;
</description>
    </item>
    <item>
      <title>Bayes’ Theorem</title>
      <link>https://www.s-anand.net/blog/bayes-theorem/</link>
      <pubDate>Mon, 11 Oct 2010 14:53:01 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/bayes-theorem/</guid>
      <description>&lt;p&gt;I’ve tried understanding &lt;a href=&#34;http://en.wikipedia.org/wiki/Bayes&#39;_theorem&#34;&gt;Bayes’ Theorem&lt;/a&gt; several times. I’ve always managed to get confused. Specifically, I’ve always wondered why it’s better than simply using the average estimate from the past. So here’s a little attempt to jog my memory the next time I forget.&lt;/p&gt;
&lt;p&gt;Q: A coin shows 5 heads when tossed 10 times. What’s the probability of a heads?&lt;br&gt;
A: It’s not 0.5. That’s the most likely estimate. The probability distribution is actually:&lt;/p&gt;
&lt;p&gt;&lt;a href=&#34;https://www.s-anand.net/blog/assets/bayesian1.webp&#34;&gt;&lt;img alt=&#34;dbeta(x,5,5)&#34; loading=&#34;lazy&#34; src=&#34;https://www.s-anand.net/blog/assets/bayesian1.webp&#34;&gt;&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;That’s because you don’t really know the probability with which the coin will throw a heads. It could be any number p. So lets say we have a probability distribution for it, f(p).&lt;/p&gt;
&lt;p&gt;Initially, you don’t know what this probability distribution is. So assume they’re all the same – a flat function: f(p) = 1&lt;a href=&#34;https://www.s-anand.net/blog/assets/bayesian2.webp&#34;&gt;&lt;img alt=&#34;dbeta(x,1,1)&#34; loading=&#34;lazy&#34; src=&#34;https://www.s-anand.net/blog/assets/bayesian2.webp&#34;&gt;&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Now, given this, let’s say a heads falls on the next toss. What’s the revised probability distribution? It’s:&lt;/p&gt;
&lt;p&gt;f(p) ← f(p) * probability(heads | x) / probability(heads) = 1 * (x^1 * (1-x)^0) / 1 = x&lt;/p&gt;
&lt;p&gt;&lt;a href=&#34;https://www.s-anand.net/blog/assets/bayesian3.webp&#34;&gt;&lt;img alt=&#34;dbeta(x,2,1)&#34; loading=&#34;lazy&#34; src=&#34;https://www.s-anand.net/blog/assets/bayesian3.webp&#34;&gt;&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Let’s say the next is again a heads. Now it’s&lt;/p&gt;
&lt;p&gt;f(p) ← f(p) * probability(heads | x) / probability(heads) = x * (x^1 * (1-x)^0) / 1 = x^2&lt;/p&gt;
&lt;p&gt;&lt;a href=&#34;https://www.s-anand.net/blog/assets/bayesian4.webp&#34;&gt;&lt;img alt=&#34;dbeta(x,3,1)&#34; loading=&#34;lazy&#34; src=&#34;https://www.s-anand.net/blog/assets/bayesian4.webp&#34;&gt;&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Now if it’s a tails, it becomes:&lt;/p&gt;
&lt;p&gt;f(p) ← f(p) * prob(tails | x) / prob(tails) = x^2 * (x^0 * (1-x)^1) / 1 = x^2 * (1-x)&lt;/p&gt;
&lt;p&gt;&lt;a href=&#34;https://www.s-anand.net/blog/assets/bayesian5.webp&#34;&gt;&lt;img alt=&#34;dbeta(x,3,2)&#34; loading=&#34;lazy&#34; src=&#34;https://www.s-anand.net/blog/assets/bayesian5.webp&#34;&gt;&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;… and so on. (This happens to be a called a Beta distribution.)&lt;/p&gt;
&lt;p&gt;Now, instead of this being the probability of heads, it could be the probability of a person having blood pressure, or a document being spam. As you get more data, the probability distribution of the probability keeps getting revised.&lt;/p&gt;
&lt;hr&gt;
&lt;h2 id=&#34;comments&#34;&gt;Comments&lt;/h2&gt;
&lt;!-- wp-comments-start --&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;Ram&lt;/strong&gt; &lt;em&gt;18 Jan 2012 1:59 pm&lt;/em&gt;:
Hi Anand,
f(p) ← f(p) * probability(heads | x) / probability(heads) = 1 * (x^1 * (1-x)^0) / 1 = x
What I understand from the above notation is f(p) stands for probability distribution function (which is used recursively), x stands for the probability of getting a head (which is unknown) and 1-x stands for the complement of x.
Can you please explain why the distribution function is defined as you have done? i.e. , f(p) ← f(p) * probability(heads | x) / probability(heads)&lt;/li&gt;
&lt;/ul&gt;
&lt;!-- wp-comments-end --&gt;
</description>
    </item>
    <item>
      <title>Managing the data deluge</title>
      <link>https://www.s-anand.net/blog/managing-the-data-deluge/</link>
      <pubDate>Sat, 10 Feb 2007 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/managing-the-data-deluge/</guid>
      <description>&lt;p&gt;Peter Norvig&amp;rsquo;s brilliant talk on &lt;a href=&#34;mms://media.citris.berkeley.edu/Peter_Norvig&#34;&gt;Managing the Data Deluge&lt;/a&gt;. Among other things, he talks about how having lots of data is sometimes better than having a carefully designed algorithm.&lt;/p&gt;
</description>
    </item>
    <item>
      <title>Math will rock your world</title>
      <link>https://www.s-anand.net/blog/math-will-rock-your-world/</link>
      <pubDate>Sat, 14 Jan 2006 12:00:00 +0000</pubDate>
      <guid>https://www.s-anand.net/blog/math-will-rock-your-world/</guid>
      <description>&lt;p&gt;&lt;a href=&#34;http://www.businessweek.com/magazine/content/06_04/b3968001.htm&#34;&gt;It&amp;rsquo;s a good time to be a mathematician&lt;/a&gt;.&lt;/p&gt;
</description>
    </item>
  </channel>
</rss>
