VTK: Vertical Mining of Top-Rank-K Frequent Patterns | |
Fang, Guo-Dong ; Deng, Zhi-Hong | |
2008 | |
英文摘要 | Mining Top-Rank-K frequent patterns is a new topic in frequent pattern mining. In this paper, we propose a new mining algorithm called VTK, Vertical Mining of Top-Rank-K Frequent Patterns, to mining Top-Rank-K frequent patterns using some Vertical skills. Our performance study shows that the VTK method is more efficient and scalable for mining both synthetic datasets and real datasets than the algorithms proposed before.; Computer Science, Artificial Intelligence; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; Mathematics, Applied; Statistics & Probability; EI; CPCI-S(ISTP); 3 |
语种 | 英语 |
DOI标识 | 10.1109/FSKD.2008.472 |
内容类型 | 其他 |
源URL | [http://ir.pku.edu.cn/handle/20.500.11897/153504] ![]() |
专题 | 信息科学技术学院 |
推荐引用方式 GB/T 7714 | Fang, Guo-Dong,Deng, Zhi-Hong. VTK: Vertical Mining of Top-Rank-K Frequent Patterns. 2008-01-01. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论