检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:LU Pengli CHEN Wei GUO Yuhong CHEN Yahong 卢鹏丽;陈玮;郭育红;陈娅红(School of Computer and Communication,Lanzhou University of Technology,Lanzhou 730050,China;School of Mathematics and Statistics,Hexi University,Zhangye 734000,Gansu,China;Department of Mathematics,Lishui University,Lishui 323000,Zhejiang,China)
机构地区:[1]School of Computer and Communication,Lanzhou University of Technology,Lanzhou 730050,China [2]School of Mathematics and Statistics,Hexi University,Zhangye 734000,Gansu,China [3]Department of Mathematics,Lishui University,Lishui 323000,Zhejiang,China
出 处:《Journal of Shanghai Jiaotong university(Science)》2024年第6期1037-1049,共13页上海交通大学学报(英文版)
基 金:the National Natural Science Foundation of China(Nos.11361033 and 11861045)。
摘 要:One of the most important problems in complex networks is to identify the influential vertices for understanding and controlling of information diffusion and disease spreading.Most of the current centrality algorithms focus on single feature or manually extract the attributes,which occasionally results in the failure to fully capture the vertex’s importance.A new vertex centrality approach based on symmetric nonnegative matrix factorization(SNMF),called VCSNMF,is proposed in this paper.For highlight the characteristics of a network,the adjacency matrix and the degree matrix are fused to represent original data of the network via a weighted linear combination.First,SNMF automatically extracts the latent characteristics of vertices by factorizing the established original data matrix.Then we prove that each vertex’s composite feature which is constructed with one-dimensional factor matrix can be approximated as the term of eigenvector associated with the spectral radius of the network,otherwise obtained by the factor matrix on the hyperspace.Finally,VCSNMF integrates the composite feature and the topological structure to evaluate the performance of vertices.To verify the effectiveness of the VCSNMF criterion,eight existing centrality approaches are used as comparison measures to rank influential vertices in ten real-world networks.The experimental results assert the superiority of the method.
关 键 词:complex networks CENTRALITY symmetric nonnegative matrix factorization(SNMF)
分 类 号:TP273.3[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.118.126.145