Skip to main content
Article
Mining Direct Antagonistic Communities in Explicit Trust Networks
CIKM '11: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, Glasgow, Scotland, 24-28 October 2011
  • David LO, Singapore Management University
  • Didi Surian, Singapore Management University
  • ZHANG Kuan
  • Ee Peng LIM, Singapore Management University
Publication Type
Conference Proceeding Article
Publication Date
10-2011
Abstract

There has been a recent increase of interest in analyzing trust and friendship networks to gain insights about relationship dynamics among users. Many sites such as Epinions, Facebook, and other social networking sites allow users to declare trusts or friendships between different members of the community. In this work, we are interested in extracting direct antagonistic communities (DACs) within a rich trust network involving trusts and distrusts. Each DAC is formed by two subcommunities with trust relationships among members of each sub-community but distrust relationships across the sub-communities. We develop an efficient algorithm that could analyze large trust networks leveraging the unique property of direct antagonistic community. We have experimented with synthetic and real data-sets (myGamma and Epinions) to demonstrate the scalability of our proposed solution.

ISBN
9781450307178
Identifier
10.1145/2063576.2063722
Publisher
ACM
City or Country
Glasgow, United Kingdom
Additional URL
http://dx.doi.org/10.1145/2063576.2063722
Citation Information
David LO, Didi Surian, ZHANG Kuan and Ee Peng LIM. "Mining Direct Antagonistic Communities in Explicit Trust Networks" CIKM '11: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, Glasgow, Scotland, 24-28 October 2011 (2011) p. 1013 - 1018
Available at: http://works.bepress.com/david_lo/65/