158 search results - page 6 / 32 » Discovering frequent patterns in sensitive data |
KDD
2008
ACM
14 years 7 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
ADMA
2005
Springer
13 years 9 months ago
2005
Springer
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
ICDE
2005
IEEE
14 years 8 months ago
2005
IEEE
Benchmarking technical solutions is as important as the solutions themselves. Yet many fields still lack any type of rigorous evaluation. Performance benchmarking has always been ...
ICDM
2002
IEEE
14 years 13 days ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
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...