http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Cao Ke-xing,Li Zhao-xing,Li Xin,Lv Zhi-han4 보안공학연구지원센터 2016 International Journal of Multimedia and Ubiquitous Vol.11 No.3
Aiming at the problem of low accuracy and high computational complexity of the traditional social network community recommendation algorithm, a rapid spanning tree detection algorithm is proposed to independently discriminate social network community with the weak connected edge, in order to improve the accuracy of community recommendation and reduce the complexity of algorithm. Firstly, according to the characteristics of social network community recommendation, the maximum spanning tree algorithm is proposed, which is based on the edge weight distribution node similarity, to realize the effective detection of social network community. Secondly, for the proposed algorithm having the problems of repeated adding and deleting of weakly connected edges and the waste of computing resources, a rapid spanning tree detection algorithm based on the independent discrimination of weakly connected edge is proposed so as to further improve the calculation efficiency of the algorithm. Lastly, the effectiveness of the proposed algorithm is verified by comparing the experimental results in the standard test database.