首页 | 本学科首页   官方微博 | 高级检索  
     

改进的随机游走模型节点排序方法
引用本文:何建军,李仁发. 改进的随机游走模型节点排序方法[J]. 计算机工程与应用, 2011, 47(12): 87-89. DOI: 10.3778/j.issn.1002-8331.2011.12.026
作者姓名:何建军  李仁发
作者单位:湖南大学 计算机与通信学院,长沙 410012
摘    要:复杂网络节点重要性排序是研究复杂网络特性的重要方面之一,被广泛应用于数据挖掘、Web搜索、社会网络分析等众多研究领域。基于物理学场论模型,提出改进的随机游走模式的节点重要性排序算法,即通过节点之间相互作用的场力来确定随机游走模型中的Markov转移矩阵,这样可以对节点重要性排序作出更加准确真实的评估。实验结果表明,所采用的节点重要性评估方法能更合理地解释节点重要性的意义,并且可以给出更加真实精确的节点重要性的评估结果。

关 键 词:复杂网络  节点重要性  场论  随机游走模型  
修稿时间: 

Modified nodes ranking method using random walk model
HE Jianjun,LI Renfa. Modified nodes ranking method using random walk model[J]. Computer Engineering and Applications, 2011, 47(12): 87-89. DOI: 10.3778/j.issn.1002-8331.2011.12.026
Authors:HE Jianjun  LI Renfa
Affiliation:Department of Computer and Communication,Hunan University,Changsha 410012,China
Abstract:Nodes importance ranking in complex network is one of the most important aspects of studying the properties of complex network,which has been widely used in data mining,web searching,analysis of social network and so on.The paper puts forward a new modified random walk model nodes ranking algorithm based on field theory from the physics subject to compute the Markov transfer matrix of random walk model by the field force between the interacting nodes, which can give more exact and actual evaluation for nodes importance.Preliminary experimental results show that the nodes importance measurement is more reasonable to interpret the nodes importance and can compute the results of nodes importance more precisely.
Keywords:complex network  nodes importance  field theory  random walk model
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号