期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
网络办公信息管理系统的设计原理和开发
1
作者 付智华 《科技信息》 2009年第4期183-183,185,共2页
办公信息管理系统是面向企业内部办公人员使用的。由于计算机网络的迅猛发展,网络办公信息管理系统将成为一个企业内部、企业与企业之间信息收发、共享的平台,而该系统将为提高企业工作效率、降低沟通成本、拓展商业机遇提供帮助。
关键词 网络 办公信息管理 时时通讯
下载PDF
Improved Pattern Tree for Incremental Frequent-Pattern Mining 被引量:1
2
作者 周明 王太勇 《Transactions of Tianjin University》 EI CAS 2010年第2期129-134,共6页
By analyzing the existing prefix-tree data structure, an improved pattern tree was introduced for processing new transactions. It firstly stored transactions in a lexicographic order tree and then restructured the tre... By analyzing the existing prefix-tree data structure, an improved pattern tree was introduced for processing new transactions. It firstly stored transactions in a lexicographic order tree and then restructured the tree by sorting each path in a frequency-descending order. While updating the improved pattern tree, there was no need to rescan the entire new database or reconstruct a new tree for incremental updating. A test was performed on synthetic dataset T1014D100K with 100 000 transactions and 870 items. Experimental results show that the smaller the minimum sup- port threshold, the faster the improved pattern tree achieves over CanTree for all datasets. As the minimum support threshold increased from 2% to 3.5%, the runtime decreased from 452.71 s to 186.26 s. Meanwhile, the runtime re- quired by CanTree decreased from 1 367.03 s to 432.19 s. When the database was updated, the execution time of im- proved pattern tree consisted of construction of original improved pattern trees and reconstruction of initial tree. The experiment results showed that the runtime was saved by about 15% compared with that of CanTree. As the number of transactions increased, the runtime of improved pattern tree was about 25% shorter than that of FP-tree. The improved pattern tree also required less memory than CanTree. 展开更多
关键词 data mining association rules improved pattern tree incremental mining
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部