http://www.bibsonomy.org/burst/user/beate/clickthroughBibSonomy BuRST Feed for /user/beate/clickthrough2008-09-06T20:43:15+02:00http://www.bibsonomy.org/bibtex/296c310e546718a88f958d633c37d9461/beatebeate2007-10-17T14:35:49+02:00rankings learning clickthrough TREC <span style="color:#555555;">F. <a href="http://www.bibsonomy.org/author/Radlinski">Radlinski</a> und T. <a href="http://www.bibsonomy.org/author/Joachims">Joachims</a> </span><em>ACM SIGKDD International Conference On Knowledge Discovery and Data Mining (KDD), </em>(<em>2007</em>)Wed Oct 17 14:35:49 CEST 2007ACM SIGKDD International Conference On Knowledge Discovery and Data Mining (KDD)Active Exploration for Learning Rankings from Clickthrough Data2007rankings learning clickthrough TREC http://www.bibsonomy.org/bibtex/22585b7423b67a81be5705640a3149538/beatebeate2007-10-17T14:26:23+02:00clickthrough svm ranking query-chains learning <span style="color:#555555;">F. <a href="http://www.bibsonomy.org/author/Radlinski">Radlinski</a> und T. <a href="http://www.bibsonomy.org/author/Joachims">Joachims</a> </span><em>ACM SIGKDD International Conference On Knowledge Discovery and Data Mining (KDD), </em><em>Seite239--248. </em>(<em>2005</em>)Wed Oct 17 14:26:23 CEST 2007ACM SIGKDD International Conference On Knowledge Discovery and Data Mining (KDD)239--248Query Chains: Learning to Rank from Implicit Feedback2005clickthrough svm ranking query-chains learning