客服热线:18202992950

A EFFECTIVE METHOD FOR FREQUENT ITEMSETS MINING ON VERY LARGE TRANSACTION DATABASE ENVIRONMENT 发明申请

2023-03-12 4350 893K 0

专利信息

申请日期 2025-09-10 申请号 KR1020090017835
公开(公告)号 KR1020100099378A 公开(公告)日 2010-09-13
公开国别 KR 申请人省市代码 全国
申请人 CHUNGBUK NATIONAL UNIVERSITY INDUSTRY ACADEMIC COOPERATION FOUNDATION
简介 PURPOSE : A method for efficiently mining frequent item sets in a very large transaction database environment is provided to rapidly search dense and rare frequent item sets by using a CPFP-Tree.CONSTITUTION : A header table is configured by counting the items of all transactions within an original transaction database, and a CPFP(Compressed Patricia Frequent Patterns)-tree is configured by using the header table. An individual CPFP-Tree for each item is configured by using the CPFP-Tree and the header table(S620). The frequent item sets are searched by using the individual CPFP-Tree(S630).COPYRIGHT KIPO 2011


您还没有登录,请登录后查看下载地址


反对 0举报 0 收藏 0 打赏 0评论 0
下载排行
网站首页  |  关于我们  |  联系方式  |  使用协议  |  版权隐私  |  网站地图  |  排名推广  |  广告服务  |  积分换礼  |  网站留言  |  RSS订阅  |  违规举报  |  京ICP备2021025988号-4