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

从动态更新数据库中挖掘具有负值的高上架效用项集

Mining high on-shelf utility itemsets with negative values from dynamic updated database

Anjali N. Radkar, S. S. Pawar

摘要:

效用挖掘通过考虑项目的效用来克服频繁项集挖掘的局限性。物品的效用是基于用户的兴趣或偏好。近年来,时态数据采掘已成为处理变化数据的核心技术。上架效用挖掘考虑了项目的上架时间段,得到时态数据库中项目集的精确效用值。在传统的上架效用挖掘中,数据库中所有项目的收益都被认为是正值。然而,在实际应用中,有些项目可能会有负利润。传统的算法大多是针对静态数据库的。在实际情况中,时态数据库不断地被追加或更新。高实用性项目集需要更新。每次重新运行时态挖掘算法是无效的,因为它忽略了以前发现的项集。它重复以前所做的工作。本文提出了一种从动态更新的时态数据库中寻找具有负值的高上架效用项集的有效算法。

英文摘要:

Utility mining emerged to overcome the limitations of frequent itemset mining by considering the utility of an item. Utility of an item is based on user's interest or preference. Recently, temporal data mining has become a core technical data processing technique to deal with changing data. On-shelf utility mining considers on-shelf time period of item and gets the accurate utility values of itemsets in temporal database. In traditional on-shelf utility mining, profits of all items in databases are considered as positive values. However, in real applications, some items may have negative profit. Most of the traditional algorithms are used to handle static database. In practical situations, temporal databases are continually appended or updated. High on-shelf utility itemsets needs to be updated. Re-running the temporal mining algorithm every time is ineffective since it neglects previously discovered itemsets. It repeats the work done previously. In this paper, an effective algorithm is proposed to find high on-shelf utility itemsets with negative values from the dynamic updated temporal database.

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

↑