Abstract
Many networks can be modeled as signed graphs. These include social networks, and relationships/interactions networks. Detecting sub-structures in such networks helps us understand user behavior, predict links, and recommend products. In this paper, we detect dense sub-structures from a signed graph, called quasi antagonistic communities (QACs). An antagonistic community consists of two groups of users expressing positive relationships within each group but negative relationships across groups. Instead of requiring complete set of negative links across its groups, a QAC allows a small number of inter-group negative links to be missing. We propose an algorithm, Mascot, to find all maximal quasi antagonistic communities (MQACs). Mascot consists of two stages: pruning and enumeration stages. Based on the properties of QAC, we propose four pruning rules to reduce the size of candidate graphs in the pruning stage. We use an enumeration tree to enumerate all strongly connected subgraphs in a top–down fashion in the second stage before they are used to construct MQACs. We have conducted extensive experiments using synthetic signed graphs and two real networks to demonstrate the efficiency and accuracy of the Mascot algorithm. We have also found that detecting MQACs helps us to predict the signs of links.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Notes
Justin Bieber and Conor Maynard are two teens who enjoy wide success in their singing career.
Another version of absolute QB that does not include condition (2) was proposed in a subsequent work (Sim et al. 2006).
Connectivity of any pair of vertices in a \((\epsilon , min\_size)\) absolute QB or \((\delta , min\_size)\) relative QB can be proven in a similar manner.
References
Abello J, Resende MGC, Sudarsky S (2002) Massive quasi-clique detection. In: Latin American theoretical informatics symposium, pp 598–612
Alba RD (1973) A graph-theoretic definition of a socimetric clique. J Math Sociol 3:113–126
Alvarez-Hamelin I, DallÁsta L, Barrat A, Vespignani A (2008) K-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases. Netw Heterog Media 3(2):371–393
Anchuri P, Magdon-Ismail M (2012) Communities and balance in signed networks: a spectral approach. In: ASONAM, pp 235–242
Ball B, Karrer B, Newman MEJ (2011) An efficient and principled method for detecting communities in networks. Phys Rev E 84:36103
Bansal N, Blum A, Chawla S (2004) Correlation clustering. Mach Learn 56(1–3):89–113
Beyene Y, Faloutsos M, Chau P, Faloutsos C (2008) The ebay graph: How do online auction users interact? In: Computer communications workshops, pp 13–18
Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech 10:1–12
Cartwright D, Harary F (1956) Structure balance: a generalization of Heider’s theory. Psychol Rev 63(5):277–293
Coen B, Joep K (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575–577
Dandekar P (2010) Analysis and generative model for trust networks. Technique Report, pp 1–5
Donetti L, Mun̈oz MA (2004) Detecting network communities: a new systematic and efficient algorithm. J Stat Mech: P10012(cond-mat/0404652)
Doreian P, Mrvar A (1996) A partitioning approach to structural balance. Soc Netw 18(2):149–168
Everett M (1982) Graph theoretic blockings, k-plexes and k-cutpoints. J Math Sociol 9:75–84
Giatsidis C, Thilikos DM, Vazirgiannis M (2011) Evaluating cooperation in communities with the k-core structure. In: 2011 International conference on advances in social networks analysis and mining, pp 87–93
Girvan M, Newman MEJ (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113
Groshaus M, Szwarcfiter JL (2010) Biclique graphs and biclique matrices. J Graph Theory 63(1):1–16
Heider F (1946) Attitudes and cognitive organization. J Psychol 21:107–112
Jamali M, Abolhassani H (2006) Different aspects of social network analysis. In: Web intelligence, pp 66–72
Johnson DS, Yanakakis M, Papadimitriou CH (1988) On generating all maximal independent sets. Inf Process Lett 27(3):119–123
Karrer B, Newman MEJ (2011) Stochastic blockmodels and community structure in networks. Phys Rev E 83:016107
Leicht EA, Girvan M, Newman MEJ (2006) Vertex similarity in networks. Phys Rev E 73:026120
Leskovec J, Huttenlocher DP, Kleinberg JM (2010) Signed networks in social media. In: CHI, pp 1361–1370
Li J, Sim K, Liu G, Wong L (2008) Maximal quasi-bicliques with balanced noise tolerance: concepts and co-clustering applications. In: SIAM international conference on data mining, pp 72–83
Liu G, Wong L (2008) Effective pruning techniques for mining quasi-cliques. In: European conference on machine learning and knowledge discovery in databases, pp 33–49
Liu X, Li J, Wang L (2008) Quasi-bicliques: complexity and binding pairs. In: The 14th annual international computing and combinatorics conference, pp 255–264
Lo D, Surian D, Prasetyo PK, Zhang K, Lim EP (2013) Mining direct antagonistic communities in signed social networks. Inf Process Manag 49(4):773–791
Lo D, Surian D, Zhang K, Lim EP (2011) Mining direct antagonistic communities in explicit trust networks. In: ACM conference on information and knowledge management, pp 1043–1054
Luce RD (1950) Connectivity and generalized cliques in sociometric group structure. Psychometrika 15:169–190
Luce RD, Perry AD (1949) A method of matrix analysis of group structure. Psychometrika 14(2):95–116
Mokken RJ (1979) Cliques, clubs and clans. Qual Quant 13:161–173
Moon JW, Moser L (1965) On cliques in graphs. Isr J Math 3:23–28
Mucha PJ, Porter MA (2010) Communities in multislice voting networks. Chaos 20:041108
Mucha PJ, Richardson T, Macon K, Porter MA, Onnela JP (2010) Community structure in time-dependent, multiscale, and multiplex networks. Science 328:876–878
Palla G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435:814–818
Palmer CR, Steffan JG (2000) Generating network topologies that obey power laws. In: IEEE globecom 2000, pp 33–37
Ronhovde P, Nussinov Z (2009) Multiresolution community detection for megascale networks by information-based replica correlations. Phys Rev E Stat Nonlinear Soft Matter Phys 80:016,109–19658776
Sim K, Li J, Gopalkrishnan V, Liu G (2006) Mining maximal quasi-bicliques to co-clustering stocks and financial ratios for value investment. In: IEEE international conference on data mining, pp 1059–1063
Tarjan RE (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146–160
Traag VA, Bruggeman J (2009) Community detection in networks with positive and negative links. Phys Rev E 80:036115
Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge
Zhang K, Lo D, Lim EP (2010) Mining antagonistic communities from social networks. In: The 14th Pacific-Asia conference on knowledge discovery and data, pp 68–80
Zhang K, Lo D, Lim EP, Prasetyo PK (2013) Mining indirect antagonistic communities from social interactions. Knowl Inf Syst 35(3):553–583
Acknowledgments
This work is supported by the National Basic Research Program (973) of China (No. 2012CB316203) and NSFC under Grant Nos. 61033007, 61103039, 61402177 and 61232002. This work is also supported by the National Research Foundation under its International Research Centre @ Singapore Funding Initiative and administered by the IDM Programme Office, and National Research Foundation (NRF) (NRF2008IDM-IDM004-036). We are grateful to the anonymous reviewers for their valuable and insightful comments. We would also like to thank BuzzCity Pte Ltd for sharing their data set with us.
Author information
Authors and Affiliations
Corresponding author
Additional information
Responsible editor: Charu Aggarwal.
Rights and permissions
About this article
Cite this article
Gao, M., Lim, EP., Lo, D. et al. On detecting maximal quasi antagonistic communities in signed graphs. Data Min Knowl Disc 30, 99–146 (2016). https://doi.org/10.1007/s10618-015-0405-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10618-015-0405-2