搜索筛选:
搜索耗时0.0844秒,为你在为你在102,285,761篇论文里面共找到 2 篇相符的论文内容
发布年度:
A New Clustering Approach for Signed Networks Based on Edge-betweenness Centrality and Density of Su
[会议论文] 作者：Xingqin Qi,
来源：第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The 年份：2015
Clustering algorithms for unsigned networks which have only positive edges have been studied intensively.However,when a network has like/dislike,love/hate,r...
[期刊论文] 作者：Xingqin Qi,Robert D. Duval,Kyl,
来源：社交网络(英文) 年份：2013
In this work we propose a centrality measure for networks, which we refer to as Laplacian centrality, that provides a general framework for the centrality of a...
相关搜索：
