Sciweavers

2135 search results - page 229 / 427
» Database Paper - The IRI Marketing Data Set
Sort
View
ICDE
2007
IEEE
1577views Database» more  ICDE 2007»
17 years 6 months ago
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
The k-anonymity privacy requirement for publishing microdata requires that each equivalence class (i.e., a set of records that are indistinguishable from each other with respect to...
Ninghui Li, Tiancheng Li, Suresh Venkatasubramania...
IDEAS
2006
IEEE
109views Database» more  IDEAS 2006»
16 years 18 days ago
Multi-dimensional Histograms with Tight Bounds for the Error
Histograms are being used as non-parametric selectivity estimators for one-dimensional data. For highdimensional data it is common to either compute onedimensional histograms for ...
Linas Baltrunas, Arturas Mazeika, Michael H. B&oum...
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 7 months ago
Interestingness of frequent itemsets using Bayesian networks as background knowledge
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
Szymon Jaroszewicz, Dan A. Simovici
FQAS
2009
Springer
202views Database» more  FQAS 2009»
16 years 1 months ago
Controlled Aggregate Tree Shaped Questions over Ontologies
Abstract. Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query langua...
Camilo Thorne, Diego Calvanese
ICDM
2005
IEEE
157views Data Mining» more  ICDM 2005»
16 years 5 days ago
Blocking Anonymity Threats Raised by Frequent Itemset Mining
In this paper we study when the disclosure of data mining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty o...
Maurizio Atzori, Francesco Bonchi, Fosca Giannotti...