<?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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Hakan Özerdem &#187; ashutosh</title>
	<atom:link href="http://www.hakanozerdem.com/tag/ashutosh/feed" rel="self" type="application/rss+xml" />
	<link>http://www.hakanozerdem.com</link>
	<description>Diary of a mad man...</description>
	<lastBuildDate>Tue, 04 May 2010 03:52:15 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>The new Google patent granted: Rank adjustments via click data</title>
		<link>http://www.hakanozerdem.com/blogging/how-a-search-engine-might-adjust-rankings-based-upon-patterns-in-query-and-click-logs.hkn</link>
		<comments>http://www.hakanozerdem.com/blogging/how-a-search-engine-might-adjust-rankings-based-upon-patterns-in-query-and-click-logs.hkn#comments</comments>
		<pubDate>Sat, 31 Oct 2009 19:51:13 +0000</pubDate>
		<dc:creator>Hakan Özerdem</dc:creator>
				<category><![CDATA[Blogging]]></category>
		<category><![CDATA[apple]]></category>
		<category><![CDATA[ashutosh]]></category>
		<category><![CDATA[datar]]></category>
		<category><![CDATA[google]]></category>
		<category><![CDATA[logs]]></category>
		<category><![CDATA[october 27]]></category>
		<category><![CDATA[orange]]></category>
		<category><![CDATA[patent]]></category>
		<category><![CDATA[pineapple]]></category>
		<category><![CDATA[queries]]></category>
		<category><![CDATA[query sessions]]></category>
		<category><![CDATA[search engine]]></category>
		<category><![CDATA[search patterns]]></category>
		<category><![CDATA[search session]]></category>
		<category><![CDATA[search sessions]]></category>
		<category><![CDATA[search terms]]></category>
		<category><![CDATA[web page]]></category>

		<guid isPermaLink="false">http://www.hakanozerdem.com/?p=117</guid>
		<description><![CDATA[Imagine that a number of people use Google to perform a search for “orange,” and then “banana,” and then “pineapple” and then choose the web page “http://www.example.com/fruit.htm” in the search results they see.
Now imagine that Google looks at the information it collects about what people do when they search, and finds in its query logs [...]]]></description>
			<content:encoded><![CDATA[<p>Imagine that a number of people use Google to perform a search for “orange,” and then “banana,” and then “pineapple” and then choose the web page “http://www.example.com/fruit.htm” in the search results they see.</p>
<p>Now imagine that Google looks at the information it collects about what people do when they search, and finds in its query logs and click logs that there are a large number, a statistically significant number, of people who search for “orange,” and then “banana,” and then “pineapple,” or possibly the same search terms in a slightly different order, and then tend to click on “http://www.example.com/fruit.htm.”<span id="more-117"></span></p>
<p>Google may also notice that there are people looking for some very related terms during query sessions, such as consecutive searches for “banana,” “apple” and “pineapple.”</p>
<p>Since this second set of queries for “banana,” “apple” and “pineapple,” is so similar to the query sessions that contained the search terms “orange” and “banana” and “pineapple,” where people were choosing the page “http://www.example.com/fruit.htm,” Google may choose to adjust the ranking for “http://www.example.com/fruit.htm,” for people using those very related terms in their search sessions.</p>
<p><span id="more-3054"> </span></p>
<p>Google was granted a patent on this process this past week:</p>
<p><a href="http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&amp;Sect2=HITOFF&amp;u=%2Fnetahtml%2FPTO%2Fsearch-adv.htm&amp;r=1&amp;p=1&amp;f=G&amp;l=50&amp;d=PTXT&amp;S1=7,610,282.PN.&amp;OS=pn/7,610,282&amp;RS=PN/7,610,282" target="_blank">Rank-adjusted content items</a><br />
Invented by Mayur Datar, Kedar Dhamdhere, and Ashutosh Garg<br />
Assigned to Google<br />
US Patent 7,610,282<br />
Granted October 27, 2009<br />
Filed March 30, 2007</p>
<p>Abstract</p>
<blockquote><p>Click logs and query logs are processed to identify statistical search patterns. A search session is compared to the statistical search patterns. Content items responsive to a query of the search session are identified, and a ranking of the content items is adjusted based on the comparison.</p></blockquote>
<blockquote><p><em>Content items, e.g., video and/or audio files, web pages for particular subjects, news articles, etc., can be identified by a search engine in response to a query. The query can include one or more search terms, and the search engine can identify and rank the content items based on the search terms in the query. Typically the content items are displayed according to the rank.</em></p>
<p><em>The content items, however, are often identified only in response to a particular query, i.e., the search engine may identify and rank content items to independently for each query. For example, for three different queries, the search, engine may return a particular identification and rank of content items for each particular query, regardless of the other queries. In such implementations, a particular content item that may be highly relevant to a user’s current interests may not be identified and/or highly ranked and presented to the user until the user has conducted multiple searches. Additionally, other users may experience similar challenges when searching for content.</em></p>
<p><em>SUMMARY</em></p>
<p><em>Disclosed herein are systems and methods of identifying content items. In one implementation, click logs and query logs are processed to identify statistical search patterns based on the click logs and query logs. A search session is compared to the statistical search patterns. Content items responsive to a query of the search session are identified, and a ranking of the content items is adjusted based on the comparison.</em></p>
<p><em>In another implementation, query paths and content terminuses associated with query paths are identified. Additionally, a context of a search session is identified and a determination of whether the context is related, to one or more of the query paths is made. Content items responsive to a query of the search session are identified based on the determination.</em></p>
<p><em>In another implementation, a system includes a mining engine and an adjusting engine. The mining engine mines click logs and query logs to identify query paths and content terminuses associated with the query paths. The adjusting engine adjusts a ranking of content items responsive to a search session query based on the identified query paths and content terminuses.</em></p>
<p><em>In one implementation, identification of a context of a search session facilitates the adjusting of a ranking of one or more content items in response to a search session query. The adjustment can, for example, be based on the likelihood that a current user is searching for the rank-adjusted content items because a statistically significant number of prior users that exhibited a similar behavior to the current user selected the rank-adjusted content items.</em></p></blockquote>
<h6>Taken from <a href="http://www.seobythesea.com/?p=3054" target="_blank">this</a> article.</h6>
]]></content:encoded>
			<wfw:commentRss>http://www.hakanozerdem.com/blogging/how-a-search-engine-might-adjust-rankings-based-upon-patterns-in-query-and-click-logs.hkn/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
