微型电脑应用2026，Vol.42Issue(4)：24-29,6.
基于上限修剪的利润集关联规则挖掘
Profit Association Rule Mining Based on Upper Bound Reduction
摘要
Abstract
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.关键词
频繁项目集/利润集关联规则/最大利润比/候选项目集Key words
frequent itemset/profit association rule/maximum profit ratio/candidate itemsets分类
信息技术与安全科学引用本文复制引用
杨振华,邓永宁..基于上限修剪的利润集关联规则挖掘[J].微型电脑应用,2026,42(4):24-29,6.基金项目
陕西省自然科学基金项目(2023-JC-YB-715) （2023-JC-YB-715）
