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

从事务数据库中挖掘高效用项集的一阶段树算法

A one-phase tree-based algorithm for mining high-utility itemsets from a transaction database

Siddharth Dawar, Vikram Goyal, Debajyoti Bera

摘要:

高效用项集挖掘从事务数据库中发现效用不低于用户定义的固定阈值的项集。项集的效用被定义为其项的效用之和。提出了几种挖掘高效用项集的算法。然而,没有最先进的算法在密集和稀疏数据集上表现一致。在本文中,我们提出了一种新的数据结构称为Utility-Tree,和基于树的算法称为UT-Miner,挖掘高效用项目集在一个阶段,而不产生任何候选人,并使用一个轻量级的建设方法,以减少成本创建投影数据库在搜索空间探索。该算法将事务信息与效用树的每一个节点存储在一起,并在递归调用过程中有效地计算事务信息。在几个真实的密集和稀疏数据集上的实验结果表明,UT-Miner是跨不同数据集的最佳高效算法之一。

英文摘要:

High-utility itemset mining finds itemsets from a transaction database with utility no less than a fixed user-defined threshold. The utility of an itemset is defined as the sum of the utilities of its item. Several algorithms were proposed to mine high-utility itemsets. However, no state-of-the-art algorithm performs consistently good across dense and sparse datasets. In this paper, we propose a novel data structure called Utility-Tree, and a tree-based algorithm called UT-Miner that mines high-utility itemsets in one-phase only without generating any candidates and uses a lightweight construction method to reduce the cost of creating projected databases during the search space exploration. The transaction information is stored compactly with every node of the Utility-Tree, and the information is computed efficiently during the recursive invocation of the algorithm. Experimental results on several real-life dense and sparse datasets reveal that UT-Miner is among the top-performing efficient algorithms across different datasets.

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

↑