296 search results - page 12 / 60 » Privacy-preserving algorithms for distributed mining of freq... |
CIKM
2006
Springer
14 years 21 days ago
2006
Springer
Distributed privacy preserving data mining tools are critical for mining multiple databases with a minimum information disclosure. We present a framework including a general model...
PAKDD
2004
ACM
14 years 2 months ago
2004
ACM
Abstract. In the context of mining frequent itemsets, numerous strategies have been proposed to push several types of constraints within the most well known algorithms. In this pap...
ICTAI
2003
IEEE
14 years 2 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...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
AUSDM
2007
Springer
14 years 3 months ago
2007
Springer
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...