社交网络中top-K相关社区查询方法

摘要

To find top-K relative communities associated with the query point is of significance in practical research . In this paper, the concept of clique and relative community is defined, and a method to rapidly detect the top-K relative communities is explored. A down detection expansion algorithm is proposed. All the clique structures are detected from query point. By extending each clique structure outward to construct a community, the top-K relative communities of the query point is quickly acquired through loop iteration. Meanwhile, to reduce the searching space and computing time, the down detection expansion algorithm is improved. Through comprehensive experimental comparison, the validity of the original algorithm and the efficiency of improved algorithm is verified.%查找与查询点相关的top-K相关社区具有现实的研究意义。文中定义团和相关社区的概念，探寻一种快速检测查询点的top-K相关社区的方法。提出一个向下探测扩展算法，从查询点出发探测团结构，由团结构向外延伸扩展得到社区，通过循环迭代快速得到查询点的top-K相关社区。同时为减少搜索空间和计算时间，改进提出的向下探测搜索算法。通过全面的实验对比，验证算法的有效性和改进算法的高效性。