.png){kind=icon}
返回
Mining closed high utility patterns with negative utility in dynamic databases
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-022-03876-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
High utility itemsets mining algorithms with negative utility have more practical applications because they can handle datasets containing negative items. Existing algorithms that consider negative items assume that the database is static and contain a lot of redundant itemsets information in the result set. To solve these problems, a first algorithm for mining closed high utility itemsets containing negative items in dynamic databases, called CHUInd, is proposed. Dynamic list index structure designed in the algorithm to quickly access and update the information stored in the list based on the index values. Memory reuse strategy is applied to reduce memory usage and quickly update item information during batch insertion. Extensive experimental evaluations on real datasets show the efficiency as well as the feasibility of the algorithm, which exhibits excellent performance in terms of both runtime memory usage.
Keyword:
High utility pattern mining
Negative utility
Index
Utility list
Closed itemsets
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
分享收藏
Towards efficiently mining closed high utility itemsets from incremental databases从增量数据库中高效挖掘封闭的高效用项目集
OAAI
OAAI分享收藏Efficient algorithm for mining high average-utility itemsets in incremental transaction databases.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏Effective sanitization approaches to protect sensitive knowledge in high-utility itemset miningAPPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏
查看更多内容