667 search results - page 123 / 134 » Private Mining of Association Rules |
DAWAK
1999
Springer
14 years 27 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...
SDM
2003
SIAM
13 years 10 months ago
2003
SIAM
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
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...
FUIN
2000
13 years 8 months ago
2000
Knowledge scouts are software agents that autonomously search for and synthesize user-oriented knowledge (target knowledge) in large local or distributed databases. A knowledge ge...
FC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Consider an “information market” where private and potentially sensitive data are collected, treated as commodity and processed into aggregated information with comme...