{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:43:31Z","timestamp":1773319411898,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T00:00:00Z","timestamp":1366156800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10115-013-0644-8","type":"journal-article","created":{"date-parts":[[2013,4,16]],"date-time":"2013-04-16T05:35:01Z","timestamp":1366090501000},"page":"455-488","source":"Crossref","is-referenced-by-count":28,"title":["Dual modularity optimization for detecting overlapping communities in bipartite networks"],"prefix":"10.1007","volume":"40","author":[{"given":"Fatiha","family":"Souam","sequence":"first","affiliation":[]},{"given":"Ali","family":"A\u00eftelhadj","sequence":"additional","affiliation":[]},{"given":"Riadh","family":"Baba-Ali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,17]]},"reference":[{"issue":"1","key":"644_CR1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10115-011-0421-5","volume":"32","author":"A A\u00eftelhadj","year":"2012","unstructured":"A\u00eftelhadj A, Boughanem M, Mezghiche M, Souam F (2012) Using structural similarity for clustering XML documents. Knowl Inf Syst 32(1):109\u2013139","journal-title":"Knowl Inf Syst"},{"key":"644_CR2","unstructured":"Baumes J, Goldberg M, Magdon-Ismail M (2005) Efficient identification of overlapping communities. In: Proceeding of the IEEE international conference on intelligence and security informatics ISI 2005. LNCS, vol 3495. Springer, Heidelberg, pp 27\u201336. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary? doi: 10.1007\/11427995-3"},{"key":"644_CR3","doi-asserted-by":"crossref","unstructured":"Barber MJ (2007) Modularity and community detection in bipartite network. Phys Rev E 76(6):066102. http:\/\/arxiv.org\/abs\/0707.1616","DOI":"10.1103\/PhysRevE.76.066102"},{"key":"644_CR4","unstructured":"Bourqui R, Auber D (2009) Analysis of 4-connected components decomposition for graph visualization. Technical Report, LaBRI. http:\/\/www.labri.fr\/"},{"key":"644_CR5","doi-asserted-by":"crossref","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech P10008. http:\/\/arxiv.org\/abs\/0803.0476v2","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"644_CR6","doi-asserted-by":"crossref","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70:066111 (6 pp). doi: 10.1103\/PhysRevE.70.066111","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"644_CR7","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1038\/nature06830","volume":"453","author":"A Clauset","year":"2008","unstructured":"Clauset A, Moore C, Newman MEJ (2008) Hierarchical structure and the prediction of missing links in networks. Nature 453:98\u2013101","journal-title":"Nature"},{"key":"644_CR8","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1063\/1.2008598","volume":"779","author":"L Donetti","year":"2005","unstructured":"Donetti L, Munoz MA (2005) Improved spectral algorithm for the detection of network communities. Model Cooperative Behav Soc Sci 779:104\u2013107","journal-title":"Model Cooperative Behav Soc Sci"},{"key":"644_CR9","doi-asserted-by":"crossref","unstructured":"Du N, Wu B, Wang B, Wang Y (2008) Overlapping community detection in bipartite networks. In: Proceedings of the international conference on Web intelligence and intelligent agent technology, 2008. WI-IAT \u201908, IEEE\/WIC\/ACM, vol 1, pp 176\u2013179. http:\/\/arxiv.org\/abs\/0804.3636","DOI":"10.1109\/WIIAT.2008.98"},{"key":"644_CR10","doi-asserted-by":"crossref","unstructured":"Evans TS, Lambiotte R (2009) Line graphs, link partitions and overlapping communities. Phys Rev E 80:016105. http:\/\/arxiv.org\/abs\/0903.2181v2","DOI":"10.1103\/PhysRevE.80.016105"},{"key":"644_CR11","doi-asserted-by":"crossref","unstructured":"Fortunato S (2010) Community detection in graphs. arXiv: 0906.0612v2 [physics.soc- ph]. Phys Rep 486(3\u20135):75\u2013174. http:\/\/arxiv.org\/abs\/0906.0612","DOI":"10.1016\/j.physrep.2009.11.002"},{"issue":"5","key":"644_CR12","doi-asserted-by":"crossref","first-page":"056104","DOI":"10.1103\/PhysRevE.70.056104","volume":"70","author":"S Fortunato","year":"2004","unstructured":"Fortunato S, Latora V, Marchior M (2004) Method to find community structures based on information centrality. Phys Rev E 70(5):056104","journal-title":"Phys Rev E"},{"key":"644_CR13","doi-asserted-by":"crossref","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. In: Proceedings of the national academy of science (PNAS), USA, vol 99, pp 7821\u20137826","DOI":"10.1073\/pnas.122653799"},{"key":"644_CR14","doi-asserted-by":"crossref","unstructured":"Gregory S (2008) A fast algorithm to find overlapping communities in networks. In: Proceedings of the 12th European conference on principles and practice of knowledge discovery in databases (PKDD 2008). ISBN 978-3-540-87478-2, pp 408\u2013423","DOI":"10.1007\/978-3-540-87479-9_45"},{"key":"644_CR15","doi-asserted-by":"crossref","unstructured":"Gregory S (2009) Finding overlapping communities using disjoint community detection algorithms. In: Complex networks: results of the 1st international workshop on complex networks (CompleNet 2009), vol 207, Issue: 5, Publisher: Springer, Berlin, pp 47\u201361","DOI":"10.1007\/978-3-642-01206-8_5"},{"key":"644_CR16","doi-asserted-by":"crossref","unstructured":"Gregory S (2010) Finding overlapping communities in networks by label propagation. New J Phys 12:103018. http:\/\/arxiv.org\/abs\/0910.5516v3","DOI":"10.1088\/1367-2630\/12\/10\/103018"},{"key":"644_CR17","doi-asserted-by":"crossref","unstructured":"Guimera R, Sales-Pardo M, Amaral LAN (2007) Module identification in bipartite and directed networks. Phys Rev E 76(3):036102. doi: 10.1103\/PhysRevE.76.036102","DOI":"10.1103\/PhysRevE.76.036102"},{"key":"644_CR18","doi-asserted-by":"crossref","unstructured":"Guimera R, Nunes Amaral LA (2005) Functional cartography of complex metabolic networks. Nature 433:895\u2013900. http:\/\/arxiv.org\/abs\/q-bio\/0502035","DOI":"10.1038\/nature03288"},{"issue":"1","key":"644_CR19","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/TEVC.2006.877146","volume":"11","author":"J Handl","year":"2007","unstructured":"Handl J, Knowles J (2007) An evolutionary approach to multiobjective clustering. IEEE Trans Evol Comput 11(1):56\u201376","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"644_CR20","doi-asserted-by":"crossref","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(2):291\u2013308","journal-title":"Bell Syst Tech J"},{"key":"644_CR21","doi-asserted-by":"crossref","unstructured":"Kong X, Yu P (2011) gMLC: a multi-label feature selection framework for graph classification. Knowl Inf Syst (published online 8 mai 2011)","DOI":"10.1007\/s10115-011-0407-3"},{"issue":"3","key":"644_CR22","doi-asserted-by":"crossref","first-page":"033015","DOI":"10.1088\/1367-2630\/11\/3\/033015","volume":"11","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S, Kertesz J (2009) Detecting the overlapping and hierarchical community structure in complex networks. New J Phys 11(3):033015","journal-title":"New J Phys"},{"key":"644_CR23","unstructured":"Lipczak M, Milios E (2009) Agglomerative genetic algorithm for clustering in social networks genetic and evolutionary computation. In: Proceedings of the 11th annual conference on genetic and evolutionary computation, GECCO 2009 Montral Canada, pp 1243\u20131250"},{"key":"644_CR24","doi-asserted-by":"crossref","unstructured":"Liu X, Murata T (2009) Community detection in large-scale bipartite networks. In: Proceedings of the IEEE\/WIC\/ACM international joint conference on Web intelligence and intelligent agent technology, pp 50\u201357","DOI":"10.1109\/WI-IAT.2009.15"},{"key":"644_CR25","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10115-009-0255-6","volume":"24","author":"B Long","year":"2010","unstructured":"Long B, Zhang Z, Yu P (2010) A general framework for relation graph clustering. Knowl Inf Syst 24:393\u2013413","journal-title":"Knowl Inf Syst"},{"key":"644_CR26","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54:396\u2013405","journal-title":"Behav Ecol Sociobiol"},{"key":"644_CR27","doi-asserted-by":"crossref","unstructured":"Mancoridis S, Mitchell BS, Rorres C, Chen Y, Gansner ER (1998) Using automatic clustering to produce high-level system organizations of source code. In: IEEE proceedings of the international on workshop on program understanding (IWPC\u201998), pp 45\u201353","DOI":"10.1109\/WPC.1998.693283"},{"key":"644_CR28","doi-asserted-by":"crossref","unstructured":"Narasimhamurthy A, Greene D, Hurley N, Cunningham P (2010) Partitioning large networks without breaking communities. Knowl Inf Syst 25:345\u2013369","DOI":"10.1007\/s10115-009-0251-x"},{"key":"644_CR29","doi-asserted-by":"crossref","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113. http:\/\/arxiv.org\/abs\/cond-mat\/0308217","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"644_CR30","doi-asserted-by":"crossref","unstructured":"Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74:036104. http:\/\/arxiv.org\/abs\/physics\/0605087v3","DOI":"10.1103\/PhysRevE.74.036104"},{"issue":"6","key":"644_CR31","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):066133","journal-title":"Phys Rev E"},{"key":"644_CR32","doi-asserted-by":"crossref","unstructured":"Pizzuti C (2008) Ga-net: a genetic algorithm for community detection in social networks. In: PPSN, volume 5199 of Lecture Notes in Computer Science, Springer, Berlin, pp 1081\u20131090","DOI":"10.1007\/978-3-540-87700-4_107"},{"issue":"2","key":"644_CR33","doi-asserted-by":"crossref","first-page":"191","DOI":"10.7155\/jgaa.00124","volume":"10","author":"P Pons","year":"2006","unstructured":"Pons P, Latapy M (2006) Computing communities in large networks using random walks. J Graph Algorithms Appl 10(2):191\u2013218","journal-title":"J Graph Algorithms Appl"},{"issue":"3","key":"644_CR34","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen A, Simon HD, Liou K-P (1990) Partitioning sparse matrices with eigenvectors of graphs. SIAM J Matrix Anal Appl 11(3):430\u2013452","journal-title":"SIAM J Matrix Anal Appl"},{"key":"644_CR35","doi-asserted-by":"crossref","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76:036106. http:\/\/arxiv.org\/abs\/0709.2938","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"644_CR36","unstructured":"Tasgin M, Bingol H (2006) Community detection in complex networks using genetic. In: Procedings of the European conference on complex systems, (ECCS). http:\/\/arxiv.org\/abs\/0711.0491"},{"key":"644_CR37","unstructured":"Wakita K, Tsurumi T (2007) Finding community structure in a mega-scale social networking service. In: Proceedings of the international conference on WWW\/Internet 2007 IADIS\u20192007, pp 153\u2013162"},{"key":"644_CR38","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393:440\u2013442","journal-title":"Nature"},{"key":"644_CR39","unstructured":"Xiaofeng HZ, He X, Ding C, Simon H, Gu M (2001) Bipartite graph partitioning and data clustering. In: Proceedings of the tenth international conference on information and, knowledge management CIKM\u20190, pp 25\u201332"},{"key":"644_CR40","doi-asserted-by":"crossref","unstructured":"Xu X, Yuruk N, Feng Z, Schweiger TA (2007) SCAN: a structural clustering algorithm for networks. In: 13th international conference on knowledge discovery and data mining, KDD 2007, pp 824\u2013833","DOI":"10.1145\/1281192.1281280"},{"key":"644_CR41","unstructured":"Weihua Z, Zhongzhi Z, Jihong G, Shuigeng Z (2011) Evolutionary method for finding communities in bipartite networks. [Physics.data.an] http:\/\/arxiv.org\/abs\/1011.3315v3"},{"issue":"1","key":"644_CR42","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/j.physa.2006.07.023","volume":"374","author":"S Zhang","year":"2007","unstructured":"Zhang S, Wang R, Zhang X (2007) Identification of overlapping community structure in complex networks using fuzzy C-means clustering. Physica A 374(1):483\u2013490","journal-title":"Physica A"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0644-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0644-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0644-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T12:29:03Z","timestamp":1562934543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0644-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,17]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["644"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0644-8","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,17]]}}}