296 search results - page 20 / 60 » Privacy-preserving algorithms for distributed mining of freq... |
KDD
2009
ACM
14 years 3 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
CIKM
2006
Springer
14 years 22 days ago
2006
Springer
This poster paper summarizes our solution for mining max frequent generalized itemsets (g-itemsets), a compact representation for frequent patterns in the generalized environment....
DIS
2007
Springer
14 years 28 days ago
2007
Springer
DMIN
2006
13 years 10 months ago
2006
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
In this paper we propose a new and elegant approach toward the generalization of frequent itemset mining to the multirelational case. We define relational itemsets that contain i...