| 关联规则的快速更新算法 |
| |
| 引用本文： | 邵 勇,陈 波,史宝东,刘长征.关联规则的快速更新算法[J].计算机工程,2009,35(19):62-64,6. |
| |
| 作者姓名： | 邵 勇 陈 波 史宝东 刘长征 |
| |
| 作者单位： | (1. 东北大学信息科学与工程学院，沈阳 110004；2. 东北大学流程工业综合自动化教育部重点实验室，沈阳 110004) |
| |
| 基金项目： | 国家自然科学基金资助项目，国家"973"计划基金资助项目，流程工业综合自动化教育部重点实验室开放课题基金资助项目 |
| |
| 摘 要： | 针对基于支持度变化的最大频繁项集维护问题、频繁项集与最大频繁项集互转换时的维护问题，提出3种相应算法。在挖掘最大频繁项集的过程中不断调节支持度大小，以实现其快速更新。基于最大频繁项集子集的支持计数，将现有最大频繁项集转换为频繁项集。
|
| 关 键 词： | 最大频繁项集 数据挖掘 更新 频繁模式树 |
| 修稿时间： | |
Fast Update Algorithm for Association Rule |
| |
| SHAO Yong,CHEN Bo,SHI Bao-dong,LIU Chang-zheng.Fast Update Algorithm for Association Rule[J].Computer Engineering,2009,35(19):62-64,6. |
| |
| Authors: | SHAO Yong CHEN Bo SHI Bao-dong LIU Chang-zheng |
| |
| Affiliation: | (1. School of Information Science & Engineering, Northeastern University, Shenyang 110004; 2. Key Laboratory of Process Industry Integrated Automation, Ministry of Education, Northeastern University, Shenyang 110004) |
| |
| Abstract: | On the spur of the limitation that the conventional morphological skeleton extraction algorithms fail in poor connectivity, thickness and complicated structure, an improved morphological skeleton extraction algorithm is proposed. Morphology operation and connectivity-preserving strategy are combined in the novel algorithm during the shrinking process to prevent the extracted skeleton from being broken up. Two post-processing strategies, one-pixel thickness thinning and biased skeleton trimming, are also involved to enhance the performance of this improved method. The new algorithm is thus superior to the conventional one. Simulation tests verify the effectiveness of the algorithm. |
| |
| Keywords: | maximal disk mathematical morphology skeleton extraction medial axis |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
|
