Secure Mining of Association Rules in Distributed Datasets
The arrival of Information Age, with its rapid development of information technology, has provided a wide space for Data Analysis and Mining. Yet growth in this market could be held back by privacy concerns. This paper addresses the problem of secure association rule mining where transactions are di...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8873600/ |
id |
doaj-22093366a5f742b59c158fcbeaf9cb6d |
---|---|
record_format |
Article |
spelling |
doaj-22093366a5f742b59c158fcbeaf9cb6d2021-03-30T00:52:06ZengIEEEIEEE Access2169-35362019-01-01715532515533410.1109/ACCESS.2019.29480338873600Secure Mining of Association Rules in Distributed DatasetsQilong Han0Dan Lu1https://orcid.org/0000-0001-6410-8422Kejia Zhang2Hongtao Song3Haitao Zhang4College of Computer Science and Technology, Harbin Engineering University, Harbin, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin, ChinaCollege of Computer Science and Technology, Harbin Engineering University, Harbin, ChinaThe arrival of Information Age, with its rapid development of information technology, has provided a wide space for Data Analysis and Mining. Yet growth in this market could be held back by privacy concerns. This paper addresses the problem of secure association rule mining where transactions are distributed across sources. The existing solutions for distributed data (vertical partition and horizontal partition) have high complexity of encryption and incomplete definition of attributes of multiple parties. In this paper, we study how to maintain differential privacy in distributed databases for mining of association rules without revealing each party's raw transactions despite how strong background knowledge the attackers have. We use a intermediate server for data consolidation without assuming it is safe. Our methods offer enhanced privacy against various attacks model. In addition, it is simpler and is significantly more efficient in terms of communication rounds and computation overhead.https://ieeexplore.ieee.org/document/8873600/Data miningdistributed databasesassociation rule miningdifferential privacyprivacy preserving |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Qilong Han Dan Lu Kejia Zhang Hongtao Song Haitao Zhang |
spellingShingle |
Qilong Han Dan Lu Kejia Zhang Hongtao Song Haitao Zhang Secure Mining of Association Rules in Distributed Datasets IEEE Access Data mining distributed databases association rule mining differential privacy privacy preserving |
author_facet |
Qilong Han Dan Lu Kejia Zhang Hongtao Song Haitao Zhang |
author_sort |
Qilong Han |
title |
Secure Mining of Association Rules in Distributed Datasets |
title_short |
Secure Mining of Association Rules in Distributed Datasets |
title_full |
Secure Mining of Association Rules in Distributed Datasets |
title_fullStr |
Secure Mining of Association Rules in Distributed Datasets |
title_full_unstemmed |
Secure Mining of Association Rules in Distributed Datasets |
title_sort |
secure mining of association rules in distributed datasets |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2019-01-01 |
description |
The arrival of Information Age, with its rapid development of information technology, has provided a wide space for Data Analysis and Mining. Yet growth in this market could be held back by privacy concerns. This paper addresses the problem of secure association rule mining where transactions are distributed across sources. The existing solutions for distributed data (vertical partition and horizontal partition) have high complexity of encryption and incomplete definition of attributes of multiple parties. In this paper, we study how to maintain differential privacy in distributed databases for mining of association rules without revealing each party's raw transactions despite how strong background knowledge the attackers have. We use a intermediate server for data consolidation without assuming it is safe. Our methods offer enhanced privacy against various attacks model. In addition, it is simpler and is significantly more efficient in terms of communication rounds and computation overhead. |
topic |
Data mining distributed databases association rule mining differential privacy privacy preserving |
url |
https://ieeexplore.ieee.org/document/8873600/ |
work_keys_str_mv |
AT qilonghan secureminingofassociationrulesindistributeddatasets AT danlu secureminingofassociationrulesindistributeddatasets AT kejiazhang secureminingofassociationrulesindistributeddatasets AT hongtaosong secureminingofassociationrulesindistributeddatasets AT haitaozhang secureminingofassociationrulesindistributeddatasets |
_version_ |
1724187667758841856 |