<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Thu, 07 Aug 2008 21:57:27 BST</pubDate>


	<title>CiteULike: brusilovsky's datamining</title>
	<description>CiteULike: brusilovsky's datamining</description>


	<link>http://www.citeulike.org/user/brusilovsky/tag/datamining</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/brusilovsky/article/1853879"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/brusilovsky/article/1826467"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/brusilovsky/article/1826402"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/brusilovsky/article/815479"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/brusilovsky/article/1267263"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/brusilovsky/article/1853879">
    <title>Time-dependent event hierarchy construction</title>
    <link>http://www.citeulike.org/user/brusilovsky/article/1853879</link>
    <description>&lt;i&gt;(2007), pp. 300-309.&lt;/i&gt;</description>
    <dc:title>Time-dependent event hierarchy construction</dc:title>

    <dc:creator>Gabriel</dc:creator>
    <dc:creator>Jeffrey Yu</dc:creator>
    <dc:creator>Huan Liu</dc:creator>
    <dc:creator>Philip Yu</dc:creator>
    <dc:identifier>doi:10.1145/1281192.1281227</dc:identifier>
    <dc:source>(2007), pp. 300-309.</dc:source>
    <dc:date>2007-11-02T01:59:42-00:00</dc:date>
    <prism:publicationYear>2007</prism:publicationYear>
    <prism:startingPage>300</prism:startingPage>
    <prism:endingPage>309</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>datamining</prism:category>
    <prism:category>news</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/brusilovsky/article/1826467">
    <title>Improving web site search using web server logs</title>
    <link>http://www.citeulike.org/user/brusilovsky/article/1826467</link>
    <description>&lt;i&gt;(2006)&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Despite the success of global search engines, web site search engines are still suffering from poor performance. Since a web site is different from the whole web in link structure, access pattern, and data scale, it is not always successful when the methods which improve the performance of web search are applied to web site search. In this paper, we propose a novel algorithm to improve the retrieval performance by using web server logs. Web server logs are grouped into different sessions and the relationships of web pages in the session are analyzed based on their similarities. Then, a new web page representation is generated. Anchor text is used to create another representation. They are combined with original text-based representation in web site search. Two kinds of combination methods are investigated and tested: combination of document representations and combination of ranking scores. Our experimental results show that our algorithm can improve the retrieval accuracy for the four retrieval models we tested: Inference Network Model, Okapi Model, Cosine Similarity Model and TFIDF Model. The highest performance increase from web log analysis is from TFIDF model, and overall, inference network model with web log information achieves the best result.</description>
    <dc:title>Improving web site search using web server logs</dc:title>

    <dc:creator>Jin Zhou</dc:creator>
    <dc:creator>Chen Ding</dc:creator>
    <dc:creator>Dimitrios Androutsos</dc:creator>
    <dc:identifier>doi:10.1145/1188966.1188996</dc:identifier>
    <dc:source>(2006)</dc:source>
    <dc:date>2007-10-26T19:16:18-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>datamining</prism:category>
    <prism:category>en</prism:category>
    <prism:category>log-mining</prism:category>
    <prism:category>social-search</prism:category>
    <prism:category>www-search</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/brusilovsky/article/1826402">
    <title>Implicit link analysis for small web search</title>
    <link>http://www.citeulike.org/user/brusilovsky/article/1826402</link>
    <description>&lt;i&gt;(2003), pp. 56-63.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Current Web search engines generally impose link analysis-based re-ranking on web-page retrieval. However, the same techniques, when applied directly to small web search such as intranet and site search, cannot achieve the same performance because their link structures are different from the global Web. In this paper, we propose an approach to constructing implicit links by mining users' access patterns, and then apply a modified PageRank algorithm to re-rank web-pages for small web search. Our experimental results indicate that the proposed method outperforms content-based method by 16%, explicit link-based PageRank by 20% and DirectHit by 14%, respectively</description>
    <dc:title>Implicit link analysis for small web search</dc:title>

    <dc:creator>Gui-Rong Xue</dc:creator>
    <dc:creator>Hua-Jun Zeng</dc:creator>
    <dc:creator>Zheng Chen</dc:creator>
    <dc:creator>Wei-Ying Ma</dc:creator>
    <dc:creator>Hong-Jiang Zhang</dc:creator>
    <dc:creator>Chao-Jun Lu</dc:creator>
    <dc:identifier>doi:10.1145/860435.860448</dc:identifier>
    <dc:source>(2003), pp. 56-63.</dc:source>
    <dc:date>2007-10-26T19:10:18-00:00</dc:date>
    <prism:publicationYear>2003</prism:publicationYear>
    <prism:startingPage>56</prism:startingPage>
    <prism:endingPage>63</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>datamining</prism:category>
    <prism:category>en</prism:category>
    <prism:category>social-search</prism:category>
    <prism:category>www-search</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/brusilovsky/article/815479">
    <title>Web search enhancement by mining user actions</title>
    <link>http://www.citeulike.org/user/brusilovsky/article/815479</link>
    <description>&lt;i&gt;Information Sciences, Vol. In Press, Corrected Proof&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Search engines are among the most popular as well as useful services on the web. There is a need, however, to cater to the preferences of the users when supplying the search results to them. We propose to maintain the search profile of each user, on the basis of which the search results would be determined. This requires the integration of techniques for measuring search quality, learning from the user feedback and biased rank aggregation, etc. For the purpose of measuring web search quality, the &#34;user satisfaction&#34; is gauged by the sequence in which he picks up the results, the time he spends at those documents and whether or not he prints, saves, bookmarks, e-mails to someone or copies-and-pastes a portion of that document. For rank aggregation, we adopt and evaluate the classical fuzzy rank ordering techniques for web applications, and also propose a few novel techniques that outshine the existing techniques. A &#34;user satisfaction&#34; guided web search procedure is also put forward. Learning from the user feedback proceeds in such a way that there is an improvement in the ranking of the documents that are consistently preferred by the users. As an integration of our work, we propose a personalized web search system.</description>
    <dc:title>Web search enhancement by mining user actions</dc:title>

    <dc:creator>Sufyan Beg</dc:creator>
    <dc:creator>Nesar Ahmad</dc:creator>
    <dc:identifier>doi:10.1016/j.ins.2006.06.011</dc:identifier>
    <dc:source>Information Sciences, Vol. In Press, Corrected Proof</dc:source>
    <dc:date>2006-08-24T14:04:05-00:00</dc:date>
    <prism:publicationName>Information Sciences</prism:publicationName>
    <prism:volume>In Press, Corrected Proof</prism:volume>
    <prism:category>datamining</prism:category>
    <prism:category>www-search</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/brusilovsky/article/1267263">
    <title>Mining massive document collections by the WEBSOM method</title>
    <link>http://www.citeulike.org/user/brusilovsky/article/1267263</link>
    <description>&lt;i&gt;Inf. Sci., Vol. 163, No. 1-3. (2004), pp. 135-156.&lt;/i&gt;</description>
    <dc:title>Mining massive document collections by the WEBSOM method</dc:title>

    <dc:creator>Krista Lagus</dc:creator>
    <dc:creator>Samuel Kaski</dc:creator>
    <dc:creator>Teuvo Kohonen</dc:creator>
    <dc:identifier>doi:10.1016/j.ins.2003.03.017</dc:identifier>
    <dc:source>Inf. Sci., Vol. 163, No. 1-3. (2004), pp. 135-156.</dc:source>
    <dc:date>2007-04-30T05:05:59-00:00</dc:date>
    <prism:publicationYear>2004</prism:publicationYear>
    <prism:publicationName>Inf. Sci.</prism:publicationName>
    <prism:issn>0020-0255</prism:issn>
    <prism:volume>163</prism:volume>
    <prism:number>1-3</prism:number>
    <prism:startingPage>135</prism:startingPage>
    <prism:endingPage>156</prism:endingPage>
    <prism:publisher>Elsevier Science Inc.</prism:publisher>
    <prism:category>datamining</prism:category>
    <prism:category>som</prism:category>
</item>



</rdf:RDF>

