Identifying influential nodes in complex networks and ranking their importance plays an important role in many fields such as public opinion analysis, marketing, epidemic prevention and control. To solve the issue of ...Identifying influential nodes in complex networks and ranking their importance plays an important role in many fields such as public opinion analysis, marketing, epidemic prevention and control. To solve the issue of the existing node centrality measure only considering the specific statistical feature of a single dimension, a SLGC model is proposed that combines a node’s self-influence, its local neighborhood influence, and global influence to identify influential nodes in the network. The exponential function of e is introduced to measure the node’s self-influence;in the local neighborhood,the node’s one-hop neighboring nodes and two-hop neighboring nodes are considered, while the information entropy is introduced to measure the node’s local influence;the topological position of the node in the network and the shortest path between nodes are considered to measure the node’s global influence. To demonstrate the effectiveness of the proposed model, extensive comparison experiments are conducted with eight existing node centrality measures on six real network data sets using node differentiation ability experiments, susceptible–infected–recovered(SIR) model and network efficiency as evaluation criteria. The experimental results show that the method can identify influential nodes in complex networks more accurately.展开更多
Identifying influential nodes in complex networks is essential for network robust and stability,such as viral marketing and information control.Various methods have been proposed to define the influence of nodes.In th...Identifying influential nodes in complex networks is essential for network robust and stability,such as viral marketing and information control.Various methods have been proposed to define the influence of nodes.In this paper,we comprehensively consider the global position and local structure to identify influential nodes.The number of iterations in the process of k-shell decomposition is taken into consideration,and the improved k-shell decomposition is then put forward.The improved k-shell decomposition and degree of target node are taken as the benchmark centrality,in addition,as is well known,the effect between node pairs is inversely proportional to the shortest path length between two nodes,and then we also consider the effect of neighbors on target node.To evaluate the performance of the proposed method,susceptible-infected(SI)model is adopted to simulate the spreading process in four real networks,and the experimental results show that the proposed method has obvious advantages over classical centrality measures in identifying influential nodes.展开更多
目的 文中通过提出一种新的回环解决方案,平衡回环检测系统的高准确率与高运行效率。方法 提出一种利用组合图像特征与分层节点搜索的新方法。首先,计算一种原始图像的下采样二值化全局特征和经过改进的ORB(oriented FAST and rotated B...目的 文中通过提出一种新的回环解决方案,平衡回环检测系统的高准确率与高运行效率。方法 提出一种利用组合图像特征与分层节点搜索的新方法。首先,计算一种原始图像的下采样二值化全局特征和经过改进的ORB(oriented FAST and rotated BRIEF)局部特征,将其存入图像特征数据库。其次,引入一种分层节点搜索算法,在数据库中搜索与当前图像特征最相似的全局特征作为回环候选。最后,利用改进的ORB特征进行局部特征匹配,验证候选图像,确定回环检测结果。结果 使用该算法在3个不同的数据集上进行验证,测试中每次回环检测的平均处理时间仅需19 ms。结论 实验结果表明,该算法在运行效率、准确率、召回率等方面均达到了领域内的先进水平。展开更多
Bitcoin has made an increasing impact on the world's economy and financial order,which attracted extensive attention of researchers and regulators from all over the world.Most previous studies had focused more on ...Bitcoin has made an increasing impact on the world's economy and financial order,which attracted extensive attention of researchers and regulators from all over the world.Most previous studies had focused more on the transaction layer,but less on the network layer.In this paper,we developed BNS(Bitcoin Network Sniffer),which could find and connect nodes in the Bitcoin network,and made a measurement in detail.We collected nearly 4.1 million nodes in 1.5 hours and identified 9,515 reachable nodes.We counted the reachable nodes'properties such as:service type,port number,client version and geographic distribution.In addition,we analyzed the stability of the reachable nodes in depth and found nearly 60%kept stable during 15 days.Finally,we proposed a new approach to infer the Bitcoin network topology by analyzing the Neighbor Addresses of Adjacent Nodes and their timestamps,which had an accuracy over 80%.展开更多
基金Project supported by the Natural Science Basic Research Program of Shaanxi Province of China (Grant No. 2022JQ675)the Youth Innovation Team of Shaanxi Universities。
文摘Identifying influential nodes in complex networks and ranking their importance plays an important role in many fields such as public opinion analysis, marketing, epidemic prevention and control. To solve the issue of the existing node centrality measure only considering the specific statistical feature of a single dimension, a SLGC model is proposed that combines a node’s self-influence, its local neighborhood influence, and global influence to identify influential nodes in the network. The exponential function of e is introduced to measure the node’s self-influence;in the local neighborhood,the node’s one-hop neighboring nodes and two-hop neighboring nodes are considered, while the information entropy is introduced to measure the node’s local influence;the topological position of the node in the network and the shortest path between nodes are considered to measure the node’s global influence. To demonstrate the effectiveness of the proposed model, extensive comparison experiments are conducted with eight existing node centrality measures on six real network data sets using node differentiation ability experiments, susceptible–infected–recovered(SIR) model and network efficiency as evaluation criteria. The experimental results show that the method can identify influential nodes in complex networks more accurately.
文摘Identifying influential nodes in complex networks is essential for network robust and stability,such as viral marketing and information control.Various methods have been proposed to define the influence of nodes.In this paper,we comprehensively consider the global position and local structure to identify influential nodes.The number of iterations in the process of k-shell decomposition is taken into consideration,and the improved k-shell decomposition is then put forward.The improved k-shell decomposition and degree of target node are taken as the benchmark centrality,in addition,as is well known,the effect between node pairs is inversely proportional to the shortest path length between two nodes,and then we also consider the effect of neighbors on target node.To evaluate the performance of the proposed method,susceptible-infected(SI)model is adopted to simulate the spreading process in four real networks,and the experimental results show that the proposed method has obvious advantages over classical centrality measures in identifying influential nodes.
文摘目的 文中通过提出一种新的回环解决方案,平衡回环检测系统的高准确率与高运行效率。方法 提出一种利用组合图像特征与分层节点搜索的新方法。首先,计算一种原始图像的下采样二值化全局特征和经过改进的ORB(oriented FAST and rotated BRIEF)局部特征,将其存入图像特征数据库。其次,引入一种分层节点搜索算法,在数据库中搜索与当前图像特征最相似的全局特征作为回环候选。最后,利用改进的ORB特征进行局部特征匹配,验证候选图像,确定回环检测结果。结果 使用该算法在3个不同的数据集上进行验证,测试中每次回环检测的平均处理时间仅需19 ms。结论 实验结果表明,该算法在运行效率、准确率、召回率等方面均达到了领域内的先进水平。
基金supported by National Key Research and Development Program of China (Grant No.2020YFB1006105)
文摘Bitcoin has made an increasing impact on the world's economy and financial order,which attracted extensive attention of researchers and regulators from all over the world.Most previous studies had focused more on the transaction layer,but less on the network layer.In this paper,we developed BNS(Bitcoin Network Sniffer),which could find and connect nodes in the Bitcoin network,and made a measurement in detail.We collected nearly 4.1 million nodes in 1.5 hours and identified 9,515 reachable nodes.We counted the reachable nodes'properties such as:service type,port number,client version and geographic distribution.In addition,we analyzed the stability of the reachable nodes in depth and found nearly 60%kept stable during 15 days.Finally,we proposed a new approach to infer the Bitcoin network topology by analyzing the Neighbor Addresses of Adjacent Nodes and their timestamps,which had an accuracy over 80%.