Sciweavers

550 search results - page 50 / 110
» A general magnitude-preserving boosting algorithm for search...
Sort
View
RECSYS
2010
ACM
13 years 7 months ago
Group recommendations with rank aggregation and collaborative filtering
The majority of recommender systems are designed to make recommendations for individual users. However, in some circumstances the items to be selected are not intended for persona...
Linas Baltrunas, Tadas Makcinskas, Francesco Ricci
SIGIR
2011
ACM
12 years 10 months ago
The interactive PRP for diversifying document rankings
The assumptions underlying the Probability Ranking Principle (PRP) have led to a number of alternative approaches that cater or compensate for the PRP’s limitations. In this pos...
Guido Zuccon, Leif Azzopardi, C. J. van Rijsbergen
ECAI
2010
Springer
13 years 6 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
WWW
2007
ACM
14 years 8 months ago
A kernel based structure matching for web services search
This paper describes a kernel based Web Services (abbreviated as service) matching mechanism for service discovery and integration. The matching mechanism tries to exploit the lat...
Yu Jianjun, Guo Shengmin, Su Hao, Zhang Hui, Xu Ke
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
12 years 3 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...