Mining direct antagonistic communities in signed social networks

Social networks provide a wealth of data to study relationship dynamics among people. Most social networks such as Epinions and Facebook allow users to declare trusts or friendships with other users. Some of them also allow users to declare distrusts or negative relationships. When both positive and...

Full description

Saved in:
Bibliographic Details
Main Authors: LO, David, SURIAN, Didi, PRASETYO, Philips Kokoh, KUAN, Zhang, LIM, Ee Peng
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2013
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/1691
https://ink.library.smu.edu.sg/context/sis_research/article/2690/viewcontent/Mining_direct_antagonistic_communities_in_signed_social_networks_afv.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-2690
record_format dspace
spelling sg-smu-ink.sis_research-26902020-03-30T01:24:55Z Mining direct antagonistic communities in signed social networks LO, David SURIAN, Didi PRASETYO, Philips Kokoh KUAN, Zhang LIM, Ee Peng Social networks provide a wealth of data to study relationship dynamics among people. Most social networks such as Epinions and Facebook allow users to declare trusts or friendships with other users. Some of them also allow users to declare distrusts or negative relationships. When both positive and negative links co-exist in a network, some interesting community structures can be studied. In this work, we mine Direct Antagonistic Communities (DACs) within such signed networks. Each DAC consists of two sub-communities with positive relationships among members of each sub-community, and negative relationships among members of the other sub-community. Identifying direct antagonistic communities is an important step to understand the nature of the formation, dissolution, and evolution of such communities. Knowledge about antagonistic communities allows us to better understand and explain behaviors of users in the communities. Identifying DACs from a large signed network is however challenging as various combinations of user sets, which is very large in number, need to be checked. We propose an efficient data mining solution that leverages the properties of DACs, and combines the identification of strongest connected components and bi-clique mining. We have experimented our approach on synthetic, myGamma, and Epinions datasets to showcase the efficiency and utility of our proposed approach. We show that we can mine DACs in less than 15 min from a signed network of myGamma, which is a mobile social networking site, consisting of 600,000 members and 8 million links. An investigation on the behavior of users participating in DACs shows that antagonism significantly affects the way people behave and interact with one another. 2013-07-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/1691 info:doi/10.1016/j.ipm.2012.12.009 https://ink.library.smu.edu.sg/context/sis_research/article/2690/viewcontent/Mining_direct_antagonistic_communities_in_signed_social_networks_afv.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Direct antagonistic community Mining maximal bi-cliques Signed social network Databases and Information Systems Numerical Analysis and Scientific Computing Social Media
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Direct antagonistic community
Mining maximal bi-cliques
Signed social network
Databases and Information Systems
Numerical Analysis and Scientific Computing
Social Media
spellingShingle Direct antagonistic community
Mining maximal bi-cliques
Signed social network
Databases and Information Systems
Numerical Analysis and Scientific Computing
Social Media
LO, David
SURIAN, Didi
PRASETYO, Philips Kokoh
KUAN, Zhang
LIM, Ee Peng
Mining direct antagonistic communities in signed social networks
description Social networks provide a wealth of data to study relationship dynamics among people. Most social networks such as Epinions and Facebook allow users to declare trusts or friendships with other users. Some of them also allow users to declare distrusts or negative relationships. When both positive and negative links co-exist in a network, some interesting community structures can be studied. In this work, we mine Direct Antagonistic Communities (DACs) within such signed networks. Each DAC consists of two sub-communities with positive relationships among members of each sub-community, and negative relationships among members of the other sub-community. Identifying direct antagonistic communities is an important step to understand the nature of the formation, dissolution, and evolution of such communities. Knowledge about antagonistic communities allows us to better understand and explain behaviors of users in the communities. Identifying DACs from a large signed network is however challenging as various combinations of user sets, which is very large in number, need to be checked. We propose an efficient data mining solution that leverages the properties of DACs, and combines the identification of strongest connected components and bi-clique mining. We have experimented our approach on synthetic, myGamma, and Epinions datasets to showcase the efficiency and utility of our proposed approach. We show that we can mine DACs in less than 15 min from a signed network of myGamma, which is a mobile social networking site, consisting of 600,000 members and 8 million links. An investigation on the behavior of users participating in DACs shows that antagonism significantly affects the way people behave and interact with one another.
format text
author LO, David
SURIAN, Didi
PRASETYO, Philips Kokoh
KUAN, Zhang
LIM, Ee Peng
author_facet LO, David
SURIAN, Didi
PRASETYO, Philips Kokoh
KUAN, Zhang
LIM, Ee Peng
author_sort LO, David
title Mining direct antagonistic communities in signed social networks
title_short Mining direct antagonistic communities in signed social networks
title_full Mining direct antagonistic communities in signed social networks
title_fullStr Mining direct antagonistic communities in signed social networks
title_full_unstemmed Mining direct antagonistic communities in signed social networks
title_sort mining direct antagonistic communities in signed social networks
publisher Institutional Knowledge at Singapore Management University
publishDate 2013
url https://ink.library.smu.edu.sg/sis_research/1691
https://ink.library.smu.edu.sg/context/sis_research/article/2690/viewcontent/Mining_direct_antagonistic_communities_in_signed_social_networks_afv.pdf
_version_ 1770571455428296704