Sciweavers

46 search results - page 4 / 10
» Applying learning algorithms to preference elicitation
Sort
View
CIKM
2011
Springer
12 years 5 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
AND
2009
13 years 3 months ago
Discovering voter preferences in blogs using mixtures of topic models
In this paper we propose a new approach to capture the inclination towards a certain election candidate from the contents of blogs and to explain why that inclination may be so. T...
Pradipto Das, Rohini K. Srihari, Smruthi Mukund
ICML
1997
IEEE
14 years 6 months ago
A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization
The Rocchio relevance feedback algorithm is one of the most popular and widely applied learning methods from information retrieval. Here, a probabilistic analysis of this algorith...
Thorsten Joachims
IJCNN
2008
IEEE
13 years 11 months ago
Building meta-learning algorithms basing on search controlled by machine complexity
Abstract— Meta-learning helps us find solutions to computational intelligence (CI) challenges in automated way. Metalearning algorithm presented in this paper is universal and m...
Norbert Jankowski, Krzysztof Grabczewski
ICML
2004
IEEE
14 years 6 months ago
Unifying collaborative and content-based filtering
Collaborative and content-based filtering are two paradigms that have been applied in the context of recommender systems and user preference prediction. This paper proposes a nove...
Justin Basilico, Thomas Hofmann