Multi-core parallel algorithms for hiding high-utility sequential patterns

doi:10.1016/j.knosys.2021.107793

Return

Multi-core parallel algorithms for hiding high-utility sequential patterns

2022-02-01

PRE

Bac Le *

Duy-Tai Dinh

Hamido Fujita

DOI：10.1016/j.knosys.2021.107793

Original

Original request for help

Save

Abstract

En 中文

High-utility sequential pattern mining (HUSPM) can be applied in many applications such as retail, market basket analysis, click-stream analysis, healthcare data analysis, and bioinformatics. HUSPM algorithms discover useful information from data. However, looking at the dark side, the sensitive patterns can also be disclosed by the competitors, who use a HUSPM algorithm on the leaked data. Therefore, high-utility sequential pattern hiding (HUSPH) is used to protect the privacy information from HUSPM algorithms. This paper proposes three algorithms named High Utility Sequential Pattern Hiding Using Pure Array Structure (USHPA), High Utility Sequential Pattern Hiding Using Parallel Strategy (USHP), and High Utility Sequential Pattern Hiding Using Random Distribution Strategy (USHR) for hiding high-utility sequential patterns on quantitative sequence datasets. These algorithms use a proposed data structure named Pattern Utility Set for Hiding (PUSH) to speed up the hiding process. We also introduce a metric called Privacy Factor to evaluate the quality of hiding results. The comparative experiments were conducted on real datasets to evaluate the performance of the proposed algorithms in terms of runtime, memory consumption, scalability, missing cost, and privacy factor. Results show that the proposed algorithms can efficiently sanitize the input datasets, and they outperform the compared algorithms for all metrics. (C)& nbsp;2021 Elsevier B.V. All rights reserved.

Keywords:

High-utility sequential pattern mining

High-utility sequential pattern hiding

Parallel hiding

Privacy preserving utility mining