.png){kind=icon}
返回
Towards efficiently mining closed high utility itemsets from incremental databases
.png){kind=icon}
OA
AI
DOI：10.1016/j.knosys.2018.11.019.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The set of closed high-utility itemsets (CHUls) concisely represents the exact utility of all itemsets. Yet, it can be several orders of magnitude smaller than the set of all high-utility itemsets. Existing CHUI mining algorithms assume that databases are static, making them very expensive in the case of incremental data, since the whole dataset has to be processed for each batch of new transactions. To address this challenge, this paper presents the first approach, called IncCHUI, that mines CHUls efficiently from incremental databases. In order to achieve this, we propose an incremental utility-list structure, which is built and updated with only one database scan. Further, we apply effective pruning strategies to fast construct incremental utility-lists and eliminate candidates that are not updated. Finally, we suggest an efficient hash-based approach to update or insert new closed sets that are found. Our extensive experimental evaluation on both real-life and synthetic databases shows the efficiency, as well as the feasibility of our approach. It significantly outperforms previously proposed methods that are mainly run in batch mode in terms of speed, and it is scalable with respect to the number of transactions. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
High-utility itemset mining
Closed itemset mining
Incremental mining
Incremental utility list
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
暂无机构信息
引用论文
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases用于增量数据库中高效用模式挖掘的高效树结构
PREAI
分享收藏分享收藏Incremental high utility pattern mining with static and dynamic databases基于静态和动态数据库的增量式高效用模式挖掘.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏
查看更多内容