Mining direct antagonistic communities in explicit trust networks

David Lo; Didi Surian; Kuan Zhang; Ee Peng Lim

doi:10.1145/2063576.2063722

Mining direct antagonistic communities in explicit trust networks

David Lo^*, Didi Surian, Kuan Zhang, Ee Peng Lim

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

23 Citations (Scopus)

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.

Original language	English
Title of host publication	CIKM'11
Subtitle of host publication	Proceedings of the 2011 ACM International Conference on Information and Knowledge Management
Editors	Bettina Berendt, Arjen de Vries, Fan Wenfei, Macdonald Craig, Ounis Iadh, Ruthven Ian
Place of Publication	New York
Publisher	Association for Computing Machinery (ACM)
Pages	1013-1018
Number of pages	6
ISBN (Print)	9781450307178
DOIs	https://doi.org/10.1145/2063576.2063722
Publication status	Published - 2011
Externally published	Yes
Event	20th ACM Conference on Information and Knowledge Management, CIKM'11 - Glasgow, United Kingdom Duration: 24 Oct 2011 → 28 Oct 2011

Other

Other	20th ACM Conference on Information and Knowledge Management, CIKM'11
Country/Territory	United Kingdom
City	Glasgow
Period	24/10/11 → 28/10/11

Access to Document

10.1145/2063576.2063722

Cite this

Lo, D., Surian, D., Zhang, K., & Lim, E. P. (2011). Mining direct antagonistic communities in explicit trust networks. In B. Berendt, A. de Vries, F. Wenfei, M. Craig, O. Iadh, & R. Ian (Eds.), CIKM'11: Proceedings of the 2011 ACM International Conference on Information and Knowledge Management (pp. 1013-1018). Association for Computing Machinery (ACM). https://doi.org/10.1145/2063576.2063722

Lo, David ; Surian, Didi ; Zhang, Kuan et al. / Mining direct antagonistic communities in explicit trust networks. CIKM'11: Proceedings of the 2011 ACM International Conference on Information and Knowledge Management. editor / Bettina Berendt ; Arjen de Vries ; Fan Wenfei ; Macdonald Craig ; Ounis Iadh ; Ruthven Ian. New York : Association for Computing Machinery (ACM), 2011. pp. 1013-1018

@inproceedings{681575a9292745c0b8909ffc32c30bba,

title = "Mining direct antagonistic communities in explicit trust networks",

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.",

author = "David Lo and Didi Surian and Kuan Zhang and Lim, {Ee Peng}",

year = "2011",

doi = "10.1145/2063576.2063722",

language = "English",

isbn = "9781450307178",

pages = "1013--1018",

editor = "Bettina Berendt and {de Vries}, Arjen and Fan Wenfei and Macdonald Craig and Ounis Iadh and Ruthven Ian",

booktitle = "CIKM'11",

publisher = "Association for Computing Machinery (ACM)",

address = "United States",

note = "20th ACM Conference on Information and Knowledge Management, CIKM'11 ; Conference date: 24-10-2011 Through 28-10-2011",

}

Lo, D, Surian, D, Zhang, K & Lim, EP 2011, Mining direct antagonistic communities in explicit trust networks. in B Berendt, A de Vries, F Wenfei, M Craig, O Iadh & R Ian (eds), CIKM'11: Proceedings of the 2011 ACM International Conference on Information and Knowledge Management. Association for Computing Machinery (ACM), New York, pp. 1013-1018, 20th ACM Conference on Information and Knowledge Management, CIKM'11, Glasgow, United Kingdom, 24/10/11. https://doi.org/10.1145/2063576.2063722

Mining direct antagonistic communities in explicit trust networks. / Lo, David; Surian, Didi; Zhang, Kuan et al.
CIKM'11: Proceedings of the 2011 ACM International Conference on Information and Knowledge Management. ed. / Bettina Berendt; Arjen de Vries; Fan Wenfei; Macdonald Craig; Ounis Iadh; Ruthven Ian. New York: Association for Computing Machinery (ACM), 2011. p. 1013-1018.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Mining direct antagonistic communities in explicit trust networks

AU - Lo, David

AU - Surian, Didi

AU - Zhang, Kuan

AU - Lim, Ee Peng

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=83055179490&partnerID=8YFLogxK

U2 - 10.1145/2063576.2063722

DO - 10.1145/2063576.2063722

M3 - Conference proceeding contribution

AN - SCOPUS:83055179490

SN - 9781450307178

SP - 1013

EP - 1018

BT - CIKM'11

A2 - Berendt, Bettina

A2 - de Vries, Arjen

A2 - Wenfei, Fan

A2 - Craig, Macdonald

A2 - Iadh, Ounis

A2 - Ian, Ruthven

PB - Association for Computing Machinery (ACM)

CY - New York

T2 - 20th ACM Conference on Information and Knowledge Management, CIKM'11

Y2 - 24 October 2011 through 28 October 2011

ER -

Lo D, Surian D, Zhang K, Lim EP. Mining direct antagonistic communities in explicit trust networks. In Berendt B, de Vries A, Wenfei F, Craig M, Iadh O, Ian R, editors, CIKM'11: Proceedings of the 2011 ACM International Conference on Information and Knowledge Management. New York: Association for Computing Machinery (ACM). 2011. p. 1013-1018 doi: 10.1145/2063576.2063722

Mining direct antagonistic communities in explicit trust networks

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this