.png){kind=icon}
返回
An efficient algorithm for Hiding High Utility Sequential Patterns
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2018.01.005.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
High Utility Sequential Patterns (HUSP) are a type of patterns that can be found in data collected in many domains such as business, marketing and retail. Two critical topics related to HUSP are: HUSP mining (HUSPM) and HUSP Hiding (HUSPH). HUSPM algorithms are designed to discover all sequential patterns that have a utility greater than or equal to a minimum utility threshold in a sequence database. HUSPH algorithms, by contrast, conceal all HUSP so that competitors cannot find them in shared databases. This paper focuses on HUSPH. It proposes an algorithm named HUS-Hiding to efficiently hide all HUSP. An extensive experimental evaluation is conducted on six real-life datasets to evaluate the performance of the proposed algorithm. According to the experimental results, the designed algorithm is more effective than three state-of-the-art algorithms in terms of runtime, memory usage and hiding accuracy. (C) 2018 Elsevier Inc. All rights reserved.
Keyword:
Data mining
Privacy preserving data mining
High-utility sequential pattern mining
High-utility sequential pattern hiding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
查看更多机构
引用论文
.png){kind=icon}
A Simulation Method for Analyzing and Evaluating Rail System Performance Based on Speed Profile
PREAI
分享收藏Evaluation of desialylation during 2-amino benzamide labeling of asparagine-linked oligosaccharides
PREAI
分享收藏
没有更多内容