.png){kind=icon}
返回
HMiner: Efficiently mining high utility itemsets
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2017.08.028.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
High utility itemset mining problem uses the notion of utilities to discover interesting and actionable patterns. Several data structures and heuristic methods have been proposed in the literature to efficiently mine high utility itemsets. This paper advances the state-of-the-art and presents HMiner, a high utility itemset mining method. HMiner utilizes a few novel ideas and presents a compact utility list and virtual hyperlink data structure for storing itemset information, It also makes use of several pruning strategies for efficiently mining high utility itemsets. The proposed ideas were evaluated on a set of benchmark sparse and dense datasets. The execution time improvements ranged from a modest thirty percent to three orders of magnitude across several benchmark datasets. The memory consumption requirements also showed up to an order of magnitude improvement over the state-of-the-art methods. In general, HMiner was found to work well in the dense regions of both sparse and dense benchmark datasets. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
High utility mining
Frequent itemset mining
Data mining
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
HUC-Prune: an efficient candidate pruning technique to mine high utility patterns.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases用于增量数据库中高效用模式挖掘的高效树结构
PREAI
分享收藏An efficient algorithm for mining high utility itemsets with negative item values in large databases
PREAI
分享收藏
查看更多内容