期刊文献+

用一种数据挖掘的方法解决网络拥挤的问题 被引量:5

A Method of Data Mining for Solving the Problem of Internet Crowdedness
下载PDF
导出
摘要 提出了从Web日志中挖掘得到关联规则,通过这些规则实现网页在服务器的预先存取,从而解决网络拥挤问题. As internet is getting more crowded, people have to wait quite a while for the download. The paper provides a solution to the problem by mining the related ruler from the Web Log and then executing saving and drawing of Web page in server in advance.
作者 尹海丽 刘慧
出处 《青岛理工大学学报》 CAS 2005年第5期71-73,共3页 Journal of Qingdao University of Technology
关键词 数据挖掘 WEB 关联规则 网络拥挤 data mining, internet Web, relate ruler, internet crowdedness
  • 相关文献

参考文献5

  • 1朱明.数据挖掘[M].合肥:中国科学技术大学出版社,2001..
  • 2Salton G. Automatic Text Processiong. Addision-Wesley,1999.
  • 3Embley D W,Xu li.Recoed Location and Reconfiguration in Unstructured Mulitiple-Record Web Documents. WebDB00 Proceedings,2000.
  • 4Charkrabarti S, Berg M, Dom B.Focused Crawling:A new Approach to Topic-Sepecific Web Resource Discovery. Proceedings of the 1999 International Virus Bulletin Conference,1999.
  • 5代月明,朱习军,刘连玉.基于集体度一置信度的关联规则挖掘[J].青岛建筑工程学院学报,2005,26(2):74-77. 被引量:2

二级参考文献5

  • 1姜雪花,李玉胜.模糊综合评判在港口设备管理中的应用[J].青岛建筑工程学院学报,2004,25(4):108-110. 被引量:4
  • 2Fan-Chen Tseng,Ching-Chi Hsu,and Jenry Chen. Mining Frequent Closed Itemsets with the Frequent Pattern List. IEEE proceedings on knowledge discovery, 2001,653-654.
  • 3Qinghua Zou,Wesley Chu, etc. A Pattern Decomposition Algorithm for Finding All Frequent Pattern in Large Datasels. IEEE proceedings on knowledge discovery, 2001,673-674.
  • 4Marzena Kryszkiewicz. Direct and Incremental Computing of Maximal Covering Rules. Proceeding of PAKDD, 2001,400-405.
  • 5Edith Cohen, Mayur Dadar,etc. Finding Interesting Associations Without Support Pruning. IEEE Transactions on Knowledge and Data Engineering, 2001,13 ( 1 ) : 64-77.

共引文献1

同被引文献49

引证文献5

二级引证文献27

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部