{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T14:56:20Z","timestamp":1775228180607,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the national natural science foundation of china","doi-asserted-by":"crossref","award":["No.61672159"],"award-info":[{"award-number":["No.61672159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the national natural science foundation of china","doi-asserted-by":"crossref","award":["No.61672158"],"award-info":[{"award-number":["No.61672158"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"the national natural science foundation of china","doi-asserted-by":"crossref","award":["No.61300104 and No.62002063"],"award-info":[{"award-number":["No.61300104 and No.62002063"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the fujian collaborative innovation center for big data applications in governments","award":["No.2017H6008"],"award-info":[{"award-number":["No.2017H6008"]}]},{"name":"the fujian industry-academy cooperation project","award":["No.2018H6010"],"award-info":[{"award-number":["No.2018H6010"]}]},{"name":"the natural science foundation of fujian province","award":["No.2018J07005"],"award-info":[{"award-number":["No.2018J07005"]}]},{"name":"the natural science foundation of fujian province","award":["No.2019J01835"],"award-info":[{"award-number":["No.2019J01835"]}]},{"name":"the natural science foundation of fujian province","award":["No.2020J05112 and No.2020J01230054"],"award-info":[{"award-number":["No.2020J05112 and No.2020J01230054"]}]},{"name":"the fujian provincial department of education","award":["No.JAT190026"],"award-info":[{"award-number":["No.JAT190026"]}]},{"name":"the fuzhou university","award":["510872\/GXRC-20016"],"award-info":[{"award-number":["510872\/GXRC-20016"]}]},{"name":"haixi government big data application cooperative innovation center"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10489-021-02999-8","type":"journal-article","created":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:03:16Z","timestamp":1641772996000},"page":"9919-9937","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Network representation learning based on community-aware and adaptive random walk for overlapping community detection"],"prefix":"10.1007","volume":"52","author":[{"given":"Kun","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinze","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaqi","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5293-8701","authenticated-orcid":false,"given":"Ling","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenzhong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuo-Ming","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,10]]},"reference":[{"issue":"12","key":"2999_CR1","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"key":"2999_CR2","doi-asserted-by":"publisher","first-page":"109464","DOI":"10.1016\/j.chaos.2019.109464","volume":"130","author":"Y Ye","year":"2020","unstructured":"Ye Y, Hang XR, Koh JM, Miszczak JA, Cheong KH, Xie NG (2020) Passive network evolution promotes group welfare in complex networks. Chaos, Solitons & Fractals 130:109464","journal-title":"Chaos, Solitons & Fractals"},{"key":"2999_CR3","doi-asserted-by":"crossref","unstructured":"Zhao J, Deng Y (2020) Complex network modeling of evidence theory. IEEE Trans Fuzzy Syst","DOI":"10.1109\/TFUZZ.2020.3023760"},{"issue":"10","key":"2999_CR4","first-page":"2394","volume":"41","author":"J Qi","year":"2018","unstructured":"Qi J, Liang X, Li Z, Chen Y, Xu Y (2018) Representation learning of large-scale complex information network: concepts, methods and challenges. Chinese J Comput 41(10):2394\u20132420","journal-title":"Chinese J Comput"},{"key":"2999_CR5","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.ins.2019.10.067","volume":"513","author":"NH Aghdam","year":"2020","unstructured":"Aghdam NH, Ashtiani M, Azgomi MA (2020) An uncertainty-aware computational trust model considering the co-existence of trust and distrust in social networks. Inform Sci 513:465\u2013503","journal-title":"Inform Sci"},{"key":"2999_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ins.2015.01.034","volume":"306","author":"S Liu","year":"2015","unstructured":"Liu S, Jiang C, Lin Z, Ding Y, Duan R, Xu Z (2015) Identifying effective influencers based on trust for electronic word-of-mouth marketing: A domain-aware approach. Inform Sci 306:34\u201352","journal-title":"Inform Sci"},{"key":"2999_CR7","doi-asserted-by":"crossref","unstructured":"Cao S, Lu W, Xu Q (2015) Grarep: Learning graph representations with global structural information. In: Proceedings of the 24th ACM international on conference on information and knowledge management, pp 891\u2013900","DOI":"10.1145\/2806416.2806512"},{"key":"2999_CR8","doi-asserted-by":"crossref","unstructured":"Qiu J, Dong Y, Ma H, Li J, Wang K, Tang J (2018) Network embedding as matrix factorization: Unifying deepwalk, line, pte, and node2vec. In: Proceedings of the eleventh ACM international conference on web search and data mining, pp 459\u2013467","DOI":"10.1145\/3159652.3159706"},{"key":"2999_CR9","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: Online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"2999_CR10","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"issue":"1","key":"2999_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2008","unstructured":"Scarselli F, Gori M, Tsoi AC, Hagenbuchner M, Monfardini G (2008) The graph neural network model. IEEE Trans Neural Netw 20(1):61\u201380","journal-title":"IEEE Trans Neural Netw"},{"key":"2999_CR12","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs. arXiv:1706.02216"},{"key":"2999_CR13","unstructured":"Mikolov T, Chen K, Corrado G, Dean J (2013) Efficient estimation of word representations in vector space. arXiv:1301.3781"},{"key":"2999_CR14","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.future.2019.05.033","volume":"100","author":"Y Zhang","year":"2019","unstructured":"Zhang Y, Shi Z, Feng D, Zhan XX (2019) Degree-biased random walk for large-scale network embedding. Futur Gener Comput Syst 100:198\u2013209","journal-title":"Futur Gener Comput Syst"},{"issue":"2-3","key":"2999_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0098-3004(84)90020-7","volume":"10","author":"JC Bezdek","year":"1984","unstructured":"Bezdek JC, Ehrlich R, Full W (1984) Fcm: The fuzzy c-means clustering algorithm. Comput Geosci 10(2-3):191\u2013203","journal-title":"Comput Geosci"},{"key":"2999_CR16","doi-asserted-by":"crossref","unstructured":"Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) Line: Large-scale information network embedding. In: Proceedings of the 24th international conference on world wide web, pp 1067\u20131077","DOI":"10.1145\/2736277.2741093"},{"key":"2999_CR17","doi-asserted-by":"crossref","unstructured":"Chen H, Perozzi B, Hu Y, Skiena S (2018) Harp: Hierarchical representation learning for networks. In: Proceedings of the AAAI conference on artificial intelligence, vol 32","DOI":"10.1609\/aaai.v32i1.11849"},{"key":"2999_CR18","doi-asserted-by":"crossref","unstructured":"Yang C, Sun M, Liu Z, Tu C (2017) Fast network embedding enhancement via high order proximity approximation. In: IJCAI, pp 3894\u20133900","DOI":"10.24963\/ijcai.2017\/544"},{"key":"2999_CR19","doi-asserted-by":"crossref","unstructured":"Cavallari S, Zheng VW, Cai H, Chang KCC, Cambria E (2017) Learning community embedding with community detection and node embedding on graphs. In: Proceedings of the 2017 ACM on conference on information and knowledge management, pp 377\u2013386","DOI":"10.1145\/3132847.3132925"},{"key":"2999_CR20","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.knosys.2018.02.028","volume":"148","author":"MM Keikha","year":"2018","unstructured":"Keikha MM, Rahgozar M, Asadpour M (2018) Community aware random walk for network embedding. Knowl-Based Syst 148: 47\u201354","journal-title":"Knowl-Based Syst"},{"issue":"6","key":"2999_CR21","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1109\/TKDE.2018.2852958","volume":"31","author":"C Tu","year":"2018","unstructured":"Tu C, Zeng X, Wang H, Zhang Z, Liu Z, Sun M, Zhang B, Lin L (2018) A unified framework for community detection and network representation learning. IEEE Trans Knowl Data Eng 31(6):1051\u20131065","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"suppl 1","key":"2999_CR22","doi-asserted-by":"publisher","first-page":"5228","DOI":"10.1073\/pnas.0307752101","volume":"101","author":"TL Griffiths","year":"2004","unstructured":"Griffiths TL, Steyvers M (2004) Finding scientific topics. Proc Natl Acad Sci 101(suppl 1):5228\u20135235","journal-title":"Proc Natl Acad Sci"},{"key":"2999_CR23","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Davies R, Sarkar R, Sutton C (2019) Gemsec: Graph embedding with self clustering. In: Proceedings of the 2019 IEEE\/ACM international conference on advances in social networks analysis and mining, pp 65\u201372","DOI":"10.1145\/3341161.3342890"},{"key":"2999_CR24","doi-asserted-by":"publisher","first-page":"105464","DOI":"10.1016\/j.knosys.2019.105464","volume":"193","author":"F Liu","year":"2020","unstructured":"Liu F, Wang Z, Deng Y (2020) Gmm: A generalized mechanics model for identifying the importance of nodes in complex networks. Knowl-Based Syst 193:105464","journal-title":"Knowl-Based Syst"},{"key":"2999_CR25","doi-asserted-by":"publisher","first-page":"105717","DOI":"10.1016\/j.knosys.2020.105717","volume":"195","author":"T Wen","year":"2020","unstructured":"Wen T, Pelusi D, Deng Y (2020) Vital spreaders identification in complex networks with multi-local dimension. Knowl-Based Syst 195:105717","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"2999_CR26","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1080\/09540091.2020.1806203","volume":"33","author":"J Zhao","year":"2021","unstructured":"Zhao J, Song Y, Liu F, Deng Y (2021) The identification of influential nodes based on structure similarity. Conn Sci 33(2):201\u2013218","journal-title":"Conn Sci"},{"key":"2999_CR27","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.chaos.2018.06.022","volume":"114","author":"A Ibnoulouafi","year":"2018","unstructured":"Ibnoulouafi A, El Haziti M (2018) Density centrality: identifying influential nodes based on area density formula. Chaos, Solitons & Fractals 114:69\u201380","journal-title":"Chaos, Solitons & Fractals"},{"issue":"3","key":"2999_CR28","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1(3):215\u2013239","journal-title":"Soc Netw"},{"issue":"1","key":"2999_CR29","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341","journal-title":"Sociometry"},{"key":"2999_CR30","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: Bringing order to the web. Tech. rep, Stanford InfoLab"},{"issue":"3","key":"2999_CR31","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/s11390-012-1236-x","volume":"27","author":"ZH Wu","year":"2012","unstructured":"Wu ZH, Lin YF, Gregory S, Wan HY, Tian SF (2012) Balanced multi-label propagation for overlapping community detection in social networks. J Comput Sci Technol 27(3):468\u2013479","journal-title":"J Comput Sci Technol"},{"key":"2999_CR32","unstructured":"Mikolov T, Sutskever I, Chen K, Corrado G, Dean J (2013) Distributed representations of words and phrases and their compositionality. arXiv:1310.4546"},{"issue":"4","key":"2999_CR33","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110","journal-title":"Phys Rev E"},{"issue":"2","key":"2999_CR34","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113","journal-title":"Phys Rev E"},{"issue":"2","key":"2999_CR35","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1009953814988","volume":"3","author":"AK McCallum","year":"2000","unstructured":"McCallum AK, Nigam K, Rennie J, Seymore K (2000) Automating the construction of internet portals with machine learning. Inf Retr 3(2):127\u2013163","journal-title":"Inf Retr"},{"issue":"1","key":"2999_CR36","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: Densification and shrinking diameters. ACM Trans Knowl Discovery Data (TKDD) 1(1):2\u2013es","journal-title":"ACM Trans Knowl Discovery Data (TKDD)"},{"key":"2999_CR37","unstructured":"Rozemberczki B, Allen C, Sarkar R (2019) Multi-scale attributed node embedding. arXiv:1909.13021"},{"key":"2999_CR38","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd international conference on world wide web, pp 1343\u20131350","DOI":"10.1145\/2487788.2488173"},{"key":"2999_CR39","doi-asserted-by":"crossref","unstructured":"Zhang J, Dong Y, Wang Y, Tang J, Ding M (2019) Prone: Fast and scalable network representation learning. In: IJCAI, vol 19, pp 4278\u20134284","DOI":"10.24963\/ijcai.2019\/594"},{"issue":"7043","key":"2999_CR40","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814\u2013818","journal-title":"Nature"},{"key":"2999_CR41","doi-asserted-by":"crossref","unstructured":"Xie J, Szymanski BK, Liu X (2011) Slpa: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: 2011 IEEE 11th International conference on data mining workshops, pp 344\u2013349, IEEE","DOI":"10.1109\/ICDMW.2011.154"},{"issue":"3","key":"2999_CR42","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3):036106","journal-title":"Phys Rev E"},{"issue":"12","key":"2999_CR43","first-page":"2520","volume":"50","author":"Z Mu","year":"2013","unstructured":"Mu Z, Fanrong M, Yong Z (2013) Density-based link clustering algorithm for overlapping community detection. J Comput Res Develop 50(12):2520","journal-title":"J Comput Res Develop"},{"issue":"2","key":"2999_CR44","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/s10489-019-01541-1","volume":"50","author":"K Guo","year":"2020","unstructured":"Guo K, He L, Chen Y, Guo W, Zheng J (2020) A local community detection algorithm based on internal force between nodes. Appl Intell 50(2):328\u2013340","journal-title":"Appl Intell"},{"key":"2999_CR45","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2013) Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the sixth ACM international conference on Web search and data mining, pp 587\u2013596","DOI":"10.1145\/2433396.2433471"},{"issue":"09","key":"2999_CR46","doi-asserted-by":"publisher","first-page":"P09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","volume":"2005","author":"L Danon","year":"2005","unstructured":"Danon L, Diaz-Guilera A, Duch J, Arenas A (2005) Comparing community structure identification. J Stat Mech Theory Exper 2005(09):P09008","journal-title":"J Stat Mech Theory Exper"},{"key":"2999_CR47","unstructured":"McDaid AF, Greene D, Hurley N (2011) Normalized mutual information to evaluate overlapping community finding algorithms. arXiv:1110.2515"},{"issue":"8","key":"2999_CR48","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1016\/j.physa.2008.12.021","volume":"388","author":"H Shen","year":"2009","unstructured":"Shen H, Cheng X, Cai K, Hu MB (2009) Detect overlapping and hierarchical community structure in networks. Physica A: Stat Mech Appl 388(8):1706\u20131712","journal-title":"Physica A: Stat Mech Appl"},{"issue":"11","key":"2999_CR49","first-page":"2579","volume":"9","author":"L Van der Maaten","year":"2008","unstructured":"Van der Maaten L, Hinton G (2008) Visualizing data using t-sne. J Mach Learn Res 9 (11):2579\u20132605","journal-title":"J Mach Learn Res"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02999-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02999-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02999-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T10:21:24Z","timestamp":1674382884000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02999-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,10]]},"references-count":49,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["2999"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02999-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,10]]},"assertion":[{"value":"10 November 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}