{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:09:03Z","timestamp":1740103743666,"version":"3.37.3"},"reference-count":32,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T00:00:00Z","timestamp":1604966400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018YFB1701402","62072160"],"award-info":[{"award-number":["2018YFB1701402","62072160"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2018YFB1701402","62072160"],"award-info":[{"award-number":["2018YFB1701402","62072160"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,11,10]]},"abstract":"<jats:p>Network embedding aims to learn the low-dimensional representations of nodes in networks. It preserves the structure and internal attributes of the networks while representing nodes as low-dimensional dense real-valued vectors. These vectors are used as inputs of machine learning algorithms for network analysis tasks such as node clustering, classification, link prediction, and network visualization. The network embedding algorithms, which considered the community structure, impose a higher level of constraint on the similarity of nodes, and they make the learned node embedding results more discriminative. However, the existing network representation learning algorithms are mostly unsupervised models; the pairwise constraint information, which represents community membership, is not effectively utilized to obtain node embedding results that are more consistent with prior knowledge. This paper proposes a semisupervised modularized nonnegative matrix factorization model, SMNMF, while preserving the community structure for network embedding; the pairwise constraints (must-link and cannot-link) information are effectively fused with the adjacency matrix and node similarity matrix of the network so that the node representations learned by the model are more interpretable. Experimental results on eight real network datasets show that, comparing with the representative network embedding methods, the node representations learned after incorporating the pairwise constraints can obtain higher accuracy in node clustering task and the results of link prediction, and network visualization tasks indicate that the semisupervised model SMNMF is more discriminative than unsupervised ones.<\/jats:p>","DOI":"10.1155\/2020\/7953758","type":"journal-article","created":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T02:20:05Z","timestamp":1605061205000},"page":"1-14","source":"Crossref","is-referenced-by-count":1,"title":["Semisupervised Community Preserving Network Embedding with Pairwise Constraints"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4346-9565","authenticated-orcid":true,"given":"Dong","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer and Information Engineering, Henan Normal University, Xinxiang, Henan, China"},{"name":"Big Data Engineering Laboratory for Teaching Resources and Assessment of Education Quality, Xinxiang, Henan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6832-2183","authenticated-orcid":true,"given":"Yan","family":"Ru","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering, Henan Normal University, Xinxiang, Henan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinpeng","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering, Henan Normal University, Xinxiang, Henan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shibin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering, Henan Normal University, Xinxiang, Henan, China"},{"name":"Big Data Engineering Laboratory for Teaching Resources and Assessment of Education Quality, Xinxiang, Henan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwei","family":"Niu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1137\/s003614450342480"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1142\/s0129183116501059"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1038\/srep43330"},{"key":"4","article-title":"A survey on network embedding","volume":"1","author":"C. Peng","year":"2018","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.1145\/2623330.2623732","article-title":"Deepwalk: online learning of social representations","author":"B. Perozzi","year":"2014"},{"article-title":"Line: large-scale information network embedding","author":"J. Tang","key":"6","doi-asserted-by":"crossref","DOI":"10.1145\/2736277.2741093"},{"volume-title":"GraRep: Learning Graph Representations with Global Structural Information","year":"2015","author":"S. Cao","key":"7"},{"author":"C. Yang","key":"8","article-title":"Fast network embedding enhancement via high order proximity approximation"},{"first-page":"2778","article-title":"Arbitrary-order proximity preserved network embedding","author":"Z. Zhang","key":"9"},{"issue":"12","key":"10","article-title":"Community structure in social and biological networks","volume":"99","author":"M. Girvan","year":"2002","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"11","article-title":"Semi-supervised community detection based on distance dynamics","volume":"1","author":"F. Lilin","year":"2018","journal-title":"IEEE Access"},{"article-title":"Community preserving network embedding","author":"X. Wang","key":"12","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v31i1.10488"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.02.028"},{"author":"L. Yu","key":"14","article-title":"Learning network embedding with community structural information"},{"author":"C. Tu","key":"15","article-title":"Max-margin DeepWalk: discriminative learning of network representation"},{"article-title":"Semi-supervised classification with graph convolutional networks","year":"2016","author":"T. N. Kipf","key":"16"},{"author":"Z. Yang","key":"17","article-title":"Revisiting semi-superxised learning with graph embedding"},{"first-page":"1225","article-title":"Structural deep network embedding","author":"D. Wang","key":"18"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2018.2871503"},{"first-page":"40","article-title":"Deep network embedding with aggregated proximity preserving","author":"X. Shen","key":"20"},{"first-page":"2252","article-title":"Modularity based community detection with deep learning","author":"L. Yang","key":"21"},{"key":"22","doi-asserted-by":"crossref","DOI":"10.1145\/2939672.2939754","article-title":"node2vec: scalable feature learning for networks","author":"A. Grover","year":"2016"},{"article-title":"Community structure detection in complex networks with partial background information","year":"2012","author":"Z. Y. Zhang","key":"23"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2009.09.018"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2014.2377154"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1038\/srep03241"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.74.036104"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"author":"Z. Akata","key":"29","article-title":"Non-negative matrix factorization in multimodality data for segmentation and label prediction"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1023\/a:1009953814988"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.231"},{"volume-title":"Matching Theory","year":"1986","author":"L. Lovasz","key":"32"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/7953758.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/7953758.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/7953758.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T16:28:08Z","timestamp":1669566488000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/7953758\/"}},"subtitle":[],"editor":[{"given":"Xianggui","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2020,11,10]]},"references-count":32,"alternative-id":["7953758","7953758"],"URL":"https:\/\/doi.org\/10.1155\/2020\/7953758","relation":{},"ISSN":["1099-0526","1076-2787"],"issn-type":[{"type":"electronic","value":"1099-0526"},{"type":"print","value":"1076-2787"}],"subject":[],"published":{"date-parts":[[2020,11,10]]}}}