284 search results - page 22 / 57 » Mining Frequent Itemsets in Distributed and Dynamic Database... |
KDD
2006
ACM
15 years 10 months ago
2006
ACM
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
DAWAK
2006
Springer
15 years 1 months ago
2006
Springer
Many privacy preserving data mining algorithms attempt to selectively hide what database owners consider as sensitive. Specifically, in the association-rules domain, many of these ...
97
Voted
KDD
1997
ACM
15 years 1 months ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
CIB
2004
14 years 9 months ago
2004
In multi-database mining, there can be many local patterns (frequent itemsets or association rules) in each database. At the end of multi-database mining, it is necessary to analyz...
178
click to vote
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
The output of boolean association rule mining algorithms is often too large for manual examination. For dense datasets, it is often impractical to even generate all frequent items...