节点文献

一种重叠可信社团划分算法的设计与实现

An algorithm to detect overlapping trusted community in the trusted social networks

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 李晨葛声

【Author】 LI Chen GE Sheng(Dept.of Computer,Beihang University,Beijing 100083,China)

【机构】 北京航空航天大学

【摘要】 本文首先总结了社会网络中可信社团的特征,确定了可信社团的概念,并给出了可信社团的定量化定义。然后借鉴已有的无向网络上的重叠社团划分算法思想,设计并实现了一种有向网络上的重叠社团的划分算法,并在此基础上设计和实现了可信社团的划分算法。最后在典型的含有重叠社团的网络上和真实的可信社会网络上验证了两个算法的有效性。

【Abstract】 This paper summarizes the characters of trusted community,determines the concept of trusted community,and proposes the quantified definition of trusted community.Then this paper borrows ideas of the existing algorithms to find overlapping community in the undirected network,designs and realizes an algorithm to find overlapping community in the directed network,and based on this,designs and realizes an algorithm to find trusted community.Finally,the validity of the two algorithms are both verified in the social network with typical overlapped community and real trusted social network in this paper.

【基金】 国家自然科学基金资助项目(60842008)
  • 【文献出处】 微计算机信息 ,Microcomputer Information , 编辑部邮箱 ,2011年09期
  • 【分类号】O157.5
  • 【下载频次】91
节点文献中: 

本文链接的文献网络图示:

本文的引文网络