Abstract
During social interactions in a community, there are often sub-communities that behave in opposite manner. These antagonistic sub-communities could represent groups of people with opposite tastes, factions within a community distrusting one another, etc. Taking as input a set of interactions within a community, we develop a novel pattern mining approach that extracts for a set of antagonistic sub-communities. In particular, based on a set of user specified thresholds, we extract a set of pairs of sub-communities that behave in opposite ways with one another. To prevent a blow up in these set of pairs, we focus on extracting a compact lossless representation based on the concept of closed patterns. To test the scalability of our approach, we built a synthetic data generator and experimented on the scalability of the algorithm when the size of the dataset and mining parameters are varied. Case studies on an Amazon book rating dataset show the efficiency of our approach and the utility of our technique in extracting interesting information on antagonistic sub-communities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
http://www.mysmu.edu/phdis2008/kuan.zhang.2008/agroup.pdf (2009)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of International Conference on Very Large Data Bases (1994)
Cai, D., Shao, Z., He, X., Yan, X., Han, J.: Community mining from multi-relational networks. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol. 3721, pp. 445–452. Springer, Heidelberg (2005)
Dasgupta, I.: ‘living’ wage, class conflict and ethnic strife. Journal of Economic Behavior & Organization (2009) (in press)
Dasgupta, I., Kanbur, R.: Community and class antagonism. Journal of Public Economics 91(9), 1816–1842 (2007)
Denrell, J.: Why most people disapprove of me: Experience sampling in impression formation. Psychological Review 112(4), 951–978 (2005)
Ding, B., Lo, D., Han, J., Khoo, S.-C.: Efficient mining of closed repetitive gapped subsequences from a sequence database. In: ICDE (2009)
Flake, G., Lawrence, S., Giles, C., Coetzee, F.: Self-organization and identification of web communities. Computer 35(3), 66–71 (2002)
Gibson, D., Kleinberg, J., Raghavan, P.: Inferring web communities from link topology. In: Hypertext (1998)
Giles, M., Evans, A.: The power approach to intergroup hostility. The Journal of Conflict Resolution 30(3), 469–486 (1986)
Golbeck, J.: Trust and nuanced profile similarity in online social networks. ACM TWeb 3(4), 1–33 (2009)
Guha, R., Kumar, R., Raghavan, P., Tomkins, A.: Propagation of trust and distrust. In: WWW (2004)
Kunegis, J., Lommatzsch, A., Bauckhage, C.: The slashdot zoo: Mining a social network with negative edges. In: WWW (2009)
Labovitz, S., Hagedorn, R.: A structural-behavioral theory of intergroup antagonism. Social Forces 53(3), 444–448 (1975)
Liu, H., Lim, E.-P., Lauw, H., Le, M.-T., Sun, A., Srivastava, J., Kim, Y.: Predicting trusts among users of online communities: an epinions case study. In: EC (2008)
McPerson, M., Smith-Lovin, L., Cook, J.: Birds of a feather: Homophily in social networks. Annual Review of Sociology 27(3), 415–444 (2001)
Tolsma, J., Graaf, N.D., Quillian, L.: Does intergenerational social mobility affect antagonistic attitudes toward ethnic minorities? British Journal of Sociology 60(2), 257–277 (2009)
Wang, J., Han, J.: BIDE: Efficient mining of frequent closed sequences. In: ICDE (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, K., Lo, D., Lim, EP. (2010). Mining Antagonistic Communities from Social Networks. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2010. Lecture Notes in Computer Science(), vol 6118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13657-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-13657-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13656-6
Online ISBN: 978-3-642-13657-3
eBook Packages: Computer ScienceComputer Science (R0)