{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:49:33Z","timestamp":1763459373295,"version":"3.45.0"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,11,19]],"date-time":"2017-11-19T00:00:00Z","timestamp":1511049600000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"crossref","award":["W911NF- 12-1-0034"],"award-info":[{"award-number":["W911NF- 12-1-0034"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"crossref","award":["FA9550-10-1-0569"],"award-info":[{"award-number":["FA9550-10-1-0569"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["SMA-1360058 and CIF-1217605"],"award-info":[{"award-number":["SMA-1360058 and CIF-1217605"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2017,5,31]]},"abstract":"<jats:p>Real-world networks are often organized as modules or communities of similar nodes that serve as functional units. These networks are also rich in content, with nodes having distinguished features or attributes. In order to discover a network\u2019s modular structure, it is necessary to take into account not only its links but also node attributes. We describe an information-theoretic method that identifies modules by compressing descriptions of information flow on a network. Our formulation introduces node content into the description of information flow, which we then minimize to discover groups of nodes with similar attributes that also tend to trap the flow of information. The method is conceptually simple and does not require ad-hoc parameters to specify the number of modules or to control the relative contribution of links and node attributes to network structure. We apply the proposed method to partition real-world networks with known community structure. We demonstrate that adding node attributes helps recover the underlying community structure in content-rich networks more effectively than using links alone. In addition, we show that our method is faster and more accurate than alternative state-of-the-art algorithms.<\/jats:p>","DOI":"10.1145\/2968451","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T09:01:46Z","timestamp":1479718906000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Partitioning Networks with Node Attributes by Compressing Information Flow"],"prefix":"10.1145","volume":"11","author":[{"given":"Laura M.","family":"Smith","sequence":"first","affiliation":[{"name":"California State University, Fullerton, CA"}]},{"given":"Linhong","family":"Zhu","sequence":"additional","affiliation":[{"name":"University of Southern California, Marina del Rey, CA"}]},{"given":"Kristina","family":"Lerman","sequence":"additional","affiliation":[{"name":"University of Southern California, Marina del Rey, CA"}]},{"given":"Allon G.","family":"Percus","sequence":"additional","affiliation":[{"name":"Claremont Graduate University, Claremont, CA"}]}],"member":"320","published-online":{"date-parts":[[2016,11,19]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"PICS: Parameter-free identification of cohesive subgroups in large attributed graphs","author":"Akoglu L.","year":"2012","unstructured":"L. Akoglu, H. Tong, B. Meeder, and C. Faloutsos. 2012. PICS: Parameter-free identification of cohesive subgroups in large attributed graphs. In SDM. SIAM, 439--450."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asr053"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","unstructured":"T.-S. Chua J. Tang R. Hong H. Li Z. Luo and Yan-Tao. Zheng. 2009. NUS-WIDE: A real-world web image database from national university of Singapore. In CIVR. 10.1145\/1646396.1646452","DOI":"10.1145\/1646396.1646452"},{"key":"e_1_2_1_6_1","volume-title":"Spectral Graph Theory. CBMS Regional Conference Series in Mathematics","volume":"92","author":"Chung F. R. K.","year":"1996","unstructured":"F. R. K. Chung. 1996. Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, Vol. 92. American Mathematical Society. http:\/\/www.amazon.com\/exec\/obidos\/redirect?tag&equals;citeulike07-208path&equals;ASIN\/0821803158."},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"J. D. Cruz C. Bothorel and F. Poulet. 2011. Entropy based community detection in augmented social networks. In CASoN. IEEE 163--168.","DOI":"10.1109\/CASON.2011.6085937"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-014-0733-5"},{"key":"e_1_2_1_9_1","volume-title":"Community detection in graphs. Phys. Rep. 486 (Jan","author":"Fortunato S.","year":"2010","unstructured":"S. Fortunato. 2010. Community detection in graphs. Phys. Rep. 486 (Jan. 2010), 75--174."},{"volume-title":"2013 IEEE 13th International Conference on Data Mining. 231--240","author":"G\u00fcnnemann S.","key":"e_1_2_1_10_1","unstructured":"S. G\u00fcnnemann, I. F\u00e4rber, S. Raubach, and T. Seidl. 2013. Spectral subspace clustering for graphs with feature vectors. In 2013 IEEE 13th International Conference on Data Mining. 231--240."},{"key":"e_1_2_1_11_1","volume-title":"HCDF: A hybrid community discovery framework. In SDM. 754--7--65.","author":"Henderson K.","year":"2010","unstructured":"K. Henderson, T. Eliassi-Rad, S. Papadimitriou, and C. Faloutsos. 2010. HCDF: A hybrid community discovery framework. In SDM. 754--7--65."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1869912"},{"key":"e_1_2_1_13_1","first-page":"9","article-title":"A method for the construction of minimum-redundancy codes","volume":"40","author":"Huffman D. A.","year":"1952","unstructured":"D. A. Huffman. 1952. A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Eng. 40, 9 (September 1952), 1098--1101.","journal-title":"Proc. Inst. Radio Eng."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","unstructured":"M. J. Huiskes and M. S. Lew. 2008. The MIR flickr retrieval evaluation. In MIR. 10.1145\/1460096.1460104","DOI":"10.1145\/1460096.1460104"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62234"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143918"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","unstructured":"J. McAuley and J. Leskovec. 2012. Learning to discover social circles in ego networks. NIPS (2012).","DOI":"10.5555\/2999134.2999195"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","unstructured":"J. McAuley and J. Leskovec. 2012. In ECCV (4) (Lecture Notes in Computer Science). Springer 828--841. 10.1007\/978-3-642-33765-9_59","DOI":"10.1007\/978-3-642-33765-9_59"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"volume-title":"Proceedings of the SIAM International Conference on Data Mining. 593--604","author":"Moser F.","key":"e_1_2_1_20_1","unstructured":"F. Moser, R. Colak, A. Rafiey, and M. Ester. 2009. Mining cohesive patterns from graphs with feature vectors. In Proceedings of the SIAM International Conference on Data Mining. 593--604."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","unstructured":"G.-J. Qi C. C. Aggarwal and T. S. Huang. 2012. Community detection with edge content in social media networks. In ICDE. 534--545. 10.1109\/ICDE.2012.77","DOI":"10.1109\/ICDE.2012.77"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"E. Ravasz A. L. Somera D. A. Mongru Z. N. Oltvai and A. L. Barab\u00e1si. 2002. Hierarchical organization of modularity in metabolic networks. Science 297 5586 (2002) 1551--1555.","DOI":"10.1126\/science.1073374"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0237338100"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0706851105"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","unstructured":"Y. Ruan D. Fuhry and S. Parthasarathy. 2013. Efficient community detection in large networks using content and links. In WWW. 1089--1098. 10.1145\/2488388.2488483","DOI":"10.1145\/2488388.2488483"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140443"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.042813"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2013.41"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.07.020"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557108"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433461"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213894"},{"volume-title":"International Conference On Data Mining (ICDM). IEEE.","author":"Yang J.","key":"e_1_2_1_37_1","unstructured":"J. Yang, J. McAuley, and J. Leskovec. 2013. Community detection in networks with node attributes. In International Conference On Data Mining (ICDM). IEEE."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","unstructured":"T. Yang R. Jin Y. Chi and S. Zhu. 2009. Combining link and content for community detection: A discriminative approach. In KDD. ACM New York NY USA 927--936. 10.1145\/1557019.1557120","DOI":"10.1145\/1557019.1557120"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687709"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2011.03.009"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487693"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2968451","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2968451","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2968451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:42:54Z","timestamp":1763458974000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2968451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,19]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5,31]]}},"alternative-id":["10.1145\/2968451"],"URL":"https:\/\/doi.org\/10.1145\/2968451","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2016,11,19]]},"assertion":[{"value":"2015-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-07-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-11-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}