Sciweavers

16 search results - page 1 / 4
» PCPs and the Hardness of Generating Synthetic Data
Sort
View
ECCC
2010
78views more  ECCC 2010»
13 years 5 months ago
PCPs and the Hardness of Generating Synthetic Data
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
Jonathan Ullman, Salil P. Vadhan
VLDB
2005
ACM
81views Database» more  VLDB 2005»
13 years 10 months ago
Flexible Database Generators
Evaluation and applicability of many database techniques, ranging from access methods, histograms, and optimization strategies to data normalization and mining, crucially depend o...
Nicolas Bruno, Surajit Chaudhuri
PRL
2011
12 years 7 months ago
A Bayes-true data generator for evaluation of supervised and unsupervised learning methods
Benchmarking pattern recognition, machine learning and data mining methods commonly relies on real-world data sets. However, there are some disadvantages in using real-world data....
Janick V. Frasch, Aleksander Lodwich, Faisal Shafa...
ICDM
2002
IEEE
153views Data Mining» more  ICDM 2002»
13 years 9 months ago
Generating an informative cover for association rules
Mining association rules may generate a large numbers of rules making the results hard to analyze manually. Pasquier et al. have discussed the generation of GuiguesDuquenne–Luxe...
Laurentiu Cristofor, Dan A. Simovici
KDD
2000
ACM
118views Data Mining» more  KDD 2000»
13 years 8 months ago
Generating non-redundant association rules
The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected. We present a new framework for...
Mohammed Javeed Zaki