一种新的频繁集的挖掘算法

A new algorithm for mining frequent sets

频繁集的挖掘问题是数据挖掘的关键问题 ,本文提出了一种基于频繁树的挖掘频繁集的新方法 ,该算法从频繁项开始搜索、筛选产生符合要求的频繁结点 ,构成频繁树 ,通过有效的筛选方法和独特的构成策略 ,大大的减少了候选集的数量 。

The problem of mining frequent sets is a key issue in data mining. In this paper, a new method of mining frequent sets based on the frequent tree is proposed. The method starts with searching for frequent sets and selecting the frequent node required, forming a frequent tree.The number of alternate frequent sets is greatly reduced and frequent sets of higher supporting are easy to produce by the effective method of selecting and the unique tactics of constructing.