Sciweavers

65 search results - page 8 / 13
» Mining association rules with non-uniform privacy concerns
Sort
View
CIKM
2006
Springer
14 years 21 days ago
An integer programming approach for frequent itemset hiding
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...
Aris Gkoulalas-Divanis, Vassilios S. Verykios
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
14 years 9 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
14 years 2 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
14 years 1 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
ISI
2005
Springer
14 years 2 months ago
Link Analysis Tools for Intelligence and Counterterrorism
Association rule mining is an important data analysis tool that can be applied with success to a variety of domains. However, most association rule mining algorithms seek to discov...
Antonio Badia, Mehmed M. Kantardzic