Abstract
In social network analysis the identification of communities and the discovery of brokers is a very important issue. Community detection typically uses partition techniques. In this work the information extracted from social networking goes beyond cohesive groups, enabling the discovery of brokers that interact between communities. The partition is found using a set covering formulation, which allows the identification of actors that link two or more dense groups. Our algorithm returns the needed information to create a good visualization of large networks, using a condensed graph with the identification of the brokers.
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
Auber, D., Chiricota, Y., Jourdan, F., Melançon, G.: Multiscale visualization of small world networks. In: Proceedings of the Ninth annual IEEE conference on Information visualization, INFOVIS 2003, Washington, DC, USA, pp. 75–81 (2003)
Burt, R.S.: Structural Holes: The Social Structure of Competition. Harvard University Press (1992)
Cavique, L., Mendes, A.B., Santos, J.M.A.: An Algorithm to Discover the k-Clique Cover in Networks. In: Lopes, L.S., Lau, N., Mariano, P., Rocha, L.M. (eds.) EPIA 2009. LNCS, vol. 5816, pp. 363–373. Springer, Heidelberg (2009)
Cavique, L., Luz, C.J.: A heuristic for the stability number of a graph based on convex quadratic programming and tabu search. Journal of Mathematical Sciences 161(6), 944–955 (2009)
Cavique, L., Rego, C., Themido, I.: Subgraph Ejection Chains and Tabu Search for the Crew Scheduling Problem. Journal of Operational Research Society 50(6), 608–616 (1999)
Cavique, L., Rego, C., Themido, I.: A scatter search algorithm for the maximum clique problem. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Meta-Heuristics, pp. 227–244. Kluwer Academic Pubs., Dordrecht (2002)
Chakrabarti, D., Faloutsos, C.: Graph mining: Laws, generators, and algorithms. ACM Computing Surveys 38(1), 1–69 (2006)
Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4, 233–235 (1979)
Christakis, N., Fowler, J.: Connected: The surprising power of networks and how they shape our lives, Back Bay Books/Little, Brown and Company. Hachette Book Group (2011)
DIMACS: Maximum clique, graph coloring, and satisfiability. Second DIMACS implementation challenge (1995), http://dimacs.rutgers.edu/Challenges/
Derenyi, I., Palla, G., Vicsek, T.: Clique Percolation in Random Networks. Physical Review Letters 94(16), 160202 (2005)
Du, N., Faloutsos, C., Wang, B., Akoglu, L.: Large human communication networks: patterns and a utility-driven generator. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 269–278 (2009)
Dwyer, T., Riche, N.H., Marriott, K., Mears, C.: Edge Compression Techniques for Visualization of Dense Directed Graphs. IEEE Transactions on Visualization and Computer Graphics 19, 2596–2605 (2013)
Easley, D., Kleinberg, J.: Networks, Crowds and Markets: Reasoning About a Highly Connected World. Cambridge University Press (2010)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99(12), 7821–7826 (2002)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
Granovetter, M.: The strength of weak ties. American Journal of Sociology 78, 1360–1380 (1973)
Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and Systems Sciences 9(9), 256–278 (1974)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal 49, 291–307 (1970)
Luce, R.D.: Connectivity and generalized cliques in sociometric group structure. Psychometrika 15, 159–190 (1950)
Nooy, W., Mrvar, A., Batagelj, V.: Exploratory Social Network Analysis with Pajek. Cambridge University Press (2005)
Royer, L., Reimann, M., Andreopoulos, B., Schroeder, M.: Unraveling Protein Networks with Power Graph Analysis, in Berg, Johannes. PLoS Computational Biology 4(7), e1000108 (2008), doi:10.1371/journal.pcbi.1000108
Scott, J.: Social Network Analysis: A Handbook. SAGE Publications Ltd. (2000)
Soriano, P., Gendreau, M.: Tabu search algorithms for the maximum clique. In: Johnson, D.S., Trick, M.A. (eds.) Clique, Coloring and Satisfiability, Second Implementation Challenge DIMACS, pp. 221–242. American Mathematical Society (1996)
Tarawneh, R.M., Keller, P., Ebert, A.: A General Introduction To Graph Visualization Techniques. In: Garth, C., Middel, A., Hagen, H. (eds.) Proceedings of IRTG 1131, Visualization of Large and Unstructured Data Sets Workshop, pp. 151–164 (2011)
Yang, J., Leskovec, J.: Overlapping Community Detection at Scale: A Nonnegative Matrix Factorization. In: ACM International Conference on Web Search and Data Mining (WSDM), pp. 587–596 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Cavique, L., Marques, N.C., Santos, J.M.A. (2014). An Algorithm to Condense Social Networks and Identify Brokers. In: Bazzan, A., Pichara, K. (eds) Advances in Artificial Intelligence -- IBERAMIA 2014. IBERAMIA 2014. Lecture Notes in Computer Science(), vol 8864. Springer, Cham. https://doi.org/10.1007/978-3-319-12027-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-12027-0_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12026-3
Online ISBN: 978-3-319-12027-0
eBook Packages: Computer ScienceComputer Science (R0)