引导性探索顺序规则
Guided Exploration of Sequential Rules
AI总结:
本文提出了一种高效发现用户导向顺序规则的方法,通过设计上界和相似性度量,提升挖掘效率并减少冗余规则。
摘要:
在模式挖掘中,顺序规则提供了一个正式的框架来捕捉时间关系并推断项目之间的依赖性。然而,发现过程计算上是密集的。为了高效且灵活地获得挖掘结果,许多方法已被提出,这些方法依赖于特定的评估指标(即确保结果满足最低阈值要求)。然而,这些方法的一个关键问题是它们生成了许多与用户无关的顺序规则。这些规则不仅增加了额外的计算开销,还使下游分析复杂化。在本文中,我们研究如何高效地发现以用户为中心的顺序规则。原始数据库首先被处理以确定目标查询规则是否存在。为了修剪不值得的项目并避免不必要的扩展,我们设计了紧密且可推广的上界。我们引入了一种新的方法,利用所提出的技术和修剪策略高效地生成目标顺序规则。此外,我们为两种常见的评估指标:频率和效用,提出了相应的挖掘算法。我们还设计了两种规则相似性度量来帮助发现最相关的顺序规则。广泛的实验表明,我们的算法在运行时间和内存使用方面优于最先进的方法,同时在灵活的相似性设置下发现了一组简洁的顺序规则。针对顺序规则搜索可以处理具有个性化特征的序列数据并实现模式发现。所提出的解决方案解决了几个挑战,并可以应用于两种常见的挖掘任务。
英文摘要:
In pattern mining, sequential rules provide a formal framework to capture the temporal relationships and inferential dependencies between items. However, the discovery process is computationally intensive. To obtain mining results efficiently and flexibly, many methods have been proposed that rely on specific evaluation metrics (i.e., ensuring results meet minimum threshold requirements). A key issue with these methods, however, is that they generate many sequential rules that are irrelevant to users. Such rules not only incur additional computational overhead but also complicate downstream analysis. In this paper, we investigate how to efficiently discover user-centric sequential rules. The original database is first processed to determine whether a target query rule is present. To prune unpromising items and avoid unnecessary expansions, we design tight and generalizable upper bounds. We introduce a novel method for efficiently generating target sequential rules using the proposed techniques and pruning strategies. In addition, we propose the corresponding mining algorithms for two common evaluation metrics: frequency and utility. We also design two rule similarity metrics to help discover the most relevant sequential rules. Extensive experiments demonstrate that our algorithms outperform state-of-the-art approaches in terms of runtime and memory usage, while discovering a concise set of sequential rules under flexible similarity settings. Targeted sequential rule search can handle sequence data with personalized features and achieve pattern discovery. The proposed solution addresses several challenges and can be applied to two common mining tasks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。