Conference
Finding Gangs in War from Signed Networks
Abstract
Given a signed network where edges are weighted in real number, and positive weights indicate cohesion between vertices and negative weights indicate opposition, we are interested in finding k-Oppositive Cohesive Groups (k-OCG). Each k-OCG is a group of k subgraphs such that (1) the edges within each subgraph are dense and cohesive; and (2) the edges crossing different subgraphs are dense and oppositive. Finding k-OCGs is challenging since the …
Authors
Chu L; Wang Z; Pei J; Wang J; Zhao Z; Chen E
Pagination
pp. 1505-1514
Publisher
Association for Computing Machinery (ACM)
Publication Date
August 13, 2016
DOI
10.1145/2939672.2939855
Name of conference
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining