.png){kind=icon}
返回
A BPSO-based method for high-utility itemset mining without minimum utility threshold
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2019.105164.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
High-utility itemset mining is used to obtain high utility itemsets by taking into account both the quantity as well as the utility of each item, which have not been considered in frequent itemset mining. Many algorithms compute high utility itemsets by setting a minimum utility threshold in advance. However, determining the minimum utility threshold is not easy. Too high or too low a threshold may result in incorrect high utility itemsets. In this paper, we propose a method based on binary particle swarm optimization to optimize the search for high utility itemsets without setting the minimum utility threshold beforehand. Instead, the application of the minimum utility threshold is performed as a post-processing step. Experiments on five datasets indicate that the proposed method is better than existing methods in finding high utility itemsets, and the time to obtain those itemsets is faster than that with setting the minimum utility threshold first. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
High-utility itemset mining
Binary particle swarm optimization
Minimum utility threshold
Computational intelligence
Data mining
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases用于增量数据库中高效用模式挖掘的高效树结构
PREAI
分享收藏Efficient algorithms for mining high-utility itemsets in uncertain databases不确定数据库中高效用项集的高效挖掘算法
PREAI
分享收藏
查看更多内容