Privacy-preserving frequent itemsets mining via secure collaborative framework
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wong, Kok Seng | - |
dc.contributor.author | Kim, Myung Ho | - |
dc.date.available | 2018-05-10T05:25:42Z | - |
dc.date.created | 2018-04-17 | - |
dc.date.issued | 2012-03 | - |
dc.identifier.issn | 1939-0114 | - |
dc.identifier.uri | http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/12479 | - |
dc.description.abstract | Knowledge-discovering or pattern-discovering process, such as data mining, is an important technique to discover hidden but useful information from a large volume of data. Under distributed environment, data mining task has become a challenging task due to data protection and privacy concerns. The secure multi-party computation (SMC) approach has been widely used to solve privacy-preserving data mining problems. However, generic SMC solutions are not practical from an efficiency point of view, especially when the number of parties and the size of the data are large. In view of these problems, we utilize a secure collaborative framework to facilitate the computation protocol for SMC. In this paper, we particularly consider the problem of privacy-preserving frequent itemsets mining under distributed environment. Our solution reduces the risk for central data mining and improves the efficiency of the current generic SMC solutions. Furthermore, our solution is more reliable and flexible regardless of the number of parties involved. Copyright (C) 2011 John Wiley & Sons, Ltd. | - |
dc.publisher | WILEY-BLACKWELL | - |
dc.relation.isPartOf | SECURITY AND COMMUNICATION NETWORKS | - |
dc.subject | ASSOCIATION RULES | - |
dc.subject | PATTERN TREE | - |
dc.title | Privacy-preserving frequent itemsets mining via secure collaborative framework | - |
dc.type | Article | - |
dc.identifier.doi | 10.1002/sec.335 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | SECURITY AND COMMUNICATION NETWORKS, v.5, no.3, pp.263 - 272 | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000300710800005 | - |
dc.identifier.scopusid | 2-s2.0-84863159517 | - |
dc.citation.endPage | 272 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 263 | - |
dc.citation.title | SECURITY AND COMMUNICATION NETWORKS | - |
dc.citation.volume | 5 | - |
dc.contributor.affiliatedAuthor | Wong, Kok Seng | - |
dc.contributor.affiliatedAuthor | Kim, Myung Ho | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | frequent itemsets mining | - |
dc.subject.keywordAuthor | distributed association rules mining | - |
dc.subject.keywordAuthor | multi-party computation | - |
dc.subject.keywordAuthor | privacy preserving | - |
dc.subject.keywordAuthor | collaborative framework | - |
dc.subject.keywordPlus | ASSOCIATION RULES | - |
dc.subject.keywordPlus | PATTERN TREE | - |
dc.description.journalRegisteredClass | scie | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733
COPYRIGHT ⓒ SOONGSIL UNIVERSITY, ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.