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

基于约束的最大频繁模式的挖掘
引用本文:周忠眉,吴朝晖.基于约束的最大频繁模式的挖掘[J].复旦学报(自然科学版),2004,43(5):746-749.
作者姓名:周忠眉  吴朝晖
作者单位:浙江大学,计算机科学与技术学院,杭州,310027;漳州师范学院,计算机系,漳州,363000;浙江大学,计算机科学与技术学院,杭州,310027
基金项目:国家重点基础研究发展计划(973计划),the Zhangzhou teacher's college research foundation,2002dea 30042,SK03013,,
摘    要:频繁模式挖掘通常产生大量的挖掘结果,基于约束的最大模式挖掘成为目前研究的焦点.给出基于约束的频繁最大模式的定义和挖掘基于约束的频繁最大模式算法.

关 键 词:频繁最大模式  基于约束的频繁closed模式  基于约束的频繁弱closed模式  基于约束的频繁最大模式

Mining Frequent Maximum Patterns with Constraint
Abstract.Mining Frequent Maximum Patterns with Constraint[J].Journal of Fudan University(Natural Science),2004,43(5):746-749.
Authors:Abstract
Abstract:Frequent pattern mining often generates a very large number of patterns and rules, which reduces not only the efficiency but also the effectiveness of mining. Recent work has highlighted the importance of the paradigm of constraint-based frequent maximum pattern mining. It gives the definition of the frequent maximum pattern with constraint and develop an algorithm for mining frequent maximum patterns with convertible anti-monotone constraint.
Keywords:frequent closed pattern  frequent closed pattern with constraint  weak frequent closed pattern with constraint  frequent maximum pattern with constraint
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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