601 search results - page 102 / 121 » Maintaining Data Privacy in Association Rule Mining |
GFKL
2006
Springer
14 years 7 days ago
2006
Springer
Abstract. Solving conflicts between overlapping databases requires an understanding of the reasons that lead to the inconsistencies. Provided that conflicts do not occur randomly b...
DAWAK
1999
Springer
14 years 26 days ago
1999
Springer
One of the most challenging problems in data manipulation in the future is to be able to e ciently handle very large databases but also multiple induced properties or generalizatio...
SAC
2002
ACM
13 years 8 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
DKE
2006
13 years 8 months ago
2006
Recently, there is an increasing research efforts in XML data mining. These research efforts largely assumed that XML documents are static. However, in reality, the documents are ...
ICTAI
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...