{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T23:15:50Z","timestamp":1776122150829,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,3,17]],"date-time":"2018-03-17T00:00:00Z","timestamp":1521244800000},"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-0497-y","type":"journal-article","created":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T23:15:01Z","timestamp":1521242101000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An efficient method for mining the maximal \u03b1-quasi-clique-community of a given node in complex networks"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6208-3046","authenticated-orcid":false,"given":"Patricia","family":"Conde-Cespedes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Blaise","family":"Ngonmang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Viennet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,17]]},"reference":[{"key":"497_CR1","doi-asserted-by":"crossref","unstructured":"Abello J, Resende MGC, Sudarsky S (2002) Massive quasi-clique detection. In: Proceedings of the 5th Latin American symposium on theoretical informatics, LATIN \u201902. Springer, London, pp 598\u2013612","DOI":"10.1007\/3-540-45995-2_51"},{"key":"497_CR2","unstructured":"Adamic LA, Glance N (2005) The political blogosphere and the 2004 U.S. election. In: Proceedings of the WWW-2005 workshop on the weblogging ecosystem. ACM New York, pp 36\u201343"},{"key":"497_CR3","unstructured":"Akoglu L, Mcglohon M, Faloutsos C (2009) Anomaly detection in large graphs. In: In CMU-CS-09-173 technical report"},{"issue":"1\u20133","key":"497_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y Asahiro","year":"2002","unstructured":"Asahiro Y, Hassin R, Iwama K (2002) Complexity of finding dense subgraphs. Discrete Appl Math 121(1\u20133):15\u201326. https:\/\/doi.org\/10.1016\/S0166-218X(01)00243-8","journal-title":"Discrete Appl Math"},{"key":"497_CR5","doi-asserted-by":"publisher","first-page":"05001","DOI":"10.1088\/1742-5468\/2008\/05\/P05001","volume":"2008","author":"JP Bagrow","year":"2008","unstructured":"Bagrow JP (2008) Evaluating local community methods in networks. J Stat Mech 2008:05001","journal-title":"J Stat Mech"},{"key":"497_CR6","doi-asserted-by":"crossref","unstructured":"Bahmani B, Kumar R, Vassilvitskii S (2012) Densest subgraph in streaming and mapreduce. CoRR abs\/1201.6567. http:\/\/arxiv.org\/abs\/1201.6567","DOI":"10.14778\/2140436.2140442"},{"key":"497_CR7","unstructured":"Battiti R, Mascia F (2007) Reactive local search for maximum clique: a new implementation. Technical report DIT-07-018, Informatica e Telecomunicazioni, University of Trento, Trento, Italy"},{"issue":"4","key":"497_CR8","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s004530010074","volume":"29","author":"R Battiti","year":"2001","unstructured":"Battiti R, Protasi M (2001) Reactive local search for the maximum clique problem. Algorithmica 29(4):610","journal-title":"Algorithmica"},{"issue":"3","key":"497_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A Ben-Dor","year":"1999","unstructured":"Ben-Dor A, Shamir R, Yakhini Z (1999) Clustering gene expression patterns. J Comput Biol 6(3):281\u2013297","journal-title":"J Comput Biol"},{"key":"497_CR10","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008:P10008","journal-title":"J Stat Mech Theory Exp"},{"key":"497_CR11","first-page":"1","volume-title":"Handbook of combinatorial optimization","author":"IM Bomze","year":"1999","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. In: Du D-Z, Pardalos PM (eds) Handbook of combinatorial optimization. Kluwer Academic Publishers, Dordrecht, pp 1\u201374"},{"key":"497_CR12","series-title":"Lecture Notes in Computer Science","first-page":"41","volume-title":"LION","author":"M Brunato","year":"2007","unstructured":"Brunato M, Hoos HH, Battiti R (2007) On effectively finding maximal quasi-cliques in graphs. In: Maniezzo V, Battiti R, Watson JP (eds) LION, vol 5313. Lecture Notes in Computer Science. Springer, Berlin, pp 41\u201355"},{"key":"497_CR13","unstructured":"Campigotto R, Conde-C\u00e9spedes P, Guillaume J (2014) A generalized and adaptive method for community detection. CoRR abs\/1406.2518 http:\/\/arxiv.org\/abs\/1406.2518"},{"issue":"7","key":"497_CR14","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1109\/TKDE.2010.271","volume":"24","author":"J Chen","year":"2012","unstructured":"Chen J, Saad Y (2012) Dense subgraph extraction with application to community detection. IEEE Trans Know Data Eng 24(7):1216\u20131230","journal-title":"IEEE Trans Know Data Eng"},{"key":"497_CR15","doi-asserted-by":"crossref","unstructured":"Chen J, Zaiane OR, Goebel R (2009) Local communities identification in social networks. In: ASONAM, pp 237\u2013242","DOI":"10.1109\/ASONAM.2009.14"},{"key":"497_CR16","first-page":"026132","volume":"72","author":"A Clauset","year":"2005","unstructured":"Clauset A (2005) Finding local community structure in networks. Phys Rev 72:026132","journal-title":"Phys Rev"},{"key":"497_CR17","unstructured":"Conde-C\u00e9spedes P, Marcotorchino J, Viennet E (2015) Comparison of linear modularization criteria using the relational formalism, an approach to easily identify resolution limit. Revue des Nouvelles Technologies de l\u2019Information Extraction et Gestion des Connaissances, RNTI-E-28, pp 203\u2013214"},{"key":"497_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-45763-5_6","volume-title":"Advances in knowledge discovery and management (AKDM-6)","author":"P Conde-C\u00e9spedes","year":"2017","unstructured":"Conde-C\u00e9spedes P, Marcotorchino JF, Viennet E (2017) Comparison of linear modularization criteria using the relational formalism, an approach to easily identify resolution limit. In: Guillet F, Pinaud B, Venturini G (eds) Advances in knowledge discovery and management (AKDM-6). Springer, Cham, pp 101\u2013120"},{"key":"497_CR19","doi-asserted-by":"crossref","unstructured":"Conde-C\u00e9spedes P, Ngonmang B, Viennet E(2015) Approximation of the maximal $$\\alpha $$ \u03b1 -consensus local community detection problem in complex networks. In: IEEE SITIS 2015, complex networks and their applications. Bangkok, Thailand","DOI":"10.1109\/SITIS.2015.108"},{"key":"497_CR20","unstructured":"Condorcet CAMd (1785) Essai sur l\u2019application de l\u2019analyse \u00e0 la probabilit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix. J Math Sociol 1(1): 113\u2013120"},{"key":"497_CR21","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Wang W (2014) Local search of communities in large graphs. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, SIGMOD \u201914. ACM, New York, pp 991\u20131002","DOI":"10.1145\/2588555.2612179"},{"key":"497_CR22","unstructured":"Dang TA, Viennet E (2012) Community detection based on structural and attribute similarities. In: International conference on digital society (ICDS), pp 7\u201314"},{"key":"497_CR23","doi-asserted-by":"crossref","unstructured":"Dang TA, Viennet E (2013) Collaborative filtering in social networks: a community-based approach. In: IEEE ComManTel 2013, international conference on computing, management and telecommunications","DOI":"10.1109\/ComManTel.2013.6482378"},{"key":"497_CR24","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"},{"key":"497_CR25","doi-asserted-by":"crossref","unstructured":"Fortunato S, Barthelemy M (2006) Resolution limit in community detection. In: Proceedings of the National Academy of Sciences of the United States of America","DOI":"10.1073\/pnas.0605965104"},{"issue":"12","key":"497_CR26","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci U. S. A. 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci U. S. A."},{"key":"497_CR27","doi-asserted-by":"publisher","first-page":"205","DOI":"10.2307\/2785673","volume":"20","author":"F Harary","year":"1957","unstructured":"Harary F, Ross IC (1957) A procedure for clique detection using the group matrix. Sociometry 20:205\u2013215","journal-title":"Sociometry"},{"key":"497_CR28","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations, the IBM research symposia series","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations, the IBM research symposia series. Plenum Press, New York, pp 85\u2013103"},{"issue":"1","key":"497_CR29","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3390\/a9010021","volume":"9","author":"C Komusiewicz","year":"2016","unstructured":"Komusiewicz C (2016) Multivariate algorithmics for finding cohesive subnetworks. Algorithms 9(1):21","journal-title":"Algorithms"},{"key":"497_CR30","unstructured":"Krebs V (2004) Books about US politics http:\/\/www.orgnet.com\/"},{"issue":"4","key":"497_CR31","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":"497_CR32","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-1-4419-6045-0_10","volume-title":"Managing and mining graph data, advances in database systems","author":"VE Lee","year":"2010","unstructured":"Lee VE, Ruan N, Jin R, Aggarwal CC (2010) A survey of algorithms for dense subgraph discovery. In: Aggarwal CC, Wang H (eds) Managing and mining graph data, advances in database systems, vol 40. Springer, Berlin, pp 303\u2013336"},{"key":"497_CR33","unstructured":"Liang R, Hua J, Wang X (2012) Vcdanetwork visualization tool based on community detection. In: 2012 12th international conference on control, automation and systems (ICCAS), pp 1221\u20131226"},{"key":"497_CR34","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-87481-2_3","volume-title":"Machine learning and knowledge discovery in databases","author":"G Liu","year":"2008","unstructured":"Liu G, Wong L (2008) Effective pruning techniques for mining quasi-cliques. In: Daelemans W, Goethals B, Morik K (eds) Machine learning and knowledge discovery in databases, vol 5212. Lecture notes in computer science. Springer, Berlin, pp 33\u201349"},{"key":"497_CR35","doi-asserted-by":"crossref","unstructured":"Luo F, Wang JZ, Promislow E (2006) Exploring local community structure in large networks. In: WI\u201906., pp 233\u2013239","DOI":"10.1109\/WI.2006.72"},{"key":"497_CR36","volume-title":"Optimisation en analyse ordinale des donn\u00e9es","author":"F Marcotorchino","year":"1979","unstructured":"Marcotorchino F, Michaud P (1979) Optimisation en analyse ordinale des donn\u00e9es. Masson, Paris"},{"issue":"2","key":"497_CR37","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0304-3975(98)00091-7","volume":"210","author":"H Matsuda","year":"1999","unstructured":"Matsuda H, Ishihara T, Hashimoto A (1999) Classifying molecular sequences using a linkage graph with their pairwise similarities. Theor Comput Sci 210(2):305\u2013325","journal-title":"Theor Comput Sci"},{"issue":"2","key":"497_CR38","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M Newman","year":"2004","unstructured":"Newman M, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113","journal-title":"Phys Rev E"},{"key":"497_CR39","doi-asserted-by":"publisher","DOI":"10.1142\/S012962641240004X","author":"B Ngonmang","year":"2012","unstructured":"Ngonmang B, Tchuente M, Viennet E (2012) Local communities identification in social networks. Parallel Process Lett. https:\/\/doi.org\/10.1142\/S012962641240004X","journal-title":"Parallel Process Lett"},{"key":"497_CR40","doi-asserted-by":"crossref","unstructured":"Ngonmang B, Viennet E, Tchuente M(2012) Churn prediction in a real online social network using local community analysis. In: International conference on advances in social networks analysis and mining, In: ASONAM 2012, Istanbul, Turkey, 26\u201329 August 2012, pp 282\u2013288","DOI":"10.1109\/ASONAM.2012.55"},{"issue":"2","key":"497_CR41","first-page":"183","volume":"15","author":"J Owsi\u0144ski","year":"1986","unstructured":"Owsi\u0144ski J, Zadro\u017cny S (1986) Clustering for ordinal data: a linear programming formulation. Control Cybern 15(2):183\u2013193","journal-title":"Control Cybern"},{"key":"497_CR42","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.dam.2012.07.019","volume":"161","author":"J Pattillo","year":"2013","unstructured":"Pattillo J, Veremyev A, Butenko S, Boginski V (2013) On the maximum quasi-clique problem. Discret Appl Math 161:244\u2013257","journal-title":"Discret Appl Math"},{"issue":"1","key":"497_CR43","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.ejor.2012.10.021","volume":"226","author":"J Pattillo","year":"2013","unstructured":"Pattillo J, Youssef N, Butenko S (2013) On clique relaxation models in network analysis. Eur J Oper Res 226(1):9\u201318","journal-title":"Eur J Oper Res"},{"key":"497_CR44","doi-asserted-by":"crossref","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, pp 228\u2013238","DOI":"10.1145\/1081870.1081898"},{"key":"497_CR45","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1613\/jair.1815","volume":"25","author":"WJ Pullan","year":"2006","unstructured":"Pullan WJ, Hoos HH (2006) Dynamic local search for the maximum clique problem. J Artif Intell Res (JAIR) 25:159\u2013185","journal-title":"J Artif Intell Res (JAIR)"},{"key":"497_CR46","doi-asserted-by":"crossref","unstructured":"Tanay A, Sharan R, Shamir R (202) Discovering statistically significant biclusters in gene expression data. In: Proceedings of ISMB 2002, pp 136\u2013144","DOI":"10.1093\/bioinformatics\/18.suppl_1.S136"},{"key":"497_CR47","doi-asserted-by":"crossref","unstructured":"Tsourakakis C, Bonchi F, Gionis A, Gullo F, Tsiarli M (2013) Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201913. ACM, New York, pp 104\u2013112","DOI":"10.1145\/2487575.2487645"},{"issue":"3","key":"497_CR48","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu Q, Hao JK (2015) A review on algorithms for maximum clique problems. Eur J Oper Res 242(3):693\u2013709","journal-title":"Eur J Oper Res"},{"key":"497_CR49","unstructured":"Yang J, Leskovec J (2014) Overlapping communities explain core-periphery organization of networks. Technical report, Stanford University . http:\/\/ilpubs.stanford.edu:8090\/1103\/"},{"issue":"4","key":"497_CR50","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452\u2013473","journal-title":"J Anthropol Res"},{"key":"497_CR51","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1137\/0112071","volume":"12","author":"C Zahn","year":"1964","unstructured":"Zahn C (1964) Approximating symmetric relations by equivalence relations. SIAM J Appl Math 12:840\u2013847","journal-title":"SIAM J Appl Math"},{"key":"497_CR52","doi-asserted-by":"publisher","unstructured":"Zhang Y, Lin H, Yang Z, Wang J (2016) Construction of dynamic probabilistic protein interaction networks for protein complex identification. BMC Bioinform. https:\/\/doi.org\/10.1186\/s12859-016-1054-1","DOI":"10.1186\/s12859-016-1054-1"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-018-0497-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0497-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-018-0497-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,12]],"date-time":"2019-10-12T21:38:51Z","timestamp":1570916331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-018-0497-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,17]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["497"],"URL":"https:\/\/doi.org\/10.1007\/s13278-018-0497-y","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,17]]},"assertion":[{"value":"30 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"20"}}