摘要
针对大规模复杂网络社团挖掘的效率较低问题,提出一种基于边链接权重的局部社团探测算法。该算法以边两端节点所共有的邻居占其邻居的比值作为该边的链接权重,从某一节点出发通过给定的阈值进行遍历,由此得到该节点所在的局部社团。实验结果表明,算法发现的局部社团能够获得满意的结果,而且时间复杂度趋于线性时间复杂度。
For resolving the low efficiency problems of mining hierarchical community in large-scale complex networks,the algorithm based on link weighting was proposed in this paper,which defined that the weight of an edge was proportional to the number of the common neighbors in its neighborhood and a threshold traversal search to get the local community structure of a node was introduced.Experimental results showed that the algorithm achieved satisfactory result and its time complexity was linear.
出处
《农业网络信息》
2012年第12期32-33,36,共3页
Agriculture Network Information
关键词
链接权重
局部
社团结构
link weighting
locality
community structure
