文献类型：会议论文

英文题名：Mining frequent closed itemsets in a unidirectional FP-tree

作者：Wei, Q.[1];Wang, X. J.;Song, J. J.;Jiang, B. Q.

第一作者：魏庆

通讯作者：Wei, Q[1]

机构：[1]Henan Univ Finance & Econ, Sch Informat, Zhengzhou 450001, Henan, Peoples R China

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

通讯机构：[1]corresponding author), Henan Univ Finance & Econ, Sch Informat, 80 Wenhua Rd, Zhengzhou 450001, Henan, Peoples R China.|[1048412]河南财经政法大学计算机与信息工程学院;[10484]河南财经政法大学;

会议论文集：International Conference on Informational Technology and Environmental System Science

会议日期：MAY 15-17, 2008

会议地点：Henan Polytechn Univ, Jiaozuo, PEOPLES R CHINA

主办单位：Henan Polytechn Univ

语种：英文

外文关键词：data mining; frequent itemset; frequent closed itemset; unidirectional FP-tree; constrained sub-tree

摘要：Frequent closed itemsets provide a minimal representation of frequent itemsets without losing their support information. A new algorithm --Unid_FP-FCI is proposed, which is an efficient algorithm for mining the complete set of frequent closed itemsets in a unidirectional FP-tree. 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 unidirectional FP-tree, so the flaw of former algorithms is avoided, which need to generate lots of conditional FP-trees for finding frequent closed itemsets recursively. The Unid-FP algorithm improves mining efficiency by reducing the space and time consumption to a great extent.