{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T01:57:54Z","timestamp":1760234274065,"version":"build-2065373602"},"reference-count":34,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T00:00:00Z","timestamp":1619308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"the International Science and Technology Cooperation Project of Shaanxi Province, China","award":["2019KW-008"],"award-info":[{"award-number":["2019KW-008"]}]},{"name":"the Science and Technology Projects of Xi'an City, China","award":["2019218114GXRC017CG018-GXYD17.9"],"award-info":[{"award-number":["2019218114GXRC017CG018-GXYD17.9"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Presently, data that are collected from real systems and organized as information networks are universal. Mining hidden information from these data is generally helpful to understand and benefit the corresponding systems. The challenges of analyzing such data include high computational complexity and low parallelizability because of the nature of complicated interconnected structure of their nodes. Network representation learning, also called network embedding, provides a practical and promising way to solve these issues. One of the foremost requirements of network embedding is preserving network topology properties in learned low-dimension representations. Community structure is a prominent characteristic of complex networks and thus should be well maintained. However, the difficulty lies in the fact that the properties of community structure are multivariate and complicated; therefore, it is insufficient to model community structure using a predefined model, the way that is popular in most state-of-the-art network embedding algorithms explicitly considering community structure preservation. In this paper, we introduce a multi-process parallel framework for network embedding that is enhanced by found partial community information and can preserve community properties well. We also implement the framework and propose two node embedding methods that use game theory for detecting partial community information. A series of experiments are conducted to evaluate the performance of our methods and six state-of-the-art algorithms. The results demonstrate that our methods can effectively preserve community properties of networks in their low-dimension representations. Specifically, compared to the involved baselines, our algorithms behave the best and are the runners-up on networks with high overlapping diversity and density.<\/jats:p>","DOI":"10.3390\/info12050186","type":"journal-article","created":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T22:31:39Z","timestamp":1619389899000},"page":"186","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Network Representation Learning Enhanced by Partial Community Information That Is Found Using Game Theory"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2961-4834","authenticated-orcid":false,"given":"Hanlin","family":"Sun","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Xi\u2019an University of Posts and Telecommunications, Xi\u2019an 710121, China"},{"name":"Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing, Xi\u2019an University of Posts and Telecommunications, Xi\u2019an 710121, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5392-0009","authenticated-orcid":false,"given":"Wei","family":"Jie","sequence":"additional","affiliation":[{"name":"School of Computing and Engineering, University of West London, London W5 5RF, UK"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2197-8126","authenticated-orcid":false,"given":"Jonathan","family":"Loo","sequence":"additional","affiliation":[{"name":"School of Computing and Engineering, University of West London, London W5 5RF, UK"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3706-6479","authenticated-orcid":false,"given":"Liang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computing and Engineering, University of West London, London W5 5RF, UK"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0870-454X","authenticated-orcid":false,"given":"Zhongmin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xi\u2019an University of Posts and Telecommunications, Xi\u2019an 710121, China"},{"name":"Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing, Xi\u2019an University of Posts and Telecommunications, Xi\u2019an 710121, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8588-8111","authenticated-orcid":false,"given":"Sugang","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering, Xi\u2019an University of Posts and Telecommunications, Xi\u2019an 710121, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4369-3412","authenticated-orcid":false,"given":"Gang","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xi\u2019an University of Posts and Telecommunications, Xi\u2019an 710121, China"},{"name":"Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing, Xi\u2019an University of Posts and Telecommunications, Xi\u2019an 710121, China"}]},{"given":"Shuai","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xi\u2019an University of Posts and Telecommunications, Xi\u2019an 710121, China"},{"name":"Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing, Xi\u2019an University of Posts and Telecommunications, Xi\u2019an 710121, China"}]}],"member":"1968","published-online":{"date-parts":[[2021,4,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/TBDATA.2018.2850013","article-title":"Network representation learning: A survey","volume":"6","author":"Zhang","year":"2020","journal-title":"IEEE Trans. Big Data"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","article-title":"Graph embedding techniques, applications, and performance: A survey","volume":"151","author":"Goyal","year":"2018","journal-title":"Knowl. Based Syst."},{"key":"ref_3","unstructured":"Hamilton, W.L., Ying, R., and Leskovec, J. (2018). Representation learning on graphs: Methods and applications. arXiv."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","article-title":"A comprehensive survey of graph embedding: Problems, techniques, and applications","volume":"30","author":"Cai","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_5","first-page":"2394","article-title":"Representation learning of large-scale complex information network: Concepts, methods and challenges","volume":"41","author":"Qi","year":"2018","journal-title":"Chin. J. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1360\/N112017-00145","article-title":"Network representation learning: An overview","volume":"47","author":"Tu","year":"2017","journal-title":"Sci. Sin. Inf."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"46665","DOI":"10.1109\/ACCESS.2020.2978517","article-title":"Network Representation Learning Guided by Partial Community Structure","volume":"8","author":"Sun","year":"2020","journal-title":"IEEE Access"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., and Skiena, S. (2014, January 24\u201327). DeepWalk: Online learning of social representations. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA.","DOI":"10.1145\/2623330.2623732"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Grover, A., and Leskovec, J. (2016, January 13\u201317). node2vec: Scalable feature learning for networks. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA.","DOI":"10.1145\/2939672.2939754"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Wang, X., Cui, P., Wang, J., Pei, J., Zhu, W., and Yang, S. (2017, January 4\u20139). Community preserving network embedding. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, San Francisco, CA, USA.","DOI":"10.1609\/aaai.v31i1.10488"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Davies, R., Sarkar, R., and Sutton, C. (2019, January 27\u201330). GEMSEC: Graph Embedding with Self Clustering. Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, Vancouver, BC, Canada.","DOI":"10.1145\/3341161.3342890"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Li, Y., Wang, Y., Zhang, T., Zhang, J., and Chang, Y. (2019, January 10\u201316). Learning Network Embedding with Community Structural Information. Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, Macao, China.","DOI":"10.24963\/ijcai.2019\/407"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Lyu, T., and Zhang, Y. (2018, January 2\u20137). COSINE: Community-preserving social network embedding from information diffusion cascades. Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, New Orleans, LA, USA.","DOI":"10.1609\/aaai.v32i1.11856"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Cavallari, S., Zheng, V.W., and Cai, H. (2017, January 6\u201310). Learning community embedding with community detection and node embedding on graphs. Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, Singapore.","DOI":"10.1145\/3132847.3132925"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/MCI.2019.2919396","article-title":"Embedding Both Finite and Infinite Communities on Graphs","volume":"14","author":"Cavallar","year":"2019","journal-title":"IEEE Comput. Intell. Mag."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1109\/TKDE.2018.2852958","article-title":"A unified framework for community detection and network representation learning","volume":"31","author":"Tu","year":"2019","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Jia, Y., Zhang, Q., Zhang, W., and Wang, X. (2019, January 13\u201317). CommunityGan: Community detection with generative adversarial nets. Proceedings of the World Wide Web Conference, San Francisco, CA, USA.","DOI":"10.1145\/3308558.3313564"},{"key":"ref_18","unstructured":"Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E., and Garnett, R. (2019). vGraph: A Generative Model for Joint Community Detection and Node Representation Learning. Advances in Neural Information Processing Systems (NeurIPS 2019), Curran Associates, Inc."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.knosys.2018.02.028","article-title":"Community aware random walk for network embedding","volume":"148","author":"Keikha","year":"2018","journal-title":"Knowl. Based Syst."},{"key":"ref_20","unstructured":"Tian, Y., Balmin, A., Corsten, S.A., Tatikonda, S., and McPherson, J. (2014, January 1\u20135). From \u201cThink Like a Vertex\u201d to \u201cThink Like a Graph\u201d. Proceedings of the 40th International Conference on Very Large Data Bases, Hangzhou, China."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13278-016-0386-1","article-title":"A survey on game theoretic models for community detection in social networks","volume":"6","author":"Jonnalagadda","year":"2016","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s10618-010-0186-6","article-title":"A Game-Theoretic Framework to Identify Overlapping Communities in Social Networks","volume":"21","author":"Chen","year":"2010","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Soleimanpour, M., and Hamze, A. (2016, January 7\u20138). A game-theoretic approach for locally detecting overlapping communities in social networks. Proceedings of the Eighth International Conference on Information and Knowledge Technology, Hamedan, Iran.","DOI":"10.1109\/IKT.2016.7777784"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1750112","DOI":"10.1142\/S0129183117501121","article-title":"An improved game-theoretic approach to uncover overlapping communities","volume":"28","author":"Sun","year":"2017","journal-title":"Int. J. Mod. Phys. C"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1016\/j.physleta.2018.01.036","article-title":"A game theoretic algorithm to detect overlapping community structure in networks","volume":"382","author":"Zhou","year":"2018","journal-title":"Phys. Lett. A"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Avrachenkov, K.E., Kondratev, A.Y., and Mazalov, V.V. (2017, January 3\u20135). Cooperative Game Theory Approaches for Network Partitioning. Proceedings of the 6th International Conference on Computational Social Networks, Hong Kong, China.","DOI":"10.1007\/978-3-319-62389-4_49"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"9634","DOI":"10.1016\/j.eswa.2015.07.023","article-title":"An Approach for Overlapping and Hierarchical Community Detection in Social Networks Based on Coalition Formation Game Theory","volume":"42","author":"Zhou","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Zhou, L., Yang, P., L\u00fc, K., Zhang, Z., and Chen, H. (2015, January 8\u201310). A Coalition Formation Game Theory-Based Approach for Detecting Communities in Multi-relational Networks. Proceedings of the 16th International conference on Web-Age Information Management, Qingdao, China.","DOI":"10.1007\/978-3-319-21042-1_3"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.engappai.2019.08.003","article-title":"Community detection based on Game Theory","volume":"85","author":"Moscato","year":"2019","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_30","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_31","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., and Mei, Q. (2015, January 18\u201322). LINE: Large-scale information network embedding. Proceedings of the 24th International World Wide Web Conference, Florence, Italy.","DOI":"10.1145\/2736277.2741093"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Cao, S., Lu, W., and Xu, Q. (2015, January 19\u201323). GraRep: Learning graph representations with global structural information. Proceedings of the 24th ACM International Conference on Information and Knowledge Management, Melbourne, Australia.","DOI":"10.1145\/2806416.2806512"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","article-title":"Benchmark graphs for testing community detection algorithms","volume":"78","author":"Lancichinetti","year":"2008","journal-title":"Phy. Rev. E"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/1961189.1961199","article-title":"LIBSVM: A library for support vector machines","volume":"2","author":"Chang","year":"2011","journal-title":"ACM Trans. Intell. Syst. Technol."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/12\/5\/186\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:52:41Z","timestamp":1760161961000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/12\/5\/186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,25]]},"references-count":34,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2021,5]]}},"alternative-id":["info12050186"],"URL":"https:\/\/doi.org\/10.3390\/info12050186","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2021,4,25]]}}}