| 分布式时态关联规则挖掘 |
| |
| 引用本文： | 任家东.分布式时态关联规则挖掘[J].燕山大学学报,2003,27(2):107-110. |
| |
| 作者姓名： | 任家东 |
| |
| 作者单位： | 燕山大学信息科学与工程学院,秦皇岛 066004 |
| |
| 摘 要： | 提出了在分布式环境下对于每一层使用不同支持度的时态关联规则挖掘问题及其算法DMARM。该算法使用轮询方法处理分布式系统中各个节点间的通讯问题,在各个节点上利用集合“或”和“与”运算,在求候选频繁模式的同时求出了模式的支持度,减少了数据库的扫描次数。
|
| 关 键 词： | 数据挖掘 时态关联规则 分布式数据库 DMARM |
| 修稿时间： | 2002年10月9日 |
Mining of Temporal Association Rules in Distributed Databases |
| |
| Institution: | (Ren Jiadong),(The College of Information Science and Engineering,Yanshan
University,Qinhuangdao 066004) |
| |
| Abstract: | In this paper we present a temporal association rules mining algorithm DMARM which can be used in distributed environments. We can apply different thresholds at different levels. Algorithm DMARM uses polling method to resolve the communication problem among each nodes in the distributed system. By the "AND" and "OR" operation of the set in each node algorithm DMARM works out the candidate frequent pattern and also achieves the support of the pattern at the same time. Meantime it reduces the times of scanning the database. |
| |
| Keywords: | data mining temporal association rules distributed database |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
