首页|期刊导航|微型电脑应用|基于上限修剪的利润集关联规则挖掘

基于上限修剪的利润集关联规则挖掘OA

Profit Association Rule Mining Based on Upper Bound Reduction

中文摘要英文摘要

频繁项目集挖掘是研究用户行为的一种重要方法,在购物篮分析中找出高频繁度的物品组合可以提高物品的销量,然而高频繁度物品的组合未必能带来最大的利润.传统的频繁项目集挖掘算法忽略了用户购买物品的数量以及不同物品利润的差异.为解决利润最大化问题,本文提出一种利润集关联规则挖掘算法,通过挖掘利润集关联规则,企业可以清楚地了解哪些物品的组合可以真正实现利润最大化.为了提高挖掘的效率,提出最大利润比的概念,用其进行候选项目集的减枝操作,提高挖掘的效率.测试结果表明,利润集关联规则挖掘算法可以找到利润最大化的项目规则且具有很高的挖掘效率.

Frequent itemset mining is an important method for studying user behavior.Identifying highly frequent item combina-tions in shopping basket analysis can increase item sales.However,combinations of highly frequent items do not necessarily lead to the maximum profits.Traditional frequent itemset mining algorithms overlook the quantity of items purchased by users and the differences in profits among different items.To address the profit maximization issue,this paper proposes a profit asso-ciated rule algorithm.By mining profit association rules,businesses can clearly understand which combinations of items can truly maximize profits.To enhance the efficiency of mining,the paper introduces the concept of maximum profit ratio for prun-ing candidate itemsets,which can improve the mining efficiency.The test results demonstrate that the profit association rule mining algorithm can find a set of rules that maximize profits while maintaining high mining efficiency.

杨振华;邓永宁

西安文理学院,信息工程学院,陕西,西安 710065西安交通大学第一附属医院,陕西,西安 710061

信息技术与安全科学

频繁项目集利润集关联规则最大利润比候选项目集

frequent itemsetprofit association rulemaximum profit ratiocandidate itemsets

《微型电脑应用》 2026 (4)

24-29,6

陕西省自然科学基金项目(2023-JC-YB-715)

评论