基于二进制的频繁项集挖掘新算法

频繁项集挖掘是数据挖掘中的一个经典的问题。然而,大部分算法需要扫描数据库多次,算法效率比较低。该文提出了一个效率比较好的挖掘频繁项集的新算法,在这个算法中,所有的事务都是以二进制的形式表示,所以挖掘极大频繁项集的任务就变成了从二进制集中发现频繁模式。而且,这种算法只需要扫描原始数据库一次。最后,利用试验来证明这种算法的效率和优势。

A New Algorithm for Discovery Maximal Frequent Itemsets Based on Binary Vector Sets

Frequent itemset mining is a classic problem in datamining.However,most algorithms have to scan databases many times.This paper presents an algorithm that can find maximal frequent itemsets quickly.In this algorithm,each transaction is represented as a binary vector,so the task of discovering maximal frequent itemsets is turn to search frequent patterns in binary vector set.Furthermore,this algorithm can certify mining maximal frequent patterns with only one scan of original databases.Experiments verify the...