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

基于关联图的频繁闭模式挖掘
引用本文:王璇. 基于关联图的频繁闭模式挖掘[J]. 辽东学院学报(自然科学版), 2011, 0(2): 154-158,163
作者姓名:王璇
作者单位:福建对外经济贸易职业技术学院信息技术系,福州,350016
摘    要:将关联图的数据挖掘思想应用到频繁闭模式的挖掘中,使用位向量的技术简化项集支持度的计算,构造关联图表示项集间的频繁关系.在此基础上,提出一种频繁闭模式挖掘算法,针对频繁闭模式的特点,结合剪枝策略、子集检测策略、搜索策略等技术手段,优化算法性能.实验结果表明,该算法在时间性能上优于经典的频繁闭模式算法CLOSET.

关 键 词:关联图  频繁闭模式  位向量  数据挖掘

Frequent Close Pattern Mining Based on Association Graph
WANG Xuan. Frequent Close Pattern Mining Based on Association Graph[J]. Journal of Liaodong University(Natural Sciences), 2011, 0(2): 154-158,163
Authors:WANG Xuan
Affiliation:WANG Xuan(Department of Information Technology,Fujian International Business Economic College,Fuzhou 350016,China)
Abstract:The data mining thoughts based on association graph was applied to frequent close pattern mining.The calculation of item set support was simplified by using bit vector technique.The frequent relationship among items was expressed by constructing an association graph.Further more,a mining algorithm of frequent close pattern was proposed.According to the characteristics of the frequent closed pattern,the algorithm performance was improved by using pruning method,subset test strategy and search strategy of,etc.The experimental results showed that the algorithm was superior to CLOSET which was the classic algorithm for frequent close pattern mining.
Keywords:association graph  frequent close pattern  bit vector  data mining
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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