• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

高效挖掘非冗余高效用关联规则的算法。

Efficient Algorithm for Mining Non-Redundant High-Utility Association Rules.

机构信息

Institute of Research and Development, Duy Tan University, Da Nang 550000, Vietnam.

School of Computer Science and Engineering, International University-VNU-HCMC, Ho Chi Minh City 700000, Vietnam.

出版信息

Sensors (Basel). 2020 Feb 17;20(4):1078. doi: 10.3390/s20041078.

DOI:10.3390/s20041078
PMID:32079200
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC7070778/
Abstract

In business, managers may use the association information among products to define promotion and competitive strategies. The mining of high-utility association rules (HARs) from high-utility itemsets enables users to select their own weights for rules, based either on the utility or confidence values. This approach also provides more information, which can help managers to make better decisions. Some efficient methods for mining HARs have been developed in recent years. However, in some decision-support systems, users only need to mine a smallest set of HARs for efficient use. Therefore, this paper proposes a method for the efficient mining of non-redundant high-utility association rules (NR-HARs). We first build a semi-lattice of mined high-utility itemsets, and then identify closed and generator itemsets within this. Following this, an efficient algorithm is developed for generating rules from the built lattice. This new approach was verified on different types of datasets to demonstrate that it has a faster runtime and does not require more memory than existing methods. The proposed algorithm can be integrated with a variety of applications and would combine well with external systems, such as the Internet of Things (IoT) and distributed computer systems. Many companies have been applying IoT and such computing systems into their business activities, monitoring data or decision-making. The data can be sent into the system continuously through the IoT or any other information system. Selecting an appropriate and fast approach helps management to visualize customer needs as well as make more timely decisions on business strategy.

摘要

在商业中,经理们可能会利用产品之间的关联信息来定义促销和竞争策略。从高效用项目集中挖掘高效用关联规则(HARs),使用户可以根据效用或置信度值为规则选择自己的权重。这种方法还提供了更多的信息,可以帮助管理者做出更好的决策。近年来,已经开发出了一些挖掘 HARs 的有效方法。然而,在某些决策支持系统中,用户只需要挖掘一组最小的 HARs 以实现高效利用。因此,本文提出了一种高效挖掘非冗余高效用关联规则(NR-HARs)的方法。我们首先构建了一个挖掘出的高效用项目集的半格,然后在这个半格中识别封闭和生成项目集。在此基础上,开发了一种从构建的格中生成规则的有效算法。该新方法在不同类型的数据集上进行了验证,结果表明其运行时间更快,所需内存比现有方法更少。所提出的算法可以与各种应用程序集成,并与外部系统(如物联网(IoT)和分布式计算机系统)很好地结合。许多公司已经将物联网和此类计算系统应用于其业务活动中,以监控数据或做出决策。数据可以通过物联网或任何其他信息系统连续发送到系统中。选择一个合适且快速的方法有助于管理层了解客户需求,并对业务战略做出更及时的决策。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/96e78ab7d3a5/sensors-20-01078-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/03892440e8a0/sensors-20-01078-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/7edbd6b6f6e5/sensors-20-01078-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/c3e064b19732/sensors-20-01078-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/21fbdf0a9718/sensors-20-01078-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/3a5dc4d77468/sensors-20-01078-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/37b025796278/sensors-20-01078-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/c2e8256fc280/sensors-20-01078-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/27bf2d6f8a00/sensors-20-01078-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/7814cbcf3e3f/sensors-20-01078-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/0eb98ea1f8f9/sensors-20-01078-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/96e78ab7d3a5/sensors-20-01078-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/03892440e8a0/sensors-20-01078-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/7edbd6b6f6e5/sensors-20-01078-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/c3e064b19732/sensors-20-01078-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/21fbdf0a9718/sensors-20-01078-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/3a5dc4d77468/sensors-20-01078-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/37b025796278/sensors-20-01078-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/c2e8256fc280/sensors-20-01078-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/27bf2d6f8a00/sensors-20-01078-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/7814cbcf3e3f/sensors-20-01078-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/0eb98ea1f8f9/sensors-20-01078-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b933/7070778/96e78ab7d3a5/sensors-20-01078-g011.jpg

相似文献

