A distributed privacy-preserving association rules mining scheme using frequent-pattern tree

Chunhua Su, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

Association rules mining is a frequently used technique which finds interesting association and correlation relationships among large set of data items which occur frequently together. Nowadays, data collection is ubiquitous in social and business areas. Many companies and organizations want to do the collaborative association rules mining to get the joint benefits. However, the sensitive information leakage is a problem we have to solve and privacy-preserving techniques are strongly needed. In this paper, we focus on the privacy issue of the association rules mining and propose a secure frequent-pattern tree (FP-tree) based scheme to preserve private information while doing the collaborative association rules mining. We show that our scheme is secure and collusion-resistant for n parties, which means that even if n - 1 dishonest parties collude with a dishonest data miner in an attempt to learn the associations rules between honest respondents and their responses, they will be unable to success.

Original languageEnglish
Title of host publicationAdvanced Data Mining and Applications - 4th International Conference, ADMA 2008, Proceedings
Pages170-181
Number of pages12
DOIs
Publication statusPublished - Dec 1 2008
Event4th International Conference on Advanced Data Mining and Applications, ADMA 2008 - Chengdu, China
Duration: Oct 8 2008Oct 10 2008

Publication series

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

Other

Other4th International Conference on Advanced Data Mining and Applications, ADMA 2008
CountryChina
CityChengdu
Period10/8/0810/10/08

Fingerprint

Frequent Pattern
Association Rule Mining
Privacy Preserving
Association rules
Collusion
Private Information
Association Rules
Leakage
Large Set
Miners
Privacy
Industry

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Su, C., & Sakurai, K. (2008). A distributed privacy-preserving association rules mining scheme using frequent-pattern tree. In Advanced Data Mining and Applications - 4th International Conference, ADMA 2008, Proceedings (pp. 170-181). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5139 LNAI). https://doi.org/10.1007/978-3-540-88192-6-17

A distributed privacy-preserving association rules mining scheme using frequent-pattern tree. / Su, Chunhua; Sakurai, Kouichi.

Advanced Data Mining and Applications - 4th International Conference, ADMA 2008, Proceedings. 2008. p. 170-181 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5139 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Su, C & Sakurai, K 2008, A distributed privacy-preserving association rules mining scheme using frequent-pattern tree. in Advanced Data Mining and Applications - 4th International Conference, ADMA 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5139 LNAI, pp. 170-181, 4th International Conference on Advanced Data Mining and Applications, ADMA 2008, Chengdu, China, 10/8/08. https://doi.org/10.1007/978-3-540-88192-6-17
Su C, Sakurai K. A distributed privacy-preserving association rules mining scheme using frequent-pattern tree. In Advanced Data Mining and Applications - 4th International Conference, ADMA 2008, Proceedings. 2008. p. 170-181. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-88192-6-17
Su, Chunhua ; Sakurai, Kouichi. / A distributed privacy-preserving association rules mining scheme using frequent-pattern tree. Advanced Data Mining and Applications - 4th International Conference, ADMA 2008, Proceedings. 2008. pp. 170-181 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a78ba4dc4b15430994601dfbdf0d2af1,
title = "A distributed privacy-preserving association rules mining scheme using frequent-pattern tree",
abstract = "Association rules mining is a frequently used technique which finds interesting association and correlation relationships among large set of data items which occur frequently together. Nowadays, data collection is ubiquitous in social and business areas. Many companies and organizations want to do the collaborative association rules mining to get the joint benefits. However, the sensitive information leakage is a problem we have to solve and privacy-preserving techniques are strongly needed. In this paper, we focus on the privacy issue of the association rules mining and propose a secure frequent-pattern tree (FP-tree) based scheme to preserve private information while doing the collaborative association rules mining. We show that our scheme is secure and collusion-resistant for n parties, which means that even if n - 1 dishonest parties collude with a dishonest data miner in an attempt to learn the associations rules between honest respondents and their responses, they will be unable to success.",
author = "Chunhua Su and Kouichi Sakurai",
year = "2008",
month = "12",
day = "1",
doi = "10.1007/978-3-540-88192-6-17",
language = "English",
isbn = "3540881913",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "170--181",
booktitle = "Advanced Data Mining and Applications - 4th International Conference, ADMA 2008, Proceedings",

}

TY - GEN

T1 - A distributed privacy-preserving association rules mining scheme using frequent-pattern tree

AU - Su, Chunhua

AU - Sakurai, Kouichi

PY - 2008/12/1

Y1 - 2008/12/1

N2 - Association rules mining is a frequently used technique which finds interesting association and correlation relationships among large set of data items which occur frequently together. Nowadays, data collection is ubiquitous in social and business areas. Many companies and organizations want to do the collaborative association rules mining to get the joint benefits. However, the sensitive information leakage is a problem we have to solve and privacy-preserving techniques are strongly needed. In this paper, we focus on the privacy issue of the association rules mining and propose a secure frequent-pattern tree (FP-tree) based scheme to preserve private information while doing the collaborative association rules mining. We show that our scheme is secure and collusion-resistant for n parties, which means that even if n - 1 dishonest parties collude with a dishonest data miner in an attempt to learn the associations rules between honest respondents and their responses, they will be unable to success.

AB - Association rules mining is a frequently used technique which finds interesting association and correlation relationships among large set of data items which occur frequently together. Nowadays, data collection is ubiquitous in social and business areas. Many companies and organizations want to do the collaborative association rules mining to get the joint benefits. However, the sensitive information leakage is a problem we have to solve and privacy-preserving techniques are strongly needed. In this paper, we focus on the privacy issue of the association rules mining and propose a secure frequent-pattern tree (FP-tree) based scheme to preserve private information while doing the collaborative association rules mining. We show that our scheme is secure and collusion-resistant for n parties, which means that even if n - 1 dishonest parties collude with a dishonest data miner in an attempt to learn the associations rules between honest respondents and their responses, they will be unable to success.

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

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

U2 - 10.1007/978-3-540-88192-6-17

DO - 10.1007/978-3-540-88192-6-17

M3 - Conference contribution

AN - SCOPUS:68849114362

SN - 3540881913

SN - 9783540881919

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

SP - 170

EP - 181

BT - Advanced Data Mining and Applications - 4th International Conference, ADMA 2008, Proceedings

ER -