Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Mining Direct Antagonistic Communities In Signed Social Networks, David Lo, Didi Surian, Philips Kokoh Prasetyo, Zhang Kuan, Ee Peng Lim
Mining Direct Antagonistic Communities In Signed Social Networks, David Lo, Didi Surian, Philips Kokoh Prasetyo, Zhang Kuan, Ee Peng Lim
Research Collection School Of Computing and Information Systems
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 …
Mining Direct Antagonistic Communities In Explicit Trust Networks, David Lo, Didi Surian, Zhang Kuan, Ee Peng Lim
Mining Direct Antagonistic Communities In Explicit Trust Networks, David Lo, Didi Surian, Zhang Kuan, Ee Peng Lim
Research Collection School Of Computing and Information Systems
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 …