期刊文献+

一种基于局部特性的重要邮箱用户发现方法 被引量:1

AN IMPORTANT E-MAIL USERS DETECTION ALGORITHM BASED ON LOCAL CHARACTERISTICS
下载PDF
导出
摘要 针对有向赋权邮件网络,提出一种基于局部特性的重要邮箱用户发现算法。该方法考虑了节点的点权对节点重要度评估的影响,紧密结合邮件网络的特性,给出了点权的新定义。同时,为了应用于大型有向赋权复杂网络,提出依据网络中节点的局部特征的节点的重要性度量算法,该算法的时间复杂度为ο(2m+n)。在安然邮件语料库上验证了该方法,并且得到了较好的实验结果。 In this paper,aiming at the directed weighted e-mail networks,we put forward an important e-mail users detection algorithm based on local characteristics.The method takes into account the impact of the weight of node on node importance assessment,and closely integrating the features of the mail network,it gives new definition of the weight of node.At the same time,in order to apply to the large directed weighted network,we propose a novel algorithm of importance metric for the node based on local characteristics of the node in network,its time complexity is o(2m+n).This method has been verified on Enron E-mail corpus database,and the quite good experimental results are derived.
出处 《计算机应用与软件》 CSCD 北大核心 2013年第3期51-54,共4页 Computer Applications and Software
基金 国家自然科学基金项目(61070245)
关键词 有向赋权网络 局部特征 节点重要性 安然邮件语料库 Directed weighted network Local characteristics Node importance Enron mail corpus database
  • 相关文献

参考文献2

二级参考文献25

  • 1严网,周涛,王杰,傅忠谦,汪秉宏.Epidemic Spread in Weighted Scale-Free Networks[J].Chinese Physics Letters,2005,22(2):510-513. 被引量:19
  • 2王林,张婧婧.复杂网络的中心化[J].复杂系统与复杂性科学,2006,3(1):13-20. 被引量:60
  • 3谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,26(11):79-83. 被引量:257
  • 4Albert R, Jeong H, Barabasi. Error and attack tolerance of complex networks[J]. Nature, 2000, 406: 378-382.
  • 5Gallos L K, Cohen R, Argyrakis P. Stability and topology of scale-free networks under attack and defense strategies [J].Phys. Rev. Lett. , 2005, 94:(188701-1)-(188701-4).
  • 6Callaway D S , Newman M E J, Strogatez S H, et al. Network robustness and fragility: percolation on random graphs[J]. Phys. Rev. Lett., 2000, 85(25):5468-5471.
  • 7Barthelemy M. Betweenness centrality in large complex networks[J].Euro. Phys. J. B, 2004, 38 (2):163-168.
  • 8李梦辉,樊瑛,狄增如.复杂网络[M].上海:上海科技教育出版社,2006:27-49.
  • 9Corley H W, Sha D Y. Most vital links and nodes in weighted networks [J]. Oper Res Lett, 1982, 1:157 - 160.
  • 10Nardelli E, Proietti G, Widmayer P. Finding the most vital node of a shortest path [J]. Theoretical Computer Science, 2001, 296(1): 167- 177.

共引文献289

同被引文献4

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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