Sciweavers

354 search results - page 59 / 71
» Top-k learning to rank: labeling, ranking and evaluation
Sort
View
91
Voted
CIKM
2011
Springer
13 years 9 months ago
A probabilistic method for inferring preferences from clicks
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke
MLG
2007
Springer
15 years 3 months ago
Weighted Substructure Mining for Image Analysis
1 In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and...
Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku K...
SIGIR
2010
ACM
14 years 9 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano
58
Voted
KDD
2005
ACM
73views Data Mining» more  KDD 2005»
15 years 10 months ago
Using relational knowledge discovery to prevent securities fraud
We describe an application of relational knowledge discovery to a key regulatory mission of the National Association of Securities Dealers (NASD). NASD is the world's largest...
Özgür Simsek, David Jensen, Henry G. Gol...
WSDM
2010
ACM
242views Data Mining» more  WSDM 2010»
15 years 7 months ago
Improving Ad Relevance in Sponsored Search
We describe a machine learning approach for predicting sponsored search ad relevance. Our baseline model incorporates basic features of text overlap and we then extend the model t...
Dustin Hillard, Stefan Schroedl, Eren Manavoglu, H...