采用政治、经济、社会和技术分析法(political,economic,social and technology analysis,简称PEST分析法)对我国消除疟疾督导与评估工作中的政治、经济、社会和技术等4类环境因素进行系统分析,为提升消除疟疾督导与评估工作的效益提供...采用政治、经济、社会和技术分析法(political,economic,social and technology analysis,简称PEST分析法)对我国消除疟疾督导与评估工作中的政治、经济、社会和技术等4类环境因素进行系统分析,为提升消除疟疾督导与评估工作的效益提供科学依据。展开更多
Finding the shortest path （SP） in a large-scale network analysis between any two nodes is a tough but very significant task. The SP can help us to analyze the information spreading performance and research the laten...Finding the shortest path （SP） in a large-scale network analysis between any two nodes is a tough but very significant task. The SP can help us to analyze the information spreading performance and research the latent relationship in the weighted social network, and so on. As the size of the social network increases, the traditional SP algorithms have poor performance and there is not a suitable algorithm for weighted social network. Some features of the network analysis are beneficial to solve this problem, and community structure ignored by the traditional methods is one of the most important features. In this paper, we propose a shortest path algorithm based on community detection （SPCD） by integrating community detection algorithm with traditional search methods. SPCD constructs a community graph by using community structure to narrow the searching scope. The algorithm presented improves the time efficiency and maintains the accuracy scale of the SR Experimental results on five real-world networks demonstrate the effectiveness of the proposed methods for the SP problem.展开更多
文摘Finding the shortest path （SP） in a large-scale network analysis between any two nodes is a tough but very significant task. The SP can help us to analyze the information spreading performance and research the latent relationship in the weighted social network, and so on. As the size of the social network increases, the traditional SP algorithms have poor performance and there is not a suitable algorithm for weighted social network. Some features of the network analysis are beneficial to solve this problem, and community structure ignored by the traditional methods is one of the most important features. In this paper, we propose a shortest path algorithm based on community detection （SPCD） by integrating community detection algorithm with traditional search methods. SPCD constructs a community graph by using community structure to narrow the searching scope. The algorithm presented improves the time efficiency and maintains the accuracy scale of the SR Experimental results on five real-world networks demonstrate the effectiveness of the proposed methods for the SP problem.
