{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,7]],"date-time":"2026-11-07T00:02:09Z","timestamp":1794009729832,"version":"4.8.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319244648","type":"print"},{"value":"9783319244655","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24465-5_16","type":"book-chapter","created":{"date-parts":[[2015,10,13]],"date-time":"2015-10-13T01:17:43Z","timestamp":1444699063000},"page":"181-192","source":"Crossref","is-referenced-by-count":47,"title":["I-Louvain: An Attributed Graph Clustering Method"],"prefix":"10.1007","author":[{"given":"David","family":"Combe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christine","family":"Largeron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mathias","family":"G\u00e9ry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"El\u0151d","family":"Egyed-Zsigmond","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"issue":"5","key":"16_CR1","doi-asserted-by":"publisher","first-page":"053039","DOI":"10.1088\/1367-2630\/10\/5\/053039","volume":"10","author":"A Arenas","year":"2008","unstructured":"Arenas, A., Fern\u00e1ndez, A., G\u00f3mez, S.: Analysis of the structure of complex networks at different resolution levels. New J. Phys. 10(5), 053039 (2008)","journal-title":"New J. Phys."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Aynaud, T., Blondel, V., Guillaume, J.L., Lambiotte, R.: Multilevel local optimization of modularity. In: Graph Partitioning, pp. 315\u2013345. Wiley (2013)","DOI":"10.1002\/9781118601181.ch13"},{"key":"16_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/9781118601181","volume-title":"Graph Partitioning","author":"C Bichot","year":"2013","unstructured":"Bichot, C., Siarry, P.: Graph Partitioning. Wiley, New York (2013)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of community hierarchies in large networks. CoRR abs\/0803.0476 (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"16_CR5","unstructured":"Combe, D.: Detection de communautes dans les reseaux d\u2019information utilisant liens et attributs. In: Ph.D. Thesis, Jean Monnet University, Lyon (2013)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Combe, D., Largeron, C., Egyed-Zsigmond, E., G\u00e9ry, M.: Combining relations and text in scientific network clustering. In: International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 1280\u20131285 (2012)","DOI":"10.1109\/ASONAM.2012.215"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Cruz, J.D., Bothorel, C., Poulet, F.: Entropy based community detection in augmented social networks. In: Computational Aspects of Social Networks (CASoN 2011), pp. 163\u2013168 (2011)","DOI":"10.1109\/CASON.2011.6085937"},{"key":"16_CR8","unstructured":"Dang, T.A.: Analysis of community in social networks. In: Ph.D. Thesis, Paris 13 (2013)"},{"key":"16_CR9","unstructured":"Dang, T.A., Viennet, E.: Community detection based on structural and attribute similarities. In: International Conference on Digital Society (ICDS), pp. 7\u201312 (2012)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Ding, C., He, X., Zha, H., Gu, M.: A min-max cut algorithm for graph partitioning and data clustering. In: ICDM, pp. 107\u2013114 (2001)","DOI":"10.1109\/ICDM.2001.989507"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Elhadi, H., Agam, G.: Structure and attributes community detection: comparative analysis of composite, ensemble and selection methods. In: 7th Workshop on Social Network Mining and Analysis, SNAKDD 2013, pp. 10:1\u201310:7. ACM, New York (2013)","DOI":"10.1145\/2501025.2501034"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Ester, M., Ge, R., Gao, B., Hu, Z., Ben-Moshe, B.: Joint cluster analysis of attribute data and relationship data: the connected k-center problem. In: SIAM International Conference on Data Mining, pp. 25\u201346. ACM Press (2006)","DOI":"10.1137\/1.9781611972764.22"},{"issue":"10","key":"16_CR13","first-page":"1","volume":"3","author":"PO Fj\u00e4llstr\u00f6m","year":"1998","unstructured":"Fj\u00e4llstr\u00f6m, P.O.: Algorithms for graph partitioning: a survey. Science 3(10), 1\u201336 (1998)","journal-title":"Science"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1080\/15427951.2004.10129093","volume":"1","author":"G Flake","year":"2003","unstructured":"Flake, G., Tarjan, R., Tsioutsiouliklis, K.: Graph clustering and minimum cut trees. Internet Math. 1(4), 385\u2013408 (2003)","journal-title":"Internet Math."},{"issue":"3\u20135","key":"16_CR15","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.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1376815.1376816","volume":"2","author":"R Ge","year":"2008","unstructured":"Ge, R., Ester, M., Gao, B.J., Hu, Z., Bhattacharya, B., Ben-Moshe, B.: Joint cluster analysis of attribute data and relationship data. ACM Trans. Knowl. Disc. Data 2(2), 1\u201335 (2008)","journal-title":"ACM Trans. Knowl. Disc. Data"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann, S., Farber, I., Boden, B., Seidl, T.: Subspace clustering meets dense subgraph mining: a synthesis of two paradigms. In: ICDM, pp. 845\u2013850 (2010)","DOI":"10.1109\/ICDM.2010.95"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann, S., Boden, B., Seidl, T.: DB-CSC: a density-based approach for subspace clustering in graphs with feature vectors. In: Machine Learning and Knowledge Discovery in Databases, pp. 565\u2013580 (2011)","DOI":"10.1007\/978-3-642-23780-5_46"},{"issue":"2","key":"16_CR19","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, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"issue":"5","key":"16_CR20","doi-asserted-by":"publisher","first-page":"056117","DOI":"10.1103\/PhysRevE.80.056117","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S.: Community detection algorithms: a comparative analysis. Phys. Rev. E 80(5), 056117 (2009)","journal-title":"Phys. Rev. E"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Li, H., Nie, Z., Lee, W.C.W., Giles, C.L., Wen, J.R.: Scalable community discovery on textual data with relations. In: 17th ACM Conference on Information and Knowledge Management, pp. 1203\u20131212 (2008)","DOI":"10.1145\/1458082.1458241"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Moser, F., Ge, R., Ester, M.: Joint cluster analysis of attribute and relationship data without a-priori specification of the number of clusters. In: 13th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 510\u2013519 (2007)","DOI":"10.1145\/1281192.1281248"},{"issue":"2","key":"16_CR23","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1140\/epjb\/e2004-00124-y","volume":"38","author":"M Newman","year":"2004","unstructured":"Newman, M.: Detecting community structure in networks. Eur. Phys. J. B-Condensed Matter and Complex Systems 38(2), 321\u2013330 (2004)","journal-title":"Eur. Phys. J. B-Condensed Matter and Complex Systems"},{"issue":"23","key":"16_CR24","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"M Newman","year":"2006","unstructured":"Newman, M.: Modularity and community structure in networks. Proc. Nat. Acad. Sci. U.S.A. 103(23), 8577\u20138696 (2006)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"issue":"2","key":"16_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M Newman","year":"2004","unstructured":"Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 1\u201316 (2004)","journal-title":"Phys. Rev. E"},{"issue":"9","key":"16_CR26","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1109\/TKDE.2012.154","volume":"25","author":"A Prado","year":"2013","unstructured":"Prado, A., Plantevit, M., Robardet, C., Boulicaut, J.F.: Mining graph topological patterns: finding covariations among vertex descriptors. IEEE Trans. Knowl. Data Eng. 25(9), 2090\u20132104 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"16_CR27","doi-asserted-by":"publisher","first-page":"016110","DOI":"10.1103\/PhysRevE.74.016110","volume":"74","author":"J Reichardt","year":"2006","unstructured":"Reichardt, J., Bornholdt, S.: Statistical mechanics of community detection. Phys. Rev. E 74(1), 016110 (2006)","journal-title":"Phys. Rev. E"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Satuluri, V., Parthasarathy, S.: Scalable graph clustering using stochastic flows: applications to community discovery. In: 15th SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 737\u2013746 (2009)","DOI":"10.1145\/1557019.1557101"},{"issue":"1","key":"16_CR29","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"S Schaeffer","year":"2007","unstructured":"Schaeffer, S.: Graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007)","journal-title":"Comput. Sci. Rev."},{"issue":"8","key":"16_CR30","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"16_CR31","doi-asserted-by":"publisher","first-page":"76","DOI":"10.4018\/jismd.2013070104","volume":"4","author":"E Stattner","year":"2013","unstructured":"Stattner, E., Collard, M.: From frequent features to frequent social links. Int. J. Inf. Sys. Model. Des. (IJISMD) 4(3), 76\u201398 (2013)","journal-title":"Int. J. Inf. Sys. Model. Des. (IJISMD)"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Steinhaeuser, K., Chawla, N.: Community detection in a large real-world social network. In: Social Computing, Behavioral Modeling, and Prediction, pp. 168\u2013175 (2008)","DOI":"10.1007\/978-0-387-77672-9_19"},{"key":"16_CR33","first-page":"583","volume":"3","author":"A Strehl","year":"2003","unstructured":"Strehl, A., Ghosh, J.: Cluster ensembles - a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3, 583\u2013617 (2003)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"16_CR34","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg Von","year":"2007","unstructured":"Von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Yang, J., McAuley, J.J., Leskovec, J.: Community detection in networks with node attributes. In: ICDM, pp. 1151\u20131156 (2013)","DOI":"10.1109\/ICDM.2013.167"},{"issue":"1","key":"16_CR36","doi-asserted-by":"publisher","first-page":"718","DOI":"10.14778\/1687627.1687709","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.: Graph clustering based on structural\/attribute similarities. VLDB Endowment 2(1), 718\u2013729 (2009)","journal-title":"VLDB Endowment"},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Clustering large attributed graphs: an efficient incremental approach. In: ICDM 2010, pp. 689\u2013698 (2010)","DOI":"10.1109\/ICDM.2010.41"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24465-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T20:32:41Z","timestamp":1748637161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24465-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319244648","9783319244655"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24465-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}