旅游游客社会网络局部社区挖掘方法

Algorithm of mining local communities in tourists social network

为解决游客社会网络构建与关系分类问题,以真实的游客旅游记录为基础,设计一种游客社会网络构建方法,提出一种基于中心节点扩张的局部社区挖掘算法。通过修改PageRank算法对游客社会网络节点进行排名,选取中心度值最大的且没有被其它局部社区包含的节点作为中心节点,用贪心算法对中心节点进行扩张形成局部社区,重复执行,覆盖整个游客社会网络。实验结果表明,该算法可以有效挖掘出游客社会网络中存在的局部社区,具有较小的时间复杂度。

To solve the problems of tourists social network building and tourists relationship classification,an approach to construct tourists social network based on real tourists records was presented,and a local community mining algorithm was proposed based on center nodes expansion.The PageRank algorithm was modified for nodes ranking,a central node with the largest degree centrality and that was not have been included in other local communities was selected,and the center node was expanded to form a local community using the greedy algorithm,the process was repeated until the entire network was covered.Experimental results show that the algorithm can dig out the hidden local communities in the tourist social network effectively,and has lower time complexity.