1
Efficient Algorithm for Mining Non-Redundant High-Utility Association Rules.高效挖掘非冗余高效用关联规则的算法。
Sensors (Basel). 2020 Feb 17;20(4):1078. doi: 10.3390/s20041078.
2
Mining Association rules for Low-Frequency itemsets.挖掘低频项集的关联规则。
PLoS One. 2018 Jul 23;13(7):e0198066. doi: 10.1371/journal.pone.0198066. eCollection 2018.
3
Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism.具有多个最小支持度的关联规则挖掘:一种新的挖掘算法和支持度调整机制。
Decis Support Syst. 2006 Oct;42(1):1-24. doi: 10.1016/j.dss.2004.09.007. Epub 2004 Nov 30.
4
The Mining Algorithm of Maximum Frequent Itemsets Based on Frequent Pattern Tree.基于频繁模式树的最大频繁项集挖掘算法。
Comput Intell Neurosci. 2022 May 18;2022:7022168. doi: 10.1155/2022/7022168. eCollection 2022.
5
Efficient Top-K Identical Frequent Itemsets Mining without Support Threshold Parameter from Transactional Datasets Produced by IoT-Based Smart Shopping Carts.从基于物联网的智能购物车生成的事务性数据集高效挖掘无支持阈值参数的 Top-K 相同频繁项集。
Sensors (Basel). 2022 Oct 21;22(20):8063. doi: 10.3390/s22208063.
6
An incremental high-utility mining algorithm with transaction insertion.一种带有事务插入的增量式高实用性挖掘算法。
ScientificWorldJournal. 2015;2015:161564. doi: 10.1155/2015/161564. Epub 2015 Feb 25.
7
A novel association rule mining approach using TID intermediate itemset.一种使用事务标识(TID)中间项集的新型关联规则挖掘方法。
PLoS One. 2018 Jan 19;13(1):e0179703. doi: 10.1371/journal.pone.0179703. eCollection 2018.
8
An efficient pattern growth approach for mining fault tolerant frequent itemsets.一种用于挖掘容错频繁项集的高效模式增长方法。
Expert Syst Appl. 2020 Apr 1;143:113046. doi: 10.1016/j.eswa.2019.113046. Epub 2019 Oct 21.
9
Marginal frequent itemset mining for fault prevention of railway overhead contact system.用于铁路架空接触网系统故障预防的边际频繁项集挖掘
ISA Trans. 2022 Jul;126:276-287. doi: 10.1016/j.isatra.2021.07.018. Epub 2021 Jul 13.
10
Query-constraint-based mining of association rules for exploratory analysis of clinical datasets in the National Sleep Research Resource.基于查询约束的关联规则挖掘,用于国家睡眠研究资源中临床数据集的探索性分析。
BMC Med Inform Decis Mak. 2018 Jul 23;18(Suppl 2):58. doi: 10.1186/s12911-018-0633-7.

引用本文的文献

1
Diagnosis and Treatment Rules of Chronic Kidney Disease and Nursing Intervention Models of Related Mental Diseases Using Electronic Medical Records and Data Mining.基于电子病历和数据挖掘的慢性肾脏病诊断治疗规则及相关精神疾病护理干预模型
J Healthc Eng. 2021 Dec 10;2021:5187837. doi: 10.1155/2021/5187837. eCollection 2021.
2
Mobility Prediction Using a Weighted Markov Model Based on Mobile User Classification.基于移动用户分类的加权马尔可夫模型的移动性预测
Sensors (Basel). 2021 Mar 3;21(5):1740. doi: 10.3390/s21051740.
3
HUIL-TN & HUI-TN: Mining high utility itemsets based on pattern-growth.

本文引用的文献

1
HUOPM: High-Utility Occupancy Pattern Mining.HUOPM:高效用占用模式挖掘。
IEEE Trans Cybern. 2020 Mar;50(3):1195-1208. doi: 10.1109/TCYB.2019.2896267. Epub 2019 Feb 20.
2
Analyzing of Gender Behaviors from Paths Using Process Mining: A Shopping Mall Application.基于过程挖掘的路径分析:以购物中心为例。
Sensors (Basel). 2019 Jan 29;19(3):557. doi: 10.3390/s19030557.
3
An Efficient Incremental Mining Algorithm for Discovering Sequential Pattern in Wireless Sensor Network Environments.一种在无线传感器网络环境中发现序列模式的高效增量挖掘算法。
HUIL-TN 和 HUI-TN:基于模式增长的高实用项集挖掘。
PLoS One. 2021 Mar 12;16(3):e0248349. doi: 10.1371/journal.pone.0248349. eCollection 2021.
4
Security and Privacy Techniques in IoT Environment.物联网环境中的安全和隐私技术。
Sensors (Basel). 2020 Dec 22;21(1):1. doi: 10.3390/s21010001.
Sensors (Basel). 2018 Dec 21;19(1):29. doi: 10.3390/s19010029.
4
Detecting Incremental Frequent Subgraph Patterns in IoT Environments.检测物联网环境中的增量频繁子图模式。
Sensors (Basel). 2018 Nov 18;18(11):4020. doi: 10.3390/s18114020.
5
Mining Productive-Associated Periodic-Frequent Patterns in Body Sensor Data for Smart Home Care.从智能家居护理的身体传感器数据中挖掘生产相关的周期频繁模式。
Sensors (Basel). 2017 Apr 26;17(5):952. doi: 10.3390/s17050952.