Considering the similar characteristics of complex network between the power grid and the Internet, this paper proposes an identifying method of the critical nodes of the large power grid based on the pagerank algorit...
详细信息
ISBN:
(纸本)9781538664612
Considering the similar characteristics of complex network between the power grid and the Internet, this paper proposes an identifying method of the critical nodes of the large power grid based on the pagerank algorithm. First, the original power grid Google matrix is constructed on the basis of power grid topology and actual power flow;Second, the different role of node type (PV/PQ) in load supply and power transmission is considered to modify the Google matrix;Then, the influence of node failure on power fluctuation and voltage deviation is integrated as grid security factors. Finally, the pagerank algorithm is used to identify the critical nodes that affect load supply and system security. Taking the IEEE 30-Bus system as an example, the effectiveness of the proposed method is verified by the simulation of intentional attack on critical nodes and comparison with other methods.
Aiming at the difficulty of quantitatively evaluating the critical processes in the manufacturing process of complex mechanical products, a critical process identification method based on the pagerank algorithm is pro...
详细信息
Aiming at the difficulty of quantitatively evaluating the critical processes in the manufacturing process of complex mechanical products, a critical process identification method based on the pagerank algorithm is proposed with the goal of identifying key processes in the machining process. Based on the complex network theory, the error transfer network model of the machining process is established in this paper. Adopting the actual machining process as the data set of the complex network, the weights of the machining feature nodes are calculated by the pagerank ranking algorithm, and the nodes are ranked according to the weight values to assess the influence and importance of the nodes in the network model. Finally, taking the connecting rod machining process of a medium-speed marine diesel engine as an example, the results show that the method can quickly and effectively identify the key processes in the machining process.
Node importance ranking is one of key problems in the study of complex *** classical pagerank algorithm only focus on the network structure,which lead to inaccurate ranking *** introducing the features of node attribu...
详细信息
Node importance ranking is one of key problems in the study of complex *** classical pagerank algorithm only focus on the network structure,which lead to inaccurate ranking *** introducing the features of node attributes and user preference,a novel feature-based pagerank(FBPR) algorithm is proposed to identify the important nodes accurately and *** weight matrix and the fixed teleportation vector are redesigned by the feature similarities in the FBPR *** different application scenarios,we can get different ranking results by adjusting the node attributes factor and the user preference ***,several simulation experiments are presented to verify the effectiveness of the FBPR algorithm.
Because of the similarity of link network and citation network, bringing the pagerank algorithm to citation analysis to evaluate the value of a paper is a feasible method. But there are some problems in using the meth...
详细信息
ISBN:
(纸本)9781467329637
Because of the similarity of link network and citation network, bringing the pagerank algorithm to citation analysis to evaluate the value of a paper is a feasible method. But there are some problems in using the method directly. Therefore, combined with the characteristics of the citation network, this paper proposes an alternative method for evaluating the value of a paper based on improved pagerank algorithm. Taking into account some factors such as the impact factor of the journal where the paper is published and the correlation of two papers, the method computes the total value of a paper from two aspects, which are the paper's inherent value and the value passed from other papers. The experimental results show the feasibility and effectiveness of this method.
This article lay emphasis on complex co-author network problems and improved the traditional pagerank algorithm to build an author influence model and paper influence model,and Erdos' s co-author network were anal...
详细信息
This article lay emphasis on complex co-author network problems and improved the traditional pagerank algorithm to build an author influence model and paper influence model,and Erdos' s co-author network were analyzed and discussed as an *** results show that this model is effective,and can be extended to more social networks,breaking the limitations of the pagerank algorithm.
The pinning control problem of complex networks has been widely investigated recent ***,there does not exist a widely accepted pinning scheme which can be applied to the synchronization of complex *** contribution giv...
详细信息
The pinning control problem of complex networks has been widely investigated recent ***,there does not exist a widely accepted pinning scheme which can be applied to the synchronization of complex *** contribution gives a novel pinning scheme which based on the famous pagerank algorithm to make the network realize synchronization as fast as *** simulation indicates that this pinning scheme is effective for undirected networks,however,it fails when it applied to directed networks.
Transport networks display the features of complex networks,in which the vertices importance measurement is *** analyzing some classic importance measurements and the characteristics of transport networks, NodeRank,a ...
详细信息
Transport networks display the features of complex networks,in which the vertices importance measurement is *** analyzing some classic importance measurements and the characteristics of transport networks, NodeRank,a new method based on pagerank algorithm,is proposed in this paper to measure the importance of vertices in transportation *** the constraint equation is deduced and the existence and uniqueness of solutions are *** solving algorithm is described and its convergence is ***,we present a case applying our method to mining key nodes in a real-world transport network.
By abstracting the complex structure of social network into undirected graph, nodes into pages and edges into hyperlinks, and combining pagerank algorithm with the discovery of key nodes in social networks, this thesi...
详细信息
ISBN:
(数字)9781728160672
ISBN:
(纸本)9781728160689
By abstracting the complex structure of social network into undirected graph, nodes into pages and edges into hyperlinks, and combining pagerank algorithm with the discovery of key nodes in social networks, this thesis comes up with a new algorithm of key nodes premised on improved pagerank algorithm, and finally employs microblog data as data set. Through the experiment of comparing KeyRank algorithm with TIPR algorithm, it can be concluded that the pagerank algorithm proposed in this thesis is comparatively suitable for discovering key nodes. Under the same data set, the efficiency of identifying key nodes is raised by 30% in comparison with the other two algorithms.
In the theme crawler,the Shark-Search algorithm is insufficient to consider the global web *** this paper,the pagerank algorithm is used to calculate the URL's authority to make up for this shortcoming,and Shark-P...
详细信息
ISBN:
(纸本)9781509012572
In the theme crawler,the Shark-Search algorithm is insufficient to consider the global web *** this paper,the pagerank algorithm is used to calculate the URL's authority to make up for this shortcoming,and Shark-pagerank algorithm,which adopts the anchor text,the context near the anchor text and authoritative value of web page to measure the value of the URL,is proposed in this *** experiment results show that the new algorithm improves the speed and accuracy of the query,and the algorithm has good stability and scalability.
暂无评论