期刊文献+

网络节点重要度的快速评估方法 被引量:9

Fast method for node importance evaluation in network
原文传递
导出
摘要 对网络节点进行重要性评估,快速发掘重要性节点已经成为数据挖掘、复杂网络中的一个基本问题,现有的节点重要度评估方法对于大型网络而言,计算速度较慢.基于电阻网络提出一种快速实用的节点重要度评估方法,该方法利用节点对网络电能消耗的影响来评估节点的重要度,如果由于一个节点的存在而导致网络平均电能消耗减少,则该节点就越重要,更之则该节点重要度就低.该方法的时间复杂度为O(n^3),在分布式扩展的情况下可达到O(n),实验分析证明了该方法的有效性,而且运算速度快,能处理大规模网络. Node importance evaluation is one of the important network analyses in complex network and data mining. However most of the existing methods are complex and slow for large networks. In this paper, a practical method based on resistive network for fast node importance evaluation was proposed. Node importance was evaluated based on its influence on the average power dissipation in a resistance network, a node was important because it reduced the average energy dissipation of the network. The time complexity of the algorithm is O(n3) in the worst situation, and is O(n) in the distributed computing environment. Experimental results testify that the algorithm is efficient and effective.
出处 《系统工程理论与实践》 EI CSSCI CSCD 北大核心 2013年第7期1898-1904,共7页 Systems Engineering-Theory & Practice
基金 国家自然科学基金(60903225) 国防科技大学优秀研究生创新基金(S100502)
关键词 网络 节点重要度 电阻网络 电能消耗 network node importance resistive network power dissipation
  • 相关文献

参考文献37

  • 1Albert R, Jeong H, Barabasi A L. Internet: Diameter of the world-wide web[J]. Nature, 1999, 401(6749): 130-131.
  • 2Van Kerrebroeck V, Marinari E. Ranking vertices or edges of a network by loops: A new approach[J]. Physical Review Letters, 2008, 101(9): 098701.
  • 3Albert R, Jeong H, Barabasi A L. Error and attack tolerance of complex networks[J]. Nature, 2000, 406(6794): 378-382.
  • 4Barthelemy M. Betweenness centrality in large complex networks[J]. The European Physical Journal B-Condensed Matter and Complex Systems, 2004, 38(2): 163-168.
  • 5Brandes U. A faster algorithm for betweenness centrality[J]. The Journal of Mathematical Sociology, 2001, 25(2): 163-177.
  • 6Kermarrec A M, Merrer E L, Sericola B, et al. Second order centrality: Distributed assessment of nodes criticity in complex networks[J]. Computer Communications, 2011, 34: 619-628.
  • 7Freeman L C. A set of measures of centrality based on betweenness[J]. Sociometry, 1977, 40(1): 35-41.
  • 8Estrada E, Rodrfguez-Velazquez J A. Subgraph centrality in complex networks[J]. Physical Review E, 2005, 21(5): 056103.
  • 9Mantrach A, Yen L, Callut J, et al. The sum-over-paths covariance kernel: A novel covariance measure between nodes of a directed graph[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2010, 32(6): 1112-1126.
  • 10Corley H W, Sha D Y. Most vital links and nodes in weighted networks[J]. Operations Research Letters, 1982, 1(4): 157-160.

二级参考文献19

  • 1Corley H W, Sha D Y. Most vital links and nodes in weighted networks [J]. Oper Res Lett, 1982, 1:157 - 160.
  • 2Nardelli E, Proietti G, Widmayer P. Finding the most vital node of a shortest path [J]. Theoretical Computer Science, 2001, 296(1): 167- 177.
  • 3Erdos P, Renyi A. On random graphs [J]. Publ Math, 1959, 6:290 - 297.
  • 4Watts D J, Strogatz S H. Collective dynamics of‘small-world' networks [J]. Nature, 1998, 393:440- 442.
  • 5Barabasi A L, Albert R. Emergence of scaling in random networks [J]. Science, 1999, 286:509 - 512.
  • 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.
  • 7Albert R, Jeong H, Barabasi A-L. Error and attack tolerance of complex networks [J]. Nature, 2000, 406:378 -382.
  • 8Gallos 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.
  • 9Ball M O, Golden B L, Vohra R V. Finding the most vital ares in a network [J]. Oper Res Lett, 1989, 8:73 -76.
  • 10Page L B, Perry J E. Reliability polynomials and link importance in networks [J]. IEEE Tans Reliability, 1994, 43(1) : 51 - 58.

共引文献285

同被引文献59

  • 1王会梅,江亮,鲜明,王国玉.计算机网络攻击效果灰色评估模型和算法[J].通信学报,2009,30(S2):17-22. 被引量:14
  • 2高自友,赵小梅,黄海军,毛保华.复杂网络理论与城市交通系统复杂性问题的相关研究[J].交通运输系统工程与信息,2006,6(3):41-47. 被引量:93
  • 3谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,26(11):79-83. 被引量:257
  • 4史春辉.复杂网络拓扑结构抗毁性研究[D].成都:电子科技大学,2013.
  • 5West D B. Introduction to graph theory [ M]. Englewood Cliffs: Prentice hall,2001.
  • 6Mantrach A, Yen L,Callut J, et al. The sum - over - paths covariance kernel: A novel covariance measure between nodes of a directed graph[J] . IEEE Transactions on Pattern Analysis and Machine Intelligence, 20X0 ,32(6) :1112 - 1126.
  • 7Albert R, Jeong H, Barabasi A L. Error and attack tolerance of complex networks [ J]. Nature, 2000, 406(6794) :378 -382.
  • 8Callaway D S, Newman M E J,Strogatez S H, et al. Network robustness and fragility: percolation on random graphs[ J] . Physical Review Letters,2000, 85(25) :5468 -5471.
  • 9庄宝玉.城市输配水官网可靠性研究[D].天津:天津大学,2011.
  • 10Wagner J M,Shamir U,Marks D H. Water distribution reliability - simulation methods [ J]. Journal of Water Resources Planning and Manage-ment, 1988,114(3) : 276 -294.

引证文献9

二级引证文献40

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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