9209 search results - page 208 / 1842 » Data Space Randomization |
143
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
We present a framework for mining association rules from transactions consisting of categorical items where the data has been randomized to preserve privacy of individual transact...
155
Voted
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
144
Voted
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
173
Voted
JMLR
2012
13 years 8 months ago
2012
In this paper we address the problem of pool based active learning, and provide an algorithm, called UPAL, that works by minimizing the unbiased estimator of the risk of a hypothe...
197
Voted
DASFAA
2010
IEEE
15 years 4 months ago
2010
IEEE
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream a...