Reduction Relaxation in Privacy Preserving Association Rules Mining

Piotr Andruszkiewicz

Abstract

In Privacy Preserving Association Rules Mining, when frequent sets are discovered, the relaxation can be used to decrease the false negative error component and, in consequence, to decrease the number of true frequent itemsets that are missed. We introduce the new type of relaxation - the reduction relaxation that enable a miner to decrease and control the false negative error for different lengths of frequent itemsets.
Author Piotr Andruszkiewicz (FEIT / IN)
Piotr Andruszkiewicz,,
- The Institute of Computer Science
Pages1-8
Book Morzy Tadeusz, Härder Theo, Wrembel Robert (eds.): Advances in Databases and Information Systems, Advances in Intelligent Systems and Computing, vol. 186, 2013, Heidelberg New York Dordrecht London, Springer, ISBN 978-3-642-32740-7, 310 p., DOI:10.1007/978-3-642-32741-4
DOIDOI:10.1007/978-3-642-32741-4_1
ProjectDevelopment of new methods and algorithms in the following areas: computer graphics, artificial intelligence, and information systems; and distributed systems. Project leader: Rybiński Henryk, , Phone: +48 22 234 7731, start date 26-07-2011, planned end date 31-12-2011, end date 30-11-2012, II/2011/DS/1, Completed
WEiTI Działalność statutowa
Languageen angielski
File
rrelax.pdf 244.55 KB
Score (nominal)5
ScoreMinisterial score = 5.0, 10-02-2020, MonographChapterAuthor
Publication indicators WoS Citations = 8; GS Citations = 1.0
Citation count*1 (2015-05-14)
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back
Confirmation
Are you sure?