首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于线性表的闭频繁项集挖掘算法
引用本文:李秦,张馨东,童甲佳,李宇博.基于线性表的闭频繁项集挖掘算法[J].兰州大学学报(自然科学版),2011(4):122-126.
作者姓名:李秦  张馨东  童甲佳  李宇博
作者单位:兰州交通大学数理与软件工程学院;
基金项目:国家自然科学基金项目(10961017)
摘    要:利用频繁模式表的线性表简单结构及闭频繁项集挖掘的优点,提出了一种闭频繁项集挖掘算法.模式签名向量间的合取操作以及向量计数操作为该算法的主要操作,实现从已生成的闭频繁项集生成集中抽取代表模式,降低了模式搜索空间,简化了生成闭频繁项集的过程,实验结果验证了该算法的有效性.

关 键 词:闭频繁项集  签名向量  向量合取  向量计数  频繁模式表

Mining closed frequent itemsets based on list structure
LI Qin,ZHANG Xin-dong,TONG Jia-jia,LI Yu-bo School of Mathematics,Physics , Software Engineering,Lanzhou Jiaotong University,Lanzhou ,China.Mining closed frequent itemsets based on list structure[J].Journal of Lanzhou University(Natural Science),2011(4):122-126.
Authors:LI Qin  ZHANG Xin-dong  TONG Jia-jia  LI Yu-bo School of Mathematics  Physics  Software Engineering  Lanzhou Jiaotong University  Lanzhou  China
Institution:LI Qin,ZHANG Xin-dong,TONG Jia-jia,LI Yu-bo School of Mathematics,Physics and Software Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China
Abstract:An approach that combines the advantages of the frequent pattern list(FPL) and closed frequent itemsets mining was proposed.The approach selects representation patterns from closed frequent candidate itemsets to reduce combinational space of frequent patterns.By performing two operations,signature vector conjunction and vector counting,it simplifies the process of closed itemsets generation.Experimental results verified the effectiveness of the algorithm.
Keywords:closed frequent itemset  signature vector  vector conjunction  vector counting  frequent pattern list  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号