Mining direct antagonistic communities in explicit trust networks

Authors:
David Lo;Didi Surian;Kuan Zhang;Ee-Peng Lim
Affiliations:
Singapore Management University, Singapore, Singapore;Singapore Management University, Singapore, Singapore;Singapore Management University, Singapore, Singapore;Singapore Management University, Singapore, Singapore
Venue:
Proceedings of the 20th ACM international conference on Information and knowledge management
Year:
2011

Citing 11
Cited 1

Scalable Algorithms for Association Mining

IEEE Transactions on Knowledge and Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
gSpan: Graph-Based Substructure Pattern Mining

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
CLOSET+: searching for the best strategies for mining frequent closed itemsets

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
BIDE: Efficient Mining of Frequent Closed Sequences

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Efficient mining of iterative patterns for software specification discovery

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Maximal Biclique Subgraphs and Closed Pattern Pairs of the Adjacency Matrix: A One-to-One Correspondence and Mining Algorithms

IEEE Transactions on Knowledge and Data Engineering
A heuristic clustering algorithm for mining communities in signed networks

Journal of Computer Science and Technology
On ranking controversies in wikipedia: models and evaluation

WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Mining antagonistic communities from social networks

PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I

Mining direct antagonistic communities in signed social networks

Information Processing and Management: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.