Protecting privacy in incremental maintenance for distributed association rule mining

W. K. Wong; David W. Cheung; Edward Hung; Huan Liu

doi:10.1007/978-3-540-68125-0_34

Protecting privacy in incremental maintenance for distributed association rule mining

W. K. Wong, David W. Cheung, Edward Hung, Huan Liu

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

Abstract

Distributed association rule mining algorithms are used to discover important knowledge from databases. Privacy concerns can prevent parties from sharing the data. New algorithms are required to solve traditional mining problems without disclosing (original or derived) information of their own data to other parties. Research results have been developed on (i) incrementally maintaining the discovered association rules, and (ii) computing the distributed association rules while preserving privacy. However, no study has been conducted on the problem of the maintenance of the discovered rules with privacy protection when new sites join the old sites. We propose an algorithm SIMDAR for this problem. Some techniques we developed can even further reduce the cost in a normal association rule mining algorithm with privacy protection. Experimental results showed that SIMDAR can significantly reduce the workload at the old sites by up to 80%.

Original language	English (US)
Title of host publication	Advances in Knowledge Discovery and Data Mining - 12th Pacific-Asia Conference, PAKDD 2008, Proceedings
Pages	381-392
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-540-68125-0_34
State	Published - 2008
Event	12th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2008 - Osaka, Japan Duration: May 20 2008 → May 23 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5012 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	12th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2008
Country/Territory	Japan
City	Osaka
Period	5/20/08 → 5/23/08

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-68125-0_34

Cite this

Wong, W. K., Cheung, D. W., Hung, E., & Liu, H. (2008). Protecting privacy in incremental maintenance for distributed association rule mining. In Advances in Knowledge Discovery and Data Mining - 12th Pacific-Asia Conference, PAKDD 2008, Proceedings (pp. 381-392). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5012 LNAI). https://doi.org/10.1007/978-3-540-68125-0_34

Protecting privacy in incremental maintenance for distributed association rule mining. / Wong, W. K.; Cheung, David W.; Hung, Edward et al.
Advances in Knowledge Discovery and Data Mining - 12th Pacific-Asia Conference, PAKDD 2008, Proceedings. 2008. p. 381-392 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5012 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Wong, WK, Cheung, DW, Hung, E & Liu, H 2008, Protecting privacy in incremental maintenance for distributed association rule mining. in Advances in Knowledge Discovery and Data Mining - 12th Pacific-Asia Conference, PAKDD 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5012 LNAI, pp. 381-392, 12th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2008, Osaka, Japan, 5/20/08. https://doi.org/10.1007/978-3-540-68125-0_34

Wong WK, Cheung DW, Hung E, Liu H. Protecting privacy in incremental maintenance for distributed association rule mining. In Advances in Knowledge Discovery and Data Mining - 12th Pacific-Asia Conference, PAKDD 2008, Proceedings. 2008. p. 381-392. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-68125-0_34

Wong, W. K. ; Cheung, David W. ; Hung, Edward et al. / Protecting privacy in incremental maintenance for distributed association rule mining. Advances in Knowledge Discovery and Data Mining - 12th Pacific-Asia Conference, PAKDD 2008, Proceedings. 2008. pp. 381-392 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{cc490892707b43b299bb20e28ae57283,

title = "Protecting privacy in incremental maintenance for distributed association rule mining",

abstract = "Distributed association rule mining algorithms are used to discover important knowledge from databases. Privacy concerns can prevent parties from sharing the data. New algorithms are required to solve traditional mining problems without disclosing (original or derived) information of their own data to other parties. Research results have been developed on (i) incrementally maintaining the discovered association rules, and (ii) computing the distributed association rules while preserving privacy. However, no study has been conducted on the problem of the maintenance of the discovered rules with privacy protection when new sites join the old sites. We propose an algorithm SIMDAR for this problem. Some techniques we developed can even further reduce the cost in a normal association rule mining algorithm with privacy protection. Experimental results showed that SIMDAR can significantly reduce the workload at the old sites by up to 80%.",

author = "Wong, {W. K.} and Cheung, {David W.} and Edward Hung and Huan Liu",

year = "2008",

doi = "10.1007/978-3-540-68125-0_34",

language = "English (US)",

isbn = "3540681248",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "381--392",

booktitle = "Advances in Knowledge Discovery and Data Mining - 12th Pacific-Asia Conference, PAKDD 2008, Proceedings",

note = "12th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2008 ; Conference date: 20-05-2008 Through 23-05-2008",

}

TY - GEN

T1 - Protecting privacy in incremental maintenance for distributed association rule mining

AU - Wong, W. K.

AU - Cheung, David W.

AU - Hung, Edward

AU - Liu, Huan

PY - 2008

Y1 - 2008

N2 - Distributed association rule mining algorithms are used to discover important knowledge from databases. Privacy concerns can prevent parties from sharing the data. New algorithms are required to solve traditional mining problems without disclosing (original or derived) information of their own data to other parties. Research results have been developed on (i) incrementally maintaining the discovered association rules, and (ii) computing the distributed association rules while preserving privacy. However, no study has been conducted on the problem of the maintenance of the discovered rules with privacy protection when new sites join the old sites. We propose an algorithm SIMDAR for this problem. Some techniques we developed can even further reduce the cost in a normal association rule mining algorithm with privacy protection. Experimental results showed that SIMDAR can significantly reduce the workload at the old sites by up to 80%.

AB - Distributed association rule mining algorithms are used to discover important knowledge from databases. Privacy concerns can prevent parties from sharing the data. New algorithms are required to solve traditional mining problems without disclosing (original or derived) information of their own data to other parties. Research results have been developed on (i) incrementally maintaining the discovered association rules, and (ii) computing the distributed association rules while preserving privacy. However, no study has been conducted on the problem of the maintenance of the discovered rules with privacy protection when new sites join the old sites. We propose an algorithm SIMDAR for this problem. Some techniques we developed can even further reduce the cost in a normal association rule mining algorithm with privacy protection. Experimental results showed that SIMDAR can significantly reduce the workload at the old sites by up to 80%.

UR - http://www.scopus.com/inward/record.url?scp=44649113751&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44649113751&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-68125-0_34

DO - 10.1007/978-3-540-68125-0_34

M3 - Conference contribution

AN - SCOPUS:44649113751

SN - 3540681248

SN - 9783540681243

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 381

EP - 392

BT - Advances in Knowledge Discovery and Data Mining - 12th Pacific-Asia Conference, PAKDD 2008, Proceedings

T2 - 12th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2008

Y2 - 20 May 2008 through 23 May 2008

ER -

Protecting privacy in incremental maintenance for distributed association rule mining

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this