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

渐进式数据库上高效支持耦合的频繁模式挖掘

Efficient Support Coupled Frequent Pattern Mining Over Progressive Databases

B. N. Keshavamurthy, Mitesh Sharma, Durga Toshniwal

摘要:

最近有很多关于序列模式挖掘的研究。渐进式数据库上的序列模式挖掘是一个比较新的方法,它是在感兴趣的时间段内逐步发现序列模式。感兴趣的时间段是一个随着时间的推移而不断前进的滑动窗口。随着滑动窗口焦点的变化,新项被添加到感兴趣的数据集中,过时的项被从中删除并成为最新的。一般来说,现有的建议没有充分探讨现实世界的情况下,如项目与支持数据流应用程序,如购物篮分析。因此,从支持的频繁项中挖掘重要知识成为一个重要的研究课题。我们提出的新方法有效地挖掘频繁序列模式加上支持使用渐进挖掘树。

英文摘要:

There have been many recent studies on sequential pattern mining. The sequential pattern mining on progressive databases is relatively very new, in which we progressively discover the sequential patterns in period of interest. Period of interest is a sliding window continuously advancing as the time goes by. As the focus of sliding window changes, the new items are added to the dataset of interest and obsolete items are removed from it and become up to date. In general, the existing proposals do not fully explore the real world scenario, such as items associated with support in data stream applications such as market basket analysis. Thus mining important knowledge from supported frequent items becomes a non trivial research issue. Our proposed novel approach efficiently mines frequent sequential pattern coupled with support using progressive mining tree.

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

↑