| 一种有效压缩频繁模式挖掘的算法 |
| |
| 引用本文： | 童咏昕,马世龙,李钰.一种有效压缩频繁模式挖掘的算法[J].北京航空航天大学学报,2009,35(5):640-643. |
| |
| 作者姓名： | 童咏昕 马世龙 李钰 |
| |
| 作者单位： | 北京航空航天大学软件学院,北京,100191;北京航空航天大学计算机学院,北京,100191 |
| |
| 基金项目： | 国家973计划资助项目(2005CB321902) |
| |
| 摘 要： | 频繁模式挖掘的研究最近致力于在一个合理的容错范围内寻找有代表性的模式来压缩庞大的挖掘结果集.一种新型启发式算法AMSA(Approximating Mining based Simulated Annealing)被提出,其采用了模拟退火思想来保证有效性和压缩的质量.依据FIMI(Frequent Itemset Mining Implementations Repository)提供的公用数据集进行的实验结果也证明了这一结论.通过与FPclose算法和RPglobal算法分别进行了性能的比较,AMSA挖掘的结果集规模小于FPclose算法和RPglobal算法得到的结果集规模,特别是当支持度阈值很低时,RPglobal不可在合理时间内产生结果集,AMSA却可在合理时间内得出较精准的结果集.
|
| 关 键 词： | 数据挖掘 模拟退火 启发式方法 |
| 收稿时间： | 2008-08-10 |
Effective algorithm for mining compressed frequent patterns |
| |
| Tong Yongxin,Ma Shilong,Li Yu.Effective algorithm for mining compressed frequent patterns[J].Journal of Beijing University of Aeronautics and Astronautics,2009,35(5):640-643. |
| |
| Authors: | Tong Yongxin Ma Shilong Li Yu |
| |
| Institution: | 1. School of Software, Beijing University of Aeronautics and Astronautics, Beijing 100191, China;
2. School of Computer Science and Technology, Beijing University of Aeronautics and Astronautics, Beijing 100191, China |
| |
| Abstract: | Researches of frequent-pattern mining have recently focused on discovering representative patterns to compress a large of results within a reasonable tolerance bound.A novel heuristic algorithm,approximating mining based simulated annealing(AMSA),was proposed.The algorithm uses a method based simulated-annealing to improve efficiency and quality of the compression.Our experimental studies demonstrate the algorithm is efficient and high quality on a common dataset supported by frequent itemset mining impleme... |
| |
| Keywords: | data mining simulated annealing heuristic method |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《北京航空航天大学学报》浏览原始摘要信息 |
| 点击此处可从《北京航空航天大学学报》下载免费的PDF全文 |
