165 search results - page 8 / 33 » Discovering Frequent Closed Itemsets for Association Rules |
KDD
2002
ACM
14 years 8 months ago
2002
ACM
Privacy considerations often constrain data mining projects. This paper addresses the problem of association rule mining where transactions are distributed across sources. Each si...
DKE
2007
13 years 7 months ago
2007
A well-known problem that limits the practical usage of association rule mining algorithms is the extremely large number of rules generated. Such a large number of rules makes the...
ICCS
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
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 ...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...