Sciweavers

145 search results - page 17 / 29
» Adversarial learning
Sort
View
SIGIR
2011
ACM
12 years 10 months ago
Learning to rank from a noisy crowd
We study how to best use crowdsourced relevance judgments learning to rank [1, 7]. We integrate two lines of prior work: unreliable crowd-based binary annotation for binary classi...
Abhimanu Kumar, Matthew Lease
SIGMOD
2004
ACM
170views Database» more  SIGMOD 2004»
14 years 7 months ago
A Formal Analysis of Information Disclosure in Data Exchange
We perform a theoretical study of the following queryview security problem: given a view V to be published, does V logically disclose information about a confidential query S? The...
Gerome Miklau, Dan Suciu
ICDE
2008
IEEE
498views Database» more  ICDE 2008»
15 years 7 months ago
Injector: Mining Background Knowledge for Data Anonymization
Existing work on privacy-preserving data publishing cannot satisfactorily prevent an adversary with background knowledge from learning important sensitive information. The main cha...
Tiancheng Li, Ninghui Li
CHES
2011
Springer
240views Cryptology» more  CHES 2011»
12 years 7 months ago
Lightweight and Secure PUF Key Storage Using Limits of Machine Learning
A lightweight and secure key storage scheme using silicon Physical Unclonable Functions (PUFs) is described. To derive stable PUF bits from chip manufacturing variations, a lightwe...
Meng-Day (Mandel) Yu, David M'Raïhi, Richard ...
FLAIRS
2009
13 years 5 months ago
Beating the Defense: Using Plan Recognition to Inform Learning Agents
In this paper, we investigate the hypothesis that plan recognition can significantly improve the performance of a casebased reinforcement learner in an adversarial action selectio...
Matthew Molineaux, David W. Aha, Gita Sukthankar