{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:48:10Z","timestamp":1761598090737,"version":"3.37.3"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Natural Science Fund Project Guidance Plan in Liaoning Province of China","award":["20180520024"],"award-info":[{"award-number":["20180520024"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2926816","type":"journal-article","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T19:15:52Z","timestamp":1562526952000},"page":"99254-99262","source":"Crossref","is-referenced-by-count":9,"title":["GPOGC: Gaussian Pigeon-Oriented Graph Clustering Algorithm for Social Networks Cluster"],"prefix":"10.1109","volume":"7","author":[{"given":"Yang","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5367-1372","authenticated-orcid":false,"given":"Shoulin","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1230-4007","authenticated-orcid":false,"given":"Hang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Teng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahid","family":"Karim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39750-9_13"},{"key":"ref11","article-title":"Trust-based social networks with computing, caching and communications: A deep reinforcement learning approach","author":"he","year":"0","journal-title":"IEEE Transactions on Network Science and Engineering"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2017.01.009"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2882620"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-010-0289-5"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1379157.1379160"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/srep01783"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1186\/s40064-016-2420-1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1108\/IJICC-02-2014-0005"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cja.2014.12.008"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-016-3776-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.04.048"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2012.111"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2012.02.008"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-985X.2007.00471.x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.09.041"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2010.07.028"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0297.2006.01115.x"},{"key":"ref9","first-page":"1200","article-title":"A high-efficiency discrete logarithm-based multi-proxy blind signature scheme via elliptic curve and bilinear mapping","volume":"20","author":"teng","year":"2018","journal-title":"Int J Netw Secur"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.02.095"},{"key":"ref22","first-page":"1","article-title":"Clustering algorithm of social networks based on graph clustering and ant colony optimization algorithm","volume":"37","author":"ye","year":"2019","journal-title":"Appl Res Comput"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1166\/jbns.2018.1499"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2018.10.014"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2017.04.037"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2782256"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08755287.pdf?arnumber=8755287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:10Z","timestamp":1628624410000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8755287\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2926816","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}