计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (12): 1-4.DOI: 10.3778/j.issn.1002-8331.2009.12.001

• 博士论坛 • 上一篇    下一篇

基于小世界网络理论的机会发现算法

徐悦竹,刘大昕,张健沛,孙晓华   

  1. 哈尔滨工程大学 计算机科学与技术学院,哈尔滨 150001
  • 收稿日期:2008-12-23 修回日期:2009-02-03 出版日期:2009-04-21 发布日期:2009-04-21
  • 通讯作者: 徐悦竹

Chance discovery algorithm based on small-world network

XU Yue-zhu,LIU Da-xin,ZHANG Jian-pei,SUN Xiao-hua   

  1. Computer Science and Technology School,Harbin Engineering University,Harbin 150001,China
  • Received:2008-12-23 Revised:2009-02-03 Online:2009-04-21 Published:2009-04-21
  • Contact: XU Yue-zhu

摘要: 随着互联网络的不断发展,人们需要从大量数据中提取可能成为机会的信息,传统的基于高频模式的重要事件提取算法不能满足现状。提出了一种基于小世界网络(Small World)理论的关键字提取算法,该算法以KeyGraph思想为基础,构建词语关联图,并利用小世界理论对图进行优化,从而不仅能够发现高频事件,而且能够发现相对低频而且意义重要的事件。最后,通过实验验证,用该算法提取的潜在事件是机会。

关键词: 关键字提取, 小世界网络, 机会

Abstract: With the development of Internet,the event from large amount of Internet information,which is important and will become chance,can be extracted.The traditional algorithms,which are based on the model of high frequency,are hard to discover the important and unobserved event.In this paper,a new automatic keyword exaction method based on Small-World Network theory,is proposed.This method is based on the ideas of KeyGraph,constructs the graph of terms and relation,and is optimized by Small-World Network theory.The extracted words can represent more information of the document content,and the low frequent but important terms can also be extracted.Finally,through experiment validated,latency event,which is extracted by this method,is chance.

Key words: keyword extraction, small-world network, chance