{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:25:14Z","timestamp":1778664314799,"version":"3.51.4"},"reference-count":59,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2019,1,20]],"date-time":"2019-01-20T00:00:00Z","timestamp":1547942400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673301"],"award-info":[{"award-number":["61673301"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Research Funds of State Key Laboratory for Novel Software Technology","award":["KFKT2017B22"],"award-info":[{"award-number":["KFKT2017B22"]}]},{"name":"National Key R&amp;D Program of China","award":["213"],"award-info":[{"award-number":["213"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Community detection is a challenging task in attributed networks, due to the data inconsistency between network topological structure and node attributes. The problem of how to effectively and robustly fuse multi-source heterogeneous data plays an important role in community detection algorithms. Although some algorithms taking both topological structure and node attributes into account have been proposed in recent years, the fusion strategy is simple and usually adopts the linear combination method. As a consequence of this, the detected community structure is vulnerable to small variations of the input data. In order to overcome this challenge, we develop a novel two-layer representation to capture the latent knowledge from both topological structure and node attributes in attributed networks. Then, we propose a weighted co-association matrix-based fusion algorithm (WCMFA) to detect the inherent community structure in attributed networks by using multi-layer fusion strategies. It extends the community detection method from a single-view to a multi-view style, which is consistent with the thinking model of human beings. Experiments show that our method is superior to the state-of-the-art community detection algorithms for attributed networks.<\/jats:p>","DOI":"10.3390\/e21010095","type":"journal-article","created":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T03:08:22Z","timestamp":1548126502000},"page":"95","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Co-Association Matrix-Based Multi-Layer Fusion for Community Detection in Attributed Networks"],"prefix":"10.3390","volume":"21","author":[{"given":"Sheng","family":"Luo","sequence":"first","affiliation":[{"name":"Department of Computer Science and Technology, Tongji University, Shanghai 201804, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhifei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Tongji University, Shanghai 201804, China"},{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5059-9854","authenticated-orcid":false,"given":"Yuanjian","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Tongji University, Shanghai 201804, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuwen","family":"Ma","sequence":"additional","affiliation":[{"name":"Research Center of Big Data and Network Security, Tongji University, Shanghai 200092, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,1,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1016\/j.neuroimage.2009.10.003","article-title":"Complex network measures of brain connectivity: Uses and interpretations","volume":"52","author":"Rubinov","year":"2010","journal-title":"Neuroimage"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"38998","DOI":"10.1038\/srep38998","article-title":"Multi-resolution community detection in massive networks","volume":"6","author":"Han","year":"2016","journal-title":"Sci. Rep."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","article-title":"Community detection in networks: A user guide","volume":"659","author":"Fortunato","year":"2016","journal-title":"Phys. Rep."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Syst. Tech. J."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","article-title":"Near linear time algorithm to detect community structures in large-scale networks","volume":"76","author":"Raghavan","year":"2007","journal-title":"Phys. Rev. E"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"026129","DOI":"10.1103\/PhysRevE.80.026129","article-title":"Detecting network communities by propagating labels under constraints","volume":"80","author":"Barber","year":"2009","journal-title":"Phys. Rev. E"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"066107","DOI":"10.1103\/PhysRevE.79.066107","article-title":"Towards real-time community detection in large networks","volume":"79","author":"Leung","year":"2009","journal-title":"Phys. Rev. E"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Barnes, E.R. (1981, January 16\u201318). An algorithm for partitioning the nodes of a graph. Proceedings of the 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes, San Diego, CA, USA.","DOI":"10.1109\/CDC.1981.269534"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"559","DOI":"10.3390\/e14030559","article-title":"Entropy and the Complexity of Graphs Revisited","volume":"14","author":"Mowshowitz","year":"2012","journal-title":"Entropy"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Vazquez-Araujo, F., Dapena, A., Souto-Salorio, M.J., and Castro, P.M. (2018). Calculation of the Connected Dominating Set Considering Vertex Importance Metrics. Entropy, 20.","DOI":"10.3390\/e20020087"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez, P.I., M\u00fcller, E., Korn, U.L., B\u00f6hm, K., Kappes, A., Hartmann, T., and Wagner, D. (May, January 30). Efficient Algorithms for a Robust Modularity-Driven Clustering of Attributed Graphs. Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada.","DOI":"10.1137\/1.9781611974010.12"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Meng, F., Rui, X., Wang, Z., Xing, Y., and Cao, L. (2018). Coupled Node Similarity Learning for Community Detection in Attributed Networks. Entropy, 20.","DOI":"10.3390\/e20060471"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1109\/TCYB.2016.2521376","article-title":"Learning Nonparametric Relational Models by Conjugately Incorporating Node Information in a Network","volume":"47","author":"Fan","year":"2017","journal-title":"IEEE Trans. Cybern."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Xu, Z., Ke, Y., Wang, Y., Cheng, H., and Cheng, J. (2012, January 20\u201324). A model-based approach to attributed graph clustering. Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, Scottsdale, AZ, USA.","DOI":"10.1145\/2213836.2213894"},{"key":"ref_18","unstructured":"Cruz, J.D., Bothorel, C., and Poulet, F. (2011, January 16\u201318). Semantic Clustering of Social Networks using Points of View. Proceedings of the Conference on Information Research and Applications (CORIA 2011), Avignon, France."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Combe, D., Largeron, C., Egyed-Zsigmond, E., and G\u00e9ry, M. (2012, January 26\u201329). Combining relations and text in scientific network clustering. Proceedings of the 2012 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Istanbul, Turkey.","DOI":"10.1109\/ASONAM.2012.215"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Henderson, T.C., Simmons, R., Sacharny, D., Mitiche, A., and Fan, X. (2017, January 16\u201318). A probabilistic logic for multi-source heterogeneous information fusion. Proceedings of the 2017 IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems (MFI), Daegu, Korea.","DOI":"10.1109\/MFI.2017.8170375"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Wang, Q., Jiang, J., Shi, Z., Wang, W., Lv, B., Qi, B., and Yin, Q. (2018, January 1\u20133). A Novel Multi-source Fusion Model for Known and Unknown Attack Scenarios. Proceedings of the 2018 17th IEEE International Conference on Trust, Security and Privacy in Computing and Communications\/12th IEEE International Conference on Big Data Science and Engineering (TrustCom\/BigDataSE), New York, NY, USA.","DOI":"10.1109\/TrustCom\/BigDataSE.2018.00106"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Zhang, J., Philip, S.Y., and Lv, Y. (2017, January 19\u201322). Enterprise community detection. Proceedings of the 2017 IEEE 33rd International Conference on Data Engineering (ICDE), San Diego, CA, USA.","DOI":"10.1109\/ICDE.2017.79"},{"key":"ref_23","unstructured":"Neville, J., Adler, M., and Jensen, D. (2003, January 9\u201315). Clustering relational data using attribute and link information. Proceedings of the Text Mining and Link Analysis Workshop, 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Steinhaeuser, K., and Chawla, N.V. (2008). Community detection in a large real-world social network. Social Computing, Behavioral Modeling, and Prediction, Springer.","DOI":"10.1007\/978-0-387-77672-9_19"},{"key":"ref_25","unstructured":"Dang, T., and Viennet, E. (2012). Community detection based on structural and attribute similarities. The Sixth International Conference on Digital Society (ICDS), IARIA."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","article-title":"A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs","volume":"20","author":"Karypis","year":"1998","journal-title":"SIAM J. Sci. Comput."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","article-title":"Modularity and community structure in networks","volume":"103","author":"Newman","year":"2006","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"027104","DOI":"10.1103\/PhysRevE.72.027104","article-title":"Community detection in complex networks using extremal optimization","volume":"72","author":"Duch","year":"2005","journal-title":"Phys. Rev. E"},{"key":"ref_29","unstructured":"Li, W., and Schuurmans, D. Modular Community Detection in Networks. Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence\u2014Volume Volume Two."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"056702","DOI":"10.1103\/PhysRevE.85.056702","article-title":"Modularity optimization by conformational space annealing","volume":"85","author":"Lee","year":"2012","journal-title":"Phys. Rev. E"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.knosys.2013.06.014","article-title":"A fast parallel modularity optimization algorithm (FPMQA) for community detection in online social network","volume":"50","author":"Bu","year":"2013","journal-title":"Knowl. Based Syst."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"036111","DOI":"10.1103\/PhysRevE.80.036111","article-title":"Spectral tripartitioning of networks","volume":"80","author":"Richardson","year":"2009","journal-title":"Phys. Rev. E"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"042822","DOI":"10.1103\/PhysRevE.88.042822","article-title":"Spectral methods for community detection and graph partitioning","volume":"88","author":"Newman","year":"2013","journal-title":"Phys. Rev. E"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"15224","DOI":"10.1073\/pnas.0703740104","article-title":"Extracting the hierarchical organization of complex systems","volume":"104","author":"Moreira","year":"2007","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Wakita, K., and Tsurumi, T. (2007, January 8\u201312). Finding Community Structure in Mega-scale Social Networks: [Extended Abstract]. Proceedings of the 16th International Conference on World Wide Web (WWW \u201907), Banff, AB, Canada.","DOI":"10.1145\/1242572.1242805"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1140\/epjb\/e2008-00425-1","article-title":"Modularity-maximizing graph communities via mathematical programming","volume":"66","author":"Agarwal","year":"2008","journal-title":"Eur. Phys. J. B"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"052802","DOI":"10.1103\/PhysRevE.88.052802","article-title":"Normalized modularity optimization method for community identification with degree adjustment","volume":"88","author":"Zhang","year":"2013","journal-title":"Phys. Rev. E"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"046104","DOI":"10.1103\/PhysRevE.83.046104","article-title":"Network community-detection enhancement by proper weighting","volume":"83","author":"Khadivi","year":"2011","journal-title":"Phys. Rev. E"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"28004","DOI":"10.1209\/0295-5075\/86\/28004","article-title":"Improved community structure detection using a modified fine-tuning strategy","volume":"86","author":"Sun","year":"2009","journal-title":"Europhys. Lett."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","article-title":"Resolution limit in community detection","volume":"104","author":"Fortunato","year":"2007","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"046106","DOI":"10.1103\/PhysRevE.81.046106","article-title":"Performance of modularity maximization in practical contexts","volume":"81","author":"Good","year":"2010","journal-title":"Phys. Rev. E"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"066114","DOI":"10.1103\/PhysRevE.85.066114","article-title":"Community identification in networks with unbalanced structure","volume":"85","author":"Zhang","year":"2012","journal-title":"Phys. Rev. E"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"28003","DOI":"10.1209\/0295-5075\/103\/28003","article-title":"Community detection and graph partitioning","volume":"103","author":"Newman","year":"2013","journal-title":"Europhys. Lett."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.ins.2014.12.009","article-title":"An Integer Programming Approach and Visual Analysis for Detecting Hierarchical Community Structures in Social Networks","volume":"299","author":"Lin","year":"2015","journal-title":"Inf. Sci."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.neucom.2016.11.019","article-title":"An overlapping community detection algorithm based on density peaks","volume":"226","author":"Bai","year":"2017","journal-title":"Neurocomputing"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1017\/nws.2015.9","article-title":"Clustering attributed graphs: Models, measures and methods","volume":"3","author":"Bothorel","year":"2015","journal-title":"Netw. Sci."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"718","DOI":"10.14778\/1687627.1687709","article-title":"Graph clustering based on structural\/attribute similarities","volume":"2","author":"Zhou","year":"2009","journal-title":"Proc. VLDB Endow."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/1376815.1376816","article-title":"Joint cluster analysis of attribute data and relationship data: The connected k-center problem, algorithms and applications","volume":"2","author":"Ge","year":"2008","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Li, H., Nie, Z., Lee, W.C., Giles, L., and Wen, J.R. (2008, January 26\u201330). Scalable community discovery on textual data with relations. Proceedings of the 17th ACM Conference on Information and Knowledge Management, Napa Valley, CA, USA.","DOI":"10.1145\/1458082.1458241"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Liu, Y., Niculescu-Mizil, A., and Gryc, W. (2009, January 14\u201318). Topic-link LDA: Joint models of topic and author community. Proceedings of the 26th Annual International Conference on Machine Learning, Montreal, QC, Canada.","DOI":"10.1145\/1553374.1553460"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann, S., Boden, B., F\u00e4rber, I., and Seidl, T. (2013). Efficient mining of combined subspace and subgraph clusters in graphs with feature vectors. Pacific-Asia Conference on Knowledge Discovery and Data Mining, Springer.","DOI":"10.1007\/978-3-642-37453-1_22"},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Gunnemann, S., Farber, I., Raubach, S., and Seidl, T. (2013, January 7\u201310). Spectral Subspace Clustering for Graphs with Feature Vectors. Proceedings of the IEEE 13th International Conference on Data Mining, Dallas, TX, USA.","DOI":"10.1109\/ICDM.2013.110"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1109\/TPAMI.2005.113","article-title":"Combining multiple clusterings using evidence accumulation","volume":"27","author":"Fred","year":"2005","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1142\/S0218001411008683","article-title":"A survey of clustering ensemble algorithms","volume":"25","year":"2011","journal-title":"Intern. J. Pattern Recognit. Artif. Intell."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1177\/1043986214553377","article-title":"Ethnic homophily and triad closure: Mapping internal gang structure using exponential random graph models","volume":"31","author":"Grund","year":"2015","journal-title":"J. Contemp. Crim. Justice"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1177\/1057567711418501","article-title":"Alliances, conflicts, and contradictions in Montreal\u2019s street gang landscape","volume":"21","author":"Descormiers","year":"2011","journal-title":"Int. Crim. Justice Rev."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","article-title":"Objective Criteria for the Evaluation of Clustering Methods","volume":"66","author":"Rand","year":"1971","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","article-title":"Comparing partitions","volume":"2","author":"Hubert","year":"1985","journal-title":"J. Classif."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"P09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","article-title":"Comparing community structure identification","volume":"2005","author":"Danon","year":"2005","journal-title":"J. Stat. Mech."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/1\/95\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:27:29Z","timestamp":1760185649000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/1\/95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,20]]},"references-count":59,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,1]]}},"alternative-id":["e21010095"],"URL":"https:\/\/doi.org\/10.3390\/e21010095","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,20]]}}}