| 基于垂直二进制位图的频繁模式挖掘算法 |
| |
| 引用本文： | 吕橙,郝莹,张翰韬.基于垂直二进制位图的频繁模式挖掘算法[J].山东大学学报(理学版),2007,42(5):24-29. |
| |
| 作者姓名： | 吕橙 郝莹 张翰韬 |
| |
| 作者单位： | 北京建筑工程学院,计算机系,北京,100044 |
| |
| 基金项目： | 北京市教委科技发展计划项目;北京建筑工程学院校科研和教改项目 |
| |
| 摘 要： | 采用垂直二进制位图映射事务数据库，提出了用二进制位图生成一种新的NBFP-Tree结构，并据此提出了一种新的频繁模式挖掘算法NBFP-mine. 该算法不产生候选集，对NBFP-Tree结构进行深度优先遍历一次，就可从NBFP-Tree结构上直接查找出最大频繁模式. 最后，从理论分析和实践验证了它的高效性.
|
| 关 键 词： | 垂直二进制位图 二进制位串 NBFP-Tree结构 NBFP-mine算法 |
| 文章编号： | 1671-9352（2007）05-0024-06 |
| 收稿时间： | 2006-10-14 |
| 修稿时间： | 2006-10-14 |
Algorithm of mining frequent patterns based on the vertical bitmap |
| |
| L Cheng,HAO Ying,ZHANG Han-tao.Algorithm of mining frequent patterns based on the vertical bitmap[J].Journal of Shandong University,2007,42(5):24-29. |
| |
| Authors: | L Cheng HAO Ying ZHANG Han-tao |
| |
| Institution: | Department of Computer Science & Technology, Beijing Institute of Architecture and Engineering, Beijing 100044, China |
| |
| Abstract: | The vertical bitmap transaction database is introduced to propose a new data structure of the NBFP-Tree based on it.A new algorithm,NBFP-mine,is also offered which is used to mine maximal frequent patterns.This method does not generate any candidate,which can query the maximal frequent patterns easily from the NBFP-Tree directly by once accessing depth-first ergodic of this data structure. Finally,its high efficiency is proved theoretically and experimentally. |
| |
| Keywords: | vertical bitmap bit vector NBFP-Tree structure NBFP-mine algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《山东大学学报(理学版)》下载免费的PDF全文 |
