arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.09584cs.DB
收藏

超越频率:具有不同项目特定最小效用的效用挖掘

Beyond Frequency: Utility Mining with Varied Item-Specific Minimum Utility

Wensheng Gan, Jerry Chun-Wei Lin, Philippe Fournier-Viger, Han-Chieh Chao, Philip S Yu

摘要:

面向效用的挖掘是效用理论与数据采掘相结合的产物,是理解经济消费者行为的有效工具。传统的挖掘高效用模式(High-utilizationPatterns,HUP)的算法采用单一/统一的最小高效用阈值(minutil)来获取HUP集合,但在现实生活中,某些特定的产品可能带来较低的效用,但它们的利润可能提供一些重要的信息。然而,如果细节设置为高,则丢失具有低细节的图案;如果细节设置为低,则图案的数量变得难以管理。本文提出了一种高效的单阶段面向效用的模式挖掘算法HIMU,用于挖掘具有不同项目特定最小效用的HUP。在HIMU中引入了一种新的树结构--多项效用集枚举树(MIU-tree)、全局排序和条件下闭包性质。此外,我们扩展了紧凑的实用程序列表结构,以保持必要的信息,因此,这种一阶段HIMU模型大大降低了计算成本和内存需求。此外,两个修剪策略,然后扩展,以提高性能。我们在几个合成和真实世界的数据集上进行了广泛的实验;结果表明,所设计的单阶段HIMU算法可以解决“稀有项问题”,并且在运行时间,内存使用和可扩展性方面具有比最先进的算法更好的性能。此外,增强的算法优于非优化的HIMU方法。

英文摘要:

Utility-oriented mining which integrates utility theory and data mining is a useful tool for understanding economic consumer behavior. Traditional algorithms for mining high-utility patterns (HUPs) applies a single/uniform minimum high-utility threshold (minutil) to obtain the set of HUPs, but in some real-life circumstances, some specific products may bring lower utilities compared with others, but their profit may offer some vital information. However, if minutil is set high, the patterns with low minutil are missed; if minutil is set low, the number of patterns becomes unmanageable. In this paper, an efficient one-phase utility-oriented pattern mining algorithm, called HIMU, is proposed for mining HUPs with varied item-specific minimum utility. A novel tree structure called a multiple item utility set-enumeration tree (MIU-tree), the global sorted and the conditional downward closure properties are introduced in HIMU. In addition, we extended the compact utility-list structure to keep the necessary information, and thus this one-phase HIMU model greatly reduces the computational costs and memory requirements. Moreover, two pruning strategies are then extended to enhance the performance. We conducted extensive experiments in several synthetic and real-world datasets; the results indicates that the designed one-phase HIMU algorithm can address the "rare item problem" and has better performance than the state-of-the-art algorithms in terms of runtime, memory usage, and scalability. Furthermore, the enhanced algorithms outperform the non-optimized HIMU approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