<?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>Fri, 05 Apr 2013 16:53:52 +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>Your follower count doesn&#8217;t matter: Hubspot&#8217;s incorrect &#8220;Value of A Like&#8221; (VOAL) formula published by Harvard Business Review</title>
		<link>http://www.seangolliher.com/2012/social-media/your-follower-count-doesnt-matter-hubspots-incorrect-value-of-a-like-voal-formula-published-by-harvard-business-review/</link>
		<comments>http://www.seangolliher.com/2012/social-media/your-follower-count-doesnt-matter-hubspots-incorrect-value-of-a-like-voal-formula-published-by-harvard-business-review/#comments</comments>
		<pubDate>Mon, 26 Nov 2012 19:01:14 +0000</pubDate>
		<dc:creator>admin</dc:creator>
		
		<category><![CDATA[Social Media]]></category>

		<guid isPermaLink="false">http://www.seangolliher.com/?p=643</guid>
		<description><![CDATA[Summary: Harvard Business Review (HBR) publishes an advertorial for Hubspot&#8217;s Dan Zarrella which includes an equation estimating the value of a like; HBR refuses to publish comments pointing out the errors. The equation claims to calculate the average value of likes even though likes cancel and therefore don&#8217;t appear in the calculation. It is impossible [...]]]></description>
			<content:encoded><![CDATA[<p><strong>Summary: </strong>Harvard Business Review (HBR) publishes an advertorial for Hubspot&#8217;s Dan Zarrella which includes an equation estimating the value of a like; HBR refuses to publish comments pointing out the errors. The equation claims to calculate the average value of likes even though likes cancel and therefore don&#8217;t appear in the calculation. It is impossible to calculate the average value of a like without including the number of likes. The formula should be entitled the &#8220;average value of a like&#8221; since there was no attempt to calculate an instantaneous value. </p>
<p> I will point out the reasons why <a href="http://blogs.hbr.org/cs/2012/11/how_to_calculate_the_value_of.html?utm_source=Socialflow&#038;utm_medium=Tweet&#038;utm_campaign=Socialflow">this equation </a>reduces to one single variable; it reduces to revenue from the social media channel. If you don&#8217;t want to follow this you can see it in action by going to<a href="http://www.valueofalike.com"> valueofalike</a> and moving the number of likes (top button) back and forth and then noting the value on the bottom; the &#8220;value of a like&#8221; doesn&#8217;t move. That&#8217;s right, the &#8220;value of a like&#8221; doesn&#8217;t change at the bottom of the page. This means you can remove that input (and much more); Their recommendation? : &#8220;Get more likes&#8221;, even though more followers won&#8217;t &#8220;add value&#8221;.</p>
<p>It&#8217;s clear that it doesn&#8217;t make sense to calculate the average value of a like without having the number of likes be a part of the formula. </p>
<p>To see this without reducing just set all variables in the equation equal to one except likes: </p>
<p>L/1 * 1/L  *1*1 = VOAL  </p>
<p>Setting L = 1 gives a value of 1 as does setting L = 1 million. Likes don&#8217;t factor in. </p>
<p>If our average sale price is a dollar, and all else is set equal to 1. We get $1.00 (modulated by some other units). If our average sale price is $1million and likes = 1 we get $1million. All this equation does is modulate the dollar value , which we already know from measuring sales from the social media channel visits, by ratios of other numbers. This is the incorrect way to model the well-known &#8220;value of a network&#8221; problems scientists have been modeling for years. </p>
<p>One can also tell by the way the equation is written that something is “not right” but I decided to see what it really reduces to since it came from Harvard Business Review. I was surprised to see HBR publish this type of article which is clearly just posing as being “mathematical”.  I didn&#8217;t realize they were now publishing advertorials. After all, no one will really pay attention if you just publish a simple formula right?  Here is the “formula” that attempts to calculate the “value of a like” (VOAL):</p>
<p>(1) L/(UpM) * (LpD*30) (C/L)*CR*(ACR)  = VOAL. </p>
<p>Should just be written as:  (L*LpD*C*CR*ACR*30)/ (L*UpM) = VOAL</p>
<p>The L’s (number of people that like your page) cancel because you have an L in the numerator and an L in the denominator.  This means that the number of people that like your business page doesn’t matter. Let&#8217;s see if this makes sense.  </p>
<p>He also thought it useful to multiply the number of links per day (Lpd) by 30 to express in terms of months (he should haver just used LpU (links per month) but maybe it looks better to put a 30 in the equation? Not sure. Therefore it is ok, since we are using averages, to cancel the implied 30 in the denominator,  unlikes-per-month (UpM).  This could give you a daily value. At any rate, it doesn’t really matter. The term CR is conversion rate and they claim it doesn’t matter if the conversion rate is calculated from your overall website or the social media traffic from which the formula is modeling. In fact, it would matter if we are trying to calculate a “value” for the network.  Now this formula reduces to: </p>
<p>(2) (C*CR*ACR*LpD)/U    </p>
<p>If you look at the term C*CR (clicks times conversion rate) we don’t need these terms either because this is total sales! There is a U (unlikes) in denominator so if you aren&#8217;t getting unliked, at some rate, this is zero. You can&#8217;t divide by zero so the default must be assumed to be one. Theoretically this could mean that if you aren&#8217;t getting unliked (unliked = 1), and since Likes don&#8217;t appear in the equation, you don&#8217;t even need a Facebook page to get the value from Facebook likes? Businesses should be happy to be getting an infinite return form doing nothing.</p>
<p> Now the formula reduces to this: </p>
<p>(3) SocialMediaRevenue*LpD/U </p>
<p>“SocialMediaRevenue” ( I just renamed his &#8220;ACR&#8221; to SocialMediaRevenue ) is just sales from the social media channel we are tracking. Since we are just producing an absolute number we could just use equation 3. The value of the number really doesn’t matter. You would have to compare the number to another set of data to see if it was “better” or get some relative meaning from it. </p>
<p>Also notice in eq. 3 that LPD/U is not useful because it just modulates, at a daily rate, the value of our average sales from the social media channel we are measuring. So let’s just get rid of that term.  We also need to add back in the number of likes to our page. Since he was trying to calculate the average value of a like AVOAL (but named the formula and didn&#8217;t include likes in the denominator) let&#8217;s divide it by L by putting the L back in the equation where it belongs. The formula published mathematically reduces to:</p>
<p>(4) SocialMediaRevenue/L = AVOAL.    </p>
<p> Or, in summary, this formula gives us no new information. The equation just says: &#8220;If you get a lot of sales from a social network then it&#8217;s valuable. Calculate the total sales form that channel to get a number&#8221;.  Except L wasn&#8217;t included in the denominator. </p>
<p>As was pointed out in the past: “selling out science is a profitable business model”. </p>
<p>If you are interested in formulas related to social computing and calculating value from social networks there are plenty of papers and research articles being published to build from. This attempt to quantify the value of a like isn&#8217;t even solving the already classified &#8220;Network Value of a Customer&#8221; problem. If we can measure the dollar amount of our customer visits from a network we don&#8217;t need to modulate it with  other ratios of values. What we want to know is the value of network followers including the secondary viral effects from users seeing brand pages etc. Modeling the value of these effects typically includes using Markov chains and other probabilistic models and should include the network effort for obtaining followings. The formula doesn&#8217;t add any value to the information we already have. </p>
]]></content:encoded>
			<wfw:commentRss>http://www.seangolliher.com/2012/social-media/your-follower-count-doesnt-matter-hubspots-incorrect-value-of-a-like-voal-formula-published-by-harvard-business-review/feed/</wfw:commentRss>
		</item>
		<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>
	</channel>
</rss>
