期刊文献+

基于最大度和随机游走的混合搜索算法 被引量:2

Mix Searching Algorithms Based on Max Degree and Rand-Walk
下载PDF
导出
摘要 针对常规算法在网络搜索时搜索速度较慢和查询消息过多的缺点,提出了一种基于最大度和随机游走的混合搜索算法。该算法综合了最大度搜索信息利用充分和随机游走快速访问远程连接的优点,仿真结果也证实该算法能有效改善网络搜索速度和控制查询信息量。 As the disadvantages of searching slowly and too much querying information in ordinary algorithms, a mix searching algorithm was advanced basing on max degree and rand walk. This algorithm combined the benefits of sufficiently information using in the max degree and quickly visiting the long-distance links in rand-walk, and the emulation results also show that it works well both in improving the speed of searching and controlling the querying information.
出处 《海军航空工程学院学报》 2010年第5期577-580,共4页 Journal of Naval Aeronautical and Astronautical University
关键词 网络搜索 混合搜索算法 搜索速度 查询信息量 networks searching hybrid searching algorithm speed of searching querying information
  • 相关文献

参考文献8

  • 1MILGRAM S. The small world problem[J]. Psychology Today, 1967,2:60-67.
  • 2KLEINBERG J. Navigation in a small world[J]. Nature,2000,406:845.
  • 3KLEINBERG J. The small-world phenomenon: an algorithmic perspective[C]//Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. New York, 2000:163-170.
  • 4WATTS D J, DODDS P S, NEWMAN M E J. Identity and search in social networks[J]. Science, 2002,296: 1302-1305.
  • 5ADAMIC L A, ADAR E. How to search a social network[J]. Social Networks, 2005,27(3): 187-203.
  • 6ADAMIC L A, LUKOSE R M, PUNIYANI A R, et al. Search in power-law networks[J]. Phys. Rev. E., 2001, 64:046135.
  • 7ADAMIC L A, LUKOSE R M, HUBERMAN B A. Local Search in Unstructured Networks[M]. In S. Bornholdt and H. G. Schuster (eds.), Handbook of Graphs and Networks, Berliln: Wiley-VCH, 2003.
  • 8CLAUSET A, MOORE C. How do networks become navigable[K]. Cond-mat/0309415.

同被引文献8

  • 1王天骄,汪小帆,李翔.无标度网络的最大—最小度搜索算法[J].计算机仿真,2007,24(9):161-163. 被引量:6
  • 2Watts DJ,strogats S H.Collective dynamics of‘small-world’networks[J].Nature,1998,393(6684):440-442.
  • 3R Albert,A L Barabás.i Statisticalmechanics ofcomplex networks[J].RevMod Phys,2002,74:47-97.
  • 4M E J Newman.The structure and function of complex networks[J].SIAM Review,2003,45(2):167-256.
  • 5JM Kleinberg.Navigation in a smallworld[J].Nature,2000,406,845.
  • 6Bollobás B.Random Graphs,New York:Academic Press,2nd ed.,2001.
  • 7Scott J,Tallia A,Crosson J C,et al.Social network analysis as an analytic tool for interaction patterns in primary care practices[J].The Annals of Family Medicine,2005,3(5):443-448.
  • 8AdamicLA.,LukoseRM.,Pt,Puniyani A R,etc.Search in Power-law networks.Phys.Rev.E,2001,64:046135.

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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