Sciweavers

513 search results - page 92 / 103
» Learning Models for Ranking Aggregates
Sort
View
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
SIGMETRICS
2008
ACM
109views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Automatic request categorization in internet services
Modeling system performance and workload characteristics has become essential for efficiently provisioning Internet services and for accurately predicting future resource requirem...
Abhishek Sharma, Ranjita Bhagwan, Monojit Choudhur...
PODS
2003
ACM
156views Database» more  PODS 2003»
15 years 9 months ago
Limiting privacy breaches in privacy preserving data mining
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...
Alexandre V. Evfimievski, Johannes Gehrke, Ramakri...
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
14 years 11 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
ICDE
2009
IEEE
131views Database» more  ICDE 2009»
15 years 11 months ago
Exploring a Few Good Tuples from Text Databases
Information extraction from text databases is a useful paradigm to populate relational tables and unlock the considerable value hidden in plain-text documents. However, information...
Alpa Jain, Divesh Srivastava