Spelling suggestions: "subject:"trusted clique"" "subject:"trusted cycliques""
1 |
Detecting k-Balanced Trusted Cliques in Signed Social NetworksHao, F., Yau, S.S., Min, Geyong, Yang, L.T. January 2014 (has links)
No / k-Clique detection enables computer scientists and sociologists to analyze social networks' latent structure and thus understand their structural and functional properties. However, the existing k-clique-detection approaches are not applicable to signed social networks directly because of positive and negative links. The authors' approach to detecting k-balanced trusted cliques in such networks bases the detection algorithm on formal context analysis. It constructs formal contexts using the modified adjacency matrix after converting a signed social network into an unweighted one. Experimental results demonstrate that their algorithm can efficiently identify the trusted cliques.
|
Page generated in 0.0727 seconds