Publication

Detecting k-Balanced Trusted Cliques in Signed Social Networks

Hao, F.
; 
Yau, S.S.
; 
Min, Geyong
; 
Yang, L.T.
Publication Date
2014
End of Embargo
Supervisor
Keywords
Signed social networks, FCA, Equiconcept, Trusted cliques, Trust managements, Network security
Rights
Peer-Reviewed
Yes
Open Access status
closedAccess
Accepted for publication
Institution
Department
Awarded
Embargo end date
Collections
Engineering and Digital Technology Publications
Show all metadata
Additional title
Abstract
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.
URI
http://hdl.handle.net/10454/10645
Version
No full-text in the repository
Citation
Hao F, Yau SS, Min G et al (2014) Detecting k-Balanced Trusted Cliques in Signed Social Networks. IEEE Internet Computing. 18(2): 24-31.
Link to publisher’s version
Link to published version
Link to Version of Record
https://doi.org/10.1109/MIC.2014.25
Type
Article
Qualification name
Notes