| 用数据挖掘方法解决网络拥挤的问题 |
| |
| 引用本文： | 辛海涛.用数据挖掘方法解决网络拥挤的问题[J].哈尔滨商业大学学报(自然科学版),2005,21(3):305-307. |
| |
| 作者姓名： | 辛海涛 |
| |
| 作者单位： | 哈尔滨商业大学,计算机工程与应用学院,黑龙江,哈尔滨,150028 |
| |
| 摘 要： | 利用关联分析来获取网页的使用情况，将下一个可能被用户发出请求预先发送到用户端。从另外一种角度解决现在网络普遍出现的拥挤问题，将数据挖掘技术中的关联规则与网络访问技术紧密地结合在一起，为提高网速开辟了一条新的途径。
|
| 关 键 词： | 数据挖掘 关联规则 可信度 支持度 |
| 文章编号： | 1672-0946(2005)03-0305-03 |
| 修稿时间： | 2004年12月21 |
Study on solution of network crowded question by data mining method |
| |
| XIN Hai-tao.Study on solution of network crowded question by data mining method[J].Journal of Harbin University of Commerce :Natural Sciences Edition,2005,21(3):305-307. |
| |
| Authors: | XIN Hai-tao |
| |
| Abstract: | This paper uses the connection analysis to gain the service condition of the homepage, has not been sent out next by the user the request to transmit in advance possibly to the user breaks, now the network generally has the crowded problem from other one kind of angle solution, the data mining technology in connection rule and the network visit technology closely unifies in together, for enhances the net fast, opens a new way to solve it. |
| |
| Keywords: | data mining connection rule confidence level degree of support |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
