论文标题

迈向关联的顺序规则

Towards Correlated Sequential Rules

论文作者

Chen, Lili, Gan, Wensheng, Chen, Chien-Ming

论文摘要

高纯度顺序模式挖掘(HUSPM)的目标是有效发现大量序列中的有利可图或有用的顺序模式。但是,仅仅意识到符合公用事业资格的模式不足以进行预测。为了补偿这种缺陷,高ut效顺序规则挖掘(HUSRM)旨在探索基于前提顺序模式的出现,预测结果顺序模式的置信度或概率。它有许多应用程序,例如产品推荐和天气预测。但是,现有的算法(称为HUSRM)仅限于提取所有合格的规则,同时忽略了生成的顺序规则之间的相关性。为了解决这个问题,我们提出了一种新型算法,称为相关的高实次顺序规则矿工(COUSR),以将相关性概念整合到HUSRM中。所提出的算法不仅要求每个规则都相关,还要求将高度序列顺序规则的模式相关。该算法采用实用列表结构,以避免多个数据库扫描。此外,还使用了几种修剪策略来提高算法的效率和性能。基于几个现实世界数据集,随后的实验表明,COUSR在操作时间和内存消耗方面具有有效且有效。

The goal of high-utility sequential pattern mining (HUSPM) is to efficiently discover profitable or useful sequential patterns in a large number of sequences. However, simply being aware of utility-eligible patterns is insufficient for making predictions. To compensate for this deficiency, high-utility sequential rule mining (HUSRM) is designed to explore the confidence or probability of predicting the occurrence of consequence sequential patterns based on the appearance of premise sequential patterns. It has numerous applications, such as product recommendation and weather prediction. However, the existing algorithm, known as HUSRM, is limited to extracting all eligible rules while neglecting the correlation between the generated sequential rules. To address this issue, we propose a novel algorithm called correlated high-utility sequential rule miner (CoUSR) to integrate the concept of correlation into HUSRM. The proposed algorithm requires not only that each rule be correlated but also that the patterns in the antecedent and consequent of the high-utility sequential rule be correlated. The algorithm adopts a utility-list structure to avoid multiple database scans. Additionally, several pruning strategies are used to improve the algorithm's efficiency and performance. Based on several real-world datasets, subsequent experiments demonstrated that CoUSR is effective and efficient in terms of operation time and memory consumption.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源