<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	>

<channel>
	<title>SeanGolliher.com</title>
	<atom:link href="http://www.seangolliher.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.seangolliher.com</link>
	<description>Out of the Quantization Noise: Internet Research &#38; Search Marketing</description>
	<pubDate>Thu, 08 Mar 2012 01:53:14 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.7.1</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Machine Learning &amp; Support Vector Machines (SVM) Lecture 9 CSCSI 494</title>
		<link>http://www.seangolliher.com/2012/lectures/machine-learning-support-vector-machines-svm-lecture-9-cscsi-494/</link>
		<comments>http://www.seangolliher.com/2012/lectures/machine-learning-support-vector-machines-svm-lecture-9-cscsi-494/#comments</comments>
		<pubDate>Thu, 08 Mar 2012 01:50:24 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Lectures]]></category>

		<guid isPermaLink="false">http://www.seangolliher.com/?p=511</guid>
		<description><![CDATA[Last lecture we discussed the major topics in machine learning and an important classification algorithm entitled Support Vector Machines (SVM). Modern search engines use a combination of these fundamental techniques to find the relevance of documents w.r.t a given search query.
Papers to read: Standard SVM [Cortes and Vapnik, 1995]
We also discussed a two dimensional problem [...]]]></description>
			<content:encoded><![CDATA[<p>Last lecture we discussed the major topics in machine learning and an important classification algorithm entitled Support Vector Machines (SVM). Modern search engines use a combination of these fundamental techniques to find the relevance of documents w.r.t a given search query.<br />
Papers to read: Standard SVM [Cortes and Vapnik, 1995]</p>
<p>We also discussed a two dimensional problem and showed how to expand a machine learning problem to infinite dimensions. </p>
<p><a href="http://www.slideshare.net/sgollihe/lecture-9-machine-learning-and-support-vector-machines-svm">Lecture Notes</a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.seangolliher.com/2012/lectures/machine-learning-support-vector-machines-svm-lecture-9-cscsi-494/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Probabilistic Retrieval Models - Lect. 8 CSCS 494</title>
		<link>http://www.seangolliher.com/2012/lectures/probabilistic-retrieval-models-lect-8-cscs-494/</link>
		<comments>http://www.seangolliher.com/2012/lectures/probabilistic-retrieval-models-lect-8-cscs-494/#comments</comments>
		<pubDate>Thu, 01 Mar 2012 17:00:57 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Lectures]]></category>

		<category><![CDATA[cosine similarity]]></category>

		<category><![CDATA[probabilistic retrieval]]></category>

		<guid isPermaLink="false">http://www.seangolliher.com/?p=507</guid>
		<description><![CDATA[Lecture 8 covered probabilistic retrieval models and some review of basic probability theory.
Also covered were some of the early retrieval models. Vector space models and cosine similarity.
Slides for Lect 8. 
]]></description>
			<content:encoded><![CDATA[<p>Lecture 8 covered probabilistic retrieval models and some review of basic probability theory.<br />
Also covered were some of the early retrieval models. Vector space models and cosine similarity.</p>
<p><a href="http://www.slideshare.net/sgollihe/probabilistic-retrieval-models">Slides for Lect 8. </a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.seangolliher.com/2012/lectures/probabilistic-retrieval-models-lect-8-cscs-494/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Lecture 7 - Text Statistics &amp; Document Parsing</title>
		<link>http://www.seangolliher.com/2012/uncategorized/lecture-7-text-statistics-document-parsing/</link>
		<comments>http://www.seangolliher.com/2012/uncategorized/lecture-7-text-statistics-document-parsing/#comments</comments>
		<pubDate>Thu, 23 Feb 2012 02:36:02 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.seangolliher.com/?p=494</guid>
		<description><![CDATA[Today we discussed the fundamentals behind text statistics and how to calculate probabilities of n-grams appearing in a document. Here are the slides for Lect. 7.
Some useful links.
Google&#8217;s n-grams data
Text REtreival conference 
A corpus of twitter data:Tweets2011 
]]></description>
			<content:encoded><![CDATA[<p>Today we discussed the fundamentals behind text statistics and how to calculate probabilities of n-grams appearing in a document. Here are the slides for<a href="http://www.slideshare.net/sgollihe/lecture-7-text-statistics-and-document-parsing"> Lect. 7.</a></p>
<p>Some useful links.<br />
<a href="http://googleresearch.blogspot.com/2006/08/all-our-n-gram-are-belong-to-you.html ">Google&#8217;s n-grams data</a><br />
Text REtreival <a href=" http://trec.nist.gov">conference </a><br />
A corpus of twitter data:<a href="http://trec.nist.gov/data/tweets/">Tweets2011</a> </p>
]]></content:encoded>
			<wfw:commentRss>http://www.seangolliher.com/2012/uncategorized/lecture-7-text-statistics-document-parsing/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Information Retrieval, Indexing, BigTable Lect 6 CSCI 494</title>
		<link>http://www.seangolliher.com/2012/uncategorized/information-retrieval-indexing-bigtable-lect-6-csci-494/</link>
		<comments>http://www.seangolliher.com/2012/uncategorized/information-retrieval-indexing-bigtable-lect-6-csci-494/#comments</comments>
		<pubDate>Thu, 16 Feb 2012 02:55:23 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://www.seangolliher.com/?p=489</guid>
		<description><![CDATA[Lecture 6 covered crawling issues, indexing, Google&#8217;s BigTable, detecting near duplicate and duplicate content.
Also, the next paper was handed out.
R. Song et al,. &#8220;Learning Block Importance Models for Web Pages&#8221;
Here are the slides from lecture 6
]]></description>
			<content:encoded><![CDATA[<p>Lecture 6 covered crawling issues, indexing, Google&#8217;s BigTable, detecting near duplicate and duplicate content.<br />
Also, the next paper was handed out.<br />
R. Song et al,. &#8220;Learning Block Importance Models for Web Pages&#8221;</p>
<p>Here are the slides from <a href="http://www.slideshare.net/sgollihe/information-retrieval-encoding-indexing-big-table-lecture-6-indexing">lecture 6</a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.seangolliher.com/2012/uncategorized/information-retrieval-indexing-bigtable-lect-6-csci-494/feed/</wfw:commentRss>
		</item>
		<item>
		<title>You Are Worth ~1.18/year Profit to Facebook - Facebook Files an S-1</title>
		<link>http://www.seangolliher.com/2012/social-media/you-are-worth-118year-profit-to-facebook-facebook-files-an-s-1/</link>
		<comments>http://www.seangolliher.com/2012/social-media/you-are-worth-118year-profit-to-facebook-facebook-files-an-s-1/#comments</comments>
		<pubDate>Thu, 02 Feb 2012 04:32:43 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Social Media]]></category>

		<guid isPermaLink="false">http://www.seangolliher.com/?p=461</guid>
		<description><![CDATA[Facebook filed their S-1 today and there are plenty of interesting numbers in the report.  I quickly looked at the numbers to see if there was anything interesting to graph. While looking at these numbers I defined two new metrics. Since Facebook is going public we have, for the first time, data on yearly [...]]]></description>
			<content:encoded><![CDATA[<p>Facebook filed their S-1 today and there are plenty of interesting numbers in the <a href="http://s3.documentcloud.org/documents/288782/facebookipo02012012.pdf">report</a>.  I quickly looked at the numbers to see if there was anything interesting to graph. While looking at these numbers I defined two new metrics. Since Facebook is going public we have, for the first time, data on yearly revenue for a large social network with a display ad model. Until now we haven&#8217;t had an accurate value for earnings per user on a free social network. I calculate that Facebook made a profit of approximately $1.18/MAU in 2011. MAU is defined as &#8220;Monthly Active Users&#8221;. We can define this as PMAU (profit per monthly active user). We can also define RMAU ( revenue per monthly active user). These numbers give us our first estimates on the real value of social data. </p>
<p>This may establish a reasonable &#8220;upper bound&#8221; on what you are able to make per user using the same monetization model.  Unless, of course, you have a better ad network or other applications generating revenue within your network. What advertisers are willing to spend on and ad network has more variables to it than just MAUs. </p>
<p>From an investment standpoint it is interesting to look at these two metrics. I have graphed both RMAU and PMAU below. You can see that RMAU has nearly doubled to $4.50 per MAU (monthly active user) while Profit per MAU (monthly active user) is flat. Profits, as we know, are skewed because of hiring and other expenses. These can be controlled by the company. RMAU is a better indication of how Facebook&#8217;s earnings are scaling as it&#8217;s user base grows. Judging by the RMAU graph, below, Facebook is scaling up fast in terms of revenue per active user. RMAU has doubled since 2010.</p>
<p><img src="http://www.seangolliher.com/wp-content/uploads/2012/02/facebookprofitperyear.jpg" alt="facebookprofitperyear" title="facebookprofitperyear" width="750" height="600" class="aligncenter size-full wp-image-463" /></p>
]]></content:encoded>
			<wfw:commentRss>http://www.seangolliher.com/2012/social-media/you-are-worth-118year-profit-to-facebook-facebook-files-an-s-1/feed/</wfw:commentRss>
		</item>
	</channel>
</rss>

