Abstract
Privacy preserving association rule mining can extract important rules from distributed data with limited privacy breaches. Protecting privacy in incremental maintenance for distributed association rule mining is necessary since data are frequently updated. In privacy preserving data mining, scanning all the distributed data is very costly. This paper proposes a new incremental protocol for privacy preserving association rule mining using negative border concept. The protocol scans old databases at most once, and therefore reducing the I/O time. We also conduct experiments to show the efficiency of our protocol over existing ones.
Original language | English |
---|---|
Title of host publication | Intelligence and Security Informatics - 11th Pacific Asia Workshop, PAISI 2016, Proceedings |
Editors | Michael Chau, G. Alan Wang, Hsinchun Chen |
Publisher | Springer Verlag |
Pages | 87-100 |
Number of pages | 14 |
ISBN (Print) | 9783319318622 |
DOIs | |
Publication status | Published - 2016 |
Externally published | Yes |
Event | 11th Pacific Asia Workshop on Intelligence and Security Informatics, PAISI 2016 - Auckland, New Zealand Duration: Apr 19 2016 → Apr 19 2016 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 9650 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 11th Pacific Asia Workshop on Intelligence and Security Informatics, PAISI 2016 |
---|---|
Country/Territory | New Zealand |
City | Auckland |
Period | 4/19/16 → 4/19/16 |
Bibliographical note
Publisher Copyright:© Springer International Publishing Switzerland 2016.
ASJC Scopus Subject Areas
- Theoretical Computer Science
- General Computer Science
Keywords
- Association rule mining
- Incremental
- Negative border
- Privacy preserving
- Secure protocol