{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:43Z","timestamp":1740160303931,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,26]],"date-time":"2018-09-26T00:00:00Z","timestamp":1537920000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s13278-018-0538-6","type":"journal-article","created":{"date-parts":[[2018,9,26]],"date-time":"2018-09-26T17:47:16Z","timestamp":1537984036000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A data reduction approach using hypergraphs to visualize communities and brokers in social networks"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5590-1493","authenticated-orcid":false,"given":"Lu\u00eds","family":"Cavique","sequence":"first","affiliation":[]},{"given":"Nuno C.","family":"Marques","sequence":"additional","affiliation":[]},{"given":"Ant\u00f3nio","family":"Gon\u00e7alves","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,26]]},"reference":[{"key":"538_CR1","series-title":"LNCS","first-page":"598","volume-title":"Proceedings of the Latin-American symposium on theoretical informatics","author":"J Abello","year":"2002","unstructured":"Abello J, Resende M, Sudarsky S (2002) Massive quasi-clique detection. In: Rajsbaum S (ed) Proceedings of the Latin-American symposium on theoretical informatics, LNCS, vol 2286. Springer, Heidelberg, pp\u00a0598\u2013612"},{"key":"538_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Lin S, Yu PS (2012) On influential node discovery in dynamic social networks. In: Proceedings of the twelfth SIAM international conference on data mining, SDM conference, pp\u00a0636\u2013647","DOI":"10.1137\/1.9781611972825.55"},{"key":"538_CR3","doi-asserted-by":"crossref","unstructured":"Araujo M, Gunnemann S, Mateos G, Faloutsos C (2014) Beyond blocks: hyperbolic community detection. In: Proceedings of the European conference on machine learning and principles and practice of knowledge discovery in databases (ECML PKDD), Nancy, France","DOI":"10.1007\/978-3-662-44848-9_4"},{"key":"538_CR4","volume-title":"Network science","author":"A-L Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si A-L (2016) Network science. Cambridge University Press, Cambridge"},{"key":"538_CR5","unstructured":"Batagelj V, Mrvar A (2006) Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/ . Accessed Aug 2018"},{"key":"538_CR6","volume-title":"Graphes et hypergraphes","author":"C Berge","year":"1970","unstructured":"Berge C (1970) Graphes et hypergraphes. Dunod, Paris"},{"issue":"2","key":"538_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10732-013-9235-9","volume":"20","author":"N Bilal","year":"2014","unstructured":"Bilal N, Galinier P, Guibault F (2014) An iterated-tabu-search heuristic for a variant of the partial set covering problem. J Heuristics 20(2):143\u2013164. https:\/\/doi.org\/10.1007\/s10732-013-9235-9","journal-title":"J Heuristics"},{"key":"538_CR8","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp. https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","journal-title":"J Stat Mech Theory Exp"},{"key":"538_CR9","volume-title":"UCINET for Windows: software for social network analysis","author":"S Borgatti","year":"2002","unstructured":"Borgatti S, Everett M, Freeman L (2002) UCINET for Windows: software for social network analysis. Analytic Technologies, Harvard. MA"},{"key":"538_CR10","doi-asserted-by":"publisher","unstructured":"Bourqui R, Mary P, Auber D (2007) How to draw clusteredweighted graphs using a multilevel force-directed graph drawing algorithm. In: 11th international conference information visualization\u2014supplements (IV '07)(IV), Zurich, Switzerland, 2007, pp 757\u2013764. https:\/\/doi.org\/10.1109\/IV.2007.65","DOI":"10.1109\/IV.2007.65"},{"key":"538_CR11","volume-title":"Learning and intelligent optimization, LION 2007. Lecture notes in computer science","author":"M Brunato","year":"2008","unstructured":"Brunato M, Hoos HH, Battiti R (2008) On effectively finding maximal quasi-cliques in graphs. In: Maniezzo V, Battiti R, Watson JP (eds) Learning and intelligent optimization, LION 2007. Lecture notes in computer science, vol\u00a05313. Springer, Berlin"},{"key":"538_CR12","doi-asserted-by":"crossref","DOI":"10.4159\/9780674029095","volume-title":"Structural holes: the social structure of competition","author":"RS Burt","year":"1992","unstructured":"Burt RS (1992) Structural holes: the social structure of competition. Harvard University Press, Cambridge"},{"key":"538_CR13","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780199249145.001.0001","volume-title":"Brokerage and closure: an introduction to social capital","author":"RS Burt","year":"2005","unstructured":"Burt RS (2005) Brokerage and closure: an introduction to social capital. Oxford University Press, New York"},{"issue":"6","key":"538_CR14","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1007\/s10958-009-9613-x","volume":"161","author":"L Cavique","year":"2009","unstructured":"Cavique L, Luz CJ (2009) A heuristic for the stability number of a graph based on convex quadratic programming and tabu search. J Math Sci 161(6):944\u2013955","journal-title":"J Math Sci"},{"key":"538_CR15","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-1-4615-1507-4_11","volume-title":"Essays and surveys in meta-heuristics","author":"L Cavique","year":"2002","unstructured":"Cavique L, Rego C, Themido I (2002) A scatter search algorithm for the maximum clique problem. In: Ribeiro C, e Hansen P (eds) Essays and surveys in meta-heuristics. Kluwer Academic Publishers, Dordrecht, pp\u00a0227\u2013244"},{"key":"538_CR16","first-page":"363","volume-title":"Progress in artificial intelligence. EPIA 2009. LNAI","author":"L Cavique","year":"2009","unstructured":"Cavique L, Mendes AB, Santos JMA (2009) An algorithm to discover the k-clique cover in networks. In: Seabra Lopes L et al (eds) Progress in artificial intelligence. EPIA 2009. LNAI, vol 5816, Springer, Berlin, pp\u00a0363\u2013373"},{"key":"538_CR17","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1142\/9789814407724_0020","volume-title":"Quantitative modelling in marketing and management","author":"L Cavique","year":"2012","unstructured":"Cavique L, Mendes AB, Santos JMA (2012) Clique communities in social networks. In: Moutinho L, Huarng K-H (eds) Quantitative modelling in marketing and management. World Scientific Publisher, Singapore, pp\u00a0469\u2013490"},{"key":"538_CR18","isbn-type":"print","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-319-12027-0_27","volume-title":"An algorithm to condensed social networks and identify brokers, advances in artificial intelligence, IBERAMIA. Lecture notes in computer science","author":"L Cavique","year":"2014","unstructured":"Cavique L, Marques NC, Santos JMA (2014) An algorithm to condensed social networks and identify brokers, advances in artificial intelligence, IBERAMIA. Lecture notes in computer science, vol 8864. Springer, Berlin, pp\u00a0331\u2013343. ISBN:978-3-319-12026-3","ISBN":"https:\/\/id.crossref.org\/isbn\/9783319120263"},{"issue":"5","key":"538_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF02025297","volume":"43","author":"N Christofides","year":"1993","unstructured":"Christofides N, Paix\u00e3o J (1993) Algorithms for large scale set covering problems. Ann Oper Res 43(5):259\u2013277","journal-title":"Ann Oper Res"},{"key":"538_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4:233\u2013235","journal-title":"Math Oper Res"},{"issue":"1","key":"538_CR21","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/2542182.2542193","volume":"5","author":"JD Cruz","year":"2014","unstructured":"Cruz JD, Bothorel C, Poulet F (2014) Community detection and visualization in social networks: integrating structural and semantic information. ACM Trans Intell Syst Technol 5(1):11. https:\/\/doi.org\/10.1145\/2542182.2542193","journal-title":"ACM Trans Intell Syst Technol"},{"issue":"16","key":"538_CR22","doi-asserted-by":"publisher","first-page":"160202","DOI":"10.1103\/PhysRevLett.94.160202","volume":"94","author":"I Derenyi","year":"2005","unstructured":"Derenyi I, Palla G, Vicsek T (2005) Clique percolation in random networks. Phys Rev Lett 94(16):160202","journal-title":"Phys Rev Lett"},{"issue":"1","key":"538_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.ins.2013.09.048","volume":"260","author":"W Didimo","year":"2014","unstructured":"Didimo W, Montecchiani F (2014) Fast layout computation of clustered networks: algorithmic advances and experimental analysis. Inf Sci 260(1):185\u2013199","journal-title":"Inf Sci"},{"key":"538_CR24","unstructured":"DIMACS (1995) Maximum clique, graph coloring, and satisfiability, Second DIMACS implementation challenge. http:\/\/dimacs.rutgers.edu\/Challenges\/ . Accessed Aug 2018"},{"key":"538_CR25","first-page":"101","volume-title":"Graph drawing. Lecture notes in computer science","author":"P Eades","year":"1997","unstructured":"Eades P, Feng Q-W (1997) Multilevel visualization of clustered graphs. In: North S (ed) Graph drawing. Lecture notes in computer science, vol\u00a01190. Springer, Berlin, pp\u00a0101\u2013112"},{"issue":"3","key":"538_CR26","doi-asserted-by":"publisher","first-page":"157","DOI":"10.7155\/jgaa.00029","volume":"4","author":"P Eades","year":"2000","unstructured":"Eades P, Huang ML (2000) Navigating clustered graphs using force-directed methods. J Graph Algorithms Appl 4(3):157\u2013181","journal-title":"J Graph Algorithms Appl"},{"key":"538_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942","volume-title":"Networks, crowds and markets: reasoning about a highly connected world","author":"D Easley","year":"2010","unstructured":"Easley D, Kleinberg J (2010) Networks, crowds and markets: reasoning about a highly connected world. Cambridge University Press, Cambridge"},{"key":"538_CR28","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erdos","year":"1959","unstructured":"Erdos P, Renyi A (1959) On random graphs. I. Publicationes Mathematicae 6:290\u2013297","journal-title":"Publicationes Mathematicae"},{"issue":"6","key":"538_CR29","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"key":"538_CR30","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486:75\u2013174","journal-title":"Phys Rep"},{"issue":"12","key":"538_CR31","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci USA"},{"key":"538_CR32","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"M Granovetter","year":"1973","unstructured":"Granovetter M (1973) The strength of weak ties. Am J Sociol 78:1360\u20131380","journal-title":"Am J Sociol"},{"key":"538_CR33","unstructured":"Grossman J, Ion P, Castro RD (2007) The Erdos number project. http:\/\/www.oakland.edu\/enp\/ . Accessed Aug 2018"},{"key":"538_CR34","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F Harary","year":"1969","unstructured":"Harary F (1969) Graph theory. Addison-Wesley Publishing Company, Boston"},{"key":"538_CR35","volume-title":"An efficient matlab algorithm for graph partitioning","author":"JP Hespanha","year":"2004","unstructured":"Hespanha JP (2004) An efficient matlab algorithm for graph partitioning. Department of Electrical and Computer Engineering, University of California, Santa Barbara"},{"key":"538_CR36","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson DS (1974) Approximation algorithms for combinatorial problems. J Comput Syst Sci 9:256\u2013278","journal-title":"J Comput Syst Sci"},{"key":"538_CR37","doi-asserted-by":"crossref","unstructured":"Kang U, Faloutsos C (2011) Beyond \u2018caveman communities\u2019: hubs and spokes for graph compression and mining. In: Proceedings of the 11th IEEE international conference on data mining (ICDM), Vancouver, Canada, pp\u00a0300\u2013309","DOI":"10.1109\/ICDM.2011.26"},{"key":"538_CR38","doi-asserted-by":"crossref","unstructured":"Karypis G, Kumar V (1999) Multilevel k-way hypergraph partitioning. In: Proceedings of the IEEE 36th conference on design automation conference (DAC), New Orleans, LA, USA","DOI":"10.1145\/309847.309954"},{"key":"538_CR39","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49:291\u2013307","journal-title":"Bell Syst Tech J"},{"issue":"4","key":"538_CR40","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110","journal-title":"Phys Rev E"},{"key":"538_CR41","unstructured":"Li W, Takatsuka M (2004) Adding filtering to geometric distortion to visualize a clustered graph on small screens. In: Proceedings of the Australasian symposium on information visualisation (APVis\u201904), vol\u00a035. Australian Computer Society, Brisbane, pp\u00a071\u201379"},{"issue":"1","key":"538_CR42","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s13278-018-0491-4","volume":"8","author":"Y Liu","year":"2018","unstructured":"Liu Y, Safavi T, Shah N, Koutra D (2018) Reducing large graphs to small supergraphs: a unified approach. Soc Netw Anal Min 8(1):17. https:\/\/doi.org\/10.1007\/s13278-018-0491-4","journal-title":"Soc Netw Anal Min"},{"key":"538_CR43","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1186\/1472-6963-13-158","volume":"13","author":"JC Long","year":"2013","unstructured":"Long JC, Cunningham FC, Braithwaite J (2013) Bridges, brokers and boundary spanners in collaborative networks: a systematic review. BMC Health Serv Res 13:158","journal-title":"BMC Health Serv Res"},{"key":"538_CR44","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF02289199","volume":"15","author":"RD Luce","year":"1950","unstructured":"Luce RD (1950) Connectivity and generalized cliques in sociometric group structure. Psychometrika 15:159\u2013190","journal-title":"Psychometrika"},{"issue":"1","key":"538_CR45","first-page":"60","volume":"1","author":"S Milgram","year":"1967","unstructured":"Milgram S (1967) The small world problem. Psychol Today 1(1):60\u201367","journal-title":"Psychol Today"},{"key":"538_CR46","volume-title":"Who shall survive?","author":"JL Moreno","year":"1934","unstructured":"Moreno JL (1934) Who shall survive? Nervous and Mental Disease Publishing Company, Washington, DC"},{"key":"538_CR47","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman MEJ (2010) Networks: an introduction. Oxford University Press, Oxford"},{"key":"538_CR48","doi-asserted-by":"publisher","unstructured":"Pei J, Jiang D, Zhang A (2005) On mining cross-graph quasi-cliques. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining (KDD \u201905). ACM, New York, NY, USA, pp 228\u2013238. https:\/\/doi.org\/10.1145\/1081870.1081898","DOI":"10.1145\/1081870.1081898"},{"key":"538_CR49","volume-title":"NEGOPY 4.30 manual and users\u2019s guide","author":"WD Richards","year":"1995","unstructured":"Richards WD (1995) NEGOPY 4.30 manual and users\u2019s guide. School of Communication Simon Fraser University, Burnaby"},{"key":"538_CR50","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(81)90017-4","volume":"3","author":"WD Richards","year":"1981","unstructured":"Richards WD, Rice RE (1981) NEGOPY network analysis program. Soc Netw 3:215\u2013223","journal-title":"Soc Netw"},{"key":"538_CR51","volume-title":"Communication networks: toward a new paradigm for research","author":"EM Rogers","year":"1981","unstructured":"Rogers EM, Kincaid DL (1981) Communication networks: toward a new paradigm for research. Free Press, New York"},{"key":"538_CR52","volume-title":"Social network analysis: handbook","author":"J Scott","year":"1991","unstructured":"Scott J (1991) Social network analysis: handbook. SAGE Publications Ltd, Thousand Oaks"},{"key":"538_CR53","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1090\/dimacs\/026\/12","volume-title":"Clique, coloring and satisfiability, second implementation challenge DIMACS","author":"P Soriano","year":"1996","unstructured":"Soriano P, Gendreau M (1996) Tabu search algorithms for the maximum clique. In: Johnson DS, Trick MA (eds) Clique, coloring and satisfiability, second implementation challenge DIMACS. American Mathematical Society, Providence, pp\u00a0221\u2013242"},{"key":"538_CR54","volume-title":"Social network analysis: methods and applications","author":"S Wasserman","year":"1995","unstructured":"Wasserman S, Faust K (1995) Social network analysis: methods and applications. Cambridge University Press, Cambridge"},{"issue":"6684","key":"538_CR55","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of small-world networks. Nature 393(6684):409\u2013410","journal-title":"Nature"},{"key":"538_CR56","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2013) Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceeding of the 6th ACM international conference on web search and data mining (WSDM), ACM, New York","DOI":"10.1145\/2433396.2433471"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-018-0538-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0538-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0538-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T20:04:44Z","timestamp":1720641884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-018-0538-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,26]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["538"],"URL":"https:\/\/doi.org\/10.1007\/s13278-018-0538-6","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2018,9,26]]},"assertion":[{"value":"6 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"60"}}