A New Mining Algorithm Based on Frequent Item Sets

First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008) Pub Date : 2008-01-23 DOI:10.1109/WKDD.2008.86

Wen Yun

引用次数: 1

Abstract

A new mining algorithm has been put in this paper base on frequent item sets. When affair database and minimum support has changed, this new algorithm can get the new frequent item sets by scanning the undirected item set graph only one time. Its execute efficiency is improved distinctly compared to the traditional algorithm.

查看原文本刊更多论文

一种新的基于频繁项集的挖掘算法

本文提出了一种基于频繁项集的挖掘算法。当事件数据库和最小支持度发生变化时，该算法只需扫描无向项集图一次即可得到新的频繁项集。与传统算法相比，该算法的执行效率有明显提高。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)

自引率

0.00%

发文量