Όλο το DSpace

Πλοήγηση ανά Θέμα "Frequent Itemsets"

Αποτελέσματα 1-2 από 2

    • A hybrid approach to frequent itemset hiding 

      Gkoulalas-Divanis, A.; Verykios, V. S. (2007)
      In this paper, we propose a novel, exact border-based approach that provides an optimal solution for the hiding of sensitive frequent itemsets by (i) minimally extending the original database by a synthetically generated ...

    • A max-min approach for hiding frequent itemsets 

      Moustakides, G. V.; Verykios, V. S. (2006)
      In this paper we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) relies on the maxmin criterion which is a method ...