文献类型：期刊文献

英文题名：A nonreversing FP-tree algorithm mining with frequent closed item sets

作者：Wei, Qing[1]; Zhao, Jitao[2]; Song, Jingjing[3]

第一作者：魏庆

通讯作者：Wei, Q.|[1048412e14d82b2]魏庆;

机构：[1] School of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou 450002, Henan, China; [2] College of Computer Science and Technology, Xuchang University, Xuchang 164000, Henan, China; [3] School of information and Science, Qingyuan polytechnic, Qingyuan 511510, Guangdong, China

第一机构：河南财经政法大学计算机与信息工程学院

通讯机构：[1]School of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou 450002, Henan, China|[1048412]河南财经政法大学计算机与信息工程学院;[10484]河南财经政法大学;

年份：2012

卷号：7

期号：2

起止页码：822-829

外文期刊名：International Review on Computers and Software

收录：EI(收录号：20123115301802);Scopus(收录号：2-s2.0-84864402086)

语种：英文

外文关键词：Data mining - Efficiency - Forestry

摘要：The frequent closed item set algorithm has shown its important advances by providing a minimal representation of frequent item sets without losing their support information. However, many applications showed that the efficiency of the frequent closed item set algorithm cannot meet requirements, which made it difficult to extend the application range for data. By analyzing the influence factors on the efficiency of frequent closed item set algorithm, a new algorithm -FrecisFP (Frequent Closed Item Sets FP tree) is proposed in this paper. In the improved algorithm, FP tree technology was used, it only generates constrained sub-trees consisting of three small arrays in process of mining, which is a virtual tree structure based on the originally nonreversing FP-tree, so the flaw of former algorithms is avoided. Experimental results showed that the proposed algorithm improved the mining efficiency by reducing the space and time consumption to a great extent. ? 2012 Praise Worthy Prize S.r.l. -All rights reserved. -All rights reserved.