摘要
提出了一种基于频繁模式矩阵FP-array的挖掘最大频繁项目集的算法。算法基本思想:①只扫描事务数据库一遍,把该数据库转换成一个矩阵FP-array,并且保留了所有事务数据库中项目间的关联信息,然后对该矩阵进行挖掘。②在FP-array中只存放逻辑型数据,节省了存储空间。③直接在FP-array上挖掘而不需要递归创建大量条件模式矩阵,挖掘过程采用逻辑运算,在效率上有独特的优势。通过实验验证了算法的有效性。
A new algorithm for mining maximum frequent itemsets based on FP-array is presented. The main idea of this algorithm is that ① it can convert a transaction database into a FP-array through scanning the database only once. Then it does the mining work of the FP-array that includes all information of items in database. ② FP-array is better in memory because it stores logic data only. ③ There is no need to build conditional arrays in the FP-array mining process. Logic operaion is adopted so that the algorithm has predominance in efficiency. An experiment is carried out to verify the mining effectiveness.
出处
《计算机应用与软件》
CSCD
北大核心
2007年第7期45-46,53,共3页
Computer Applications and Software
基金
天津市科技发展计划资助项目(04310941R)
天津市应用基础研究计划资助项目(05YFJMJC11700)
河北省科技研究与发展指导计划项目(0621355)。
