{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:39Z","timestamp":1740169179660,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71771034","71421001"],"award-info":[{"award-number":["71771034","71421001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Program of Jieyang","award":["2017xm041"],"award-info":[{"award-number":["2017xm041"]}]},{"name":"Scientific and Technological Innovation Foundation of Dalian","award":["2018J11CY009"],"award-info":[{"award-number":["2018J11CY009"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3012740","type":"journal-article","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T21:23:13Z","timestamp":1596057793000},"page":"138884-138897","source":"Crossref","is-referenced-by-count":9,"title":["Fast Clustering by Affinity Propagation Based on Density Peaks"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8988-0491","authenticated-orcid":false,"given":"Yang","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5155-1297","authenticated-orcid":false,"given":"Chonghui","family":"Guo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0157-1716","authenticated-orcid":false,"given":"Leilei","family":"Sun","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939866"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.hlpt.2017.10.003"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2015.12.037"},{"key":"ref11","first-page":"161","article-title":"Semi-supervised affinity propagation with instance-level constraints","author":"givoni","year":"2009","journal-title":"Proc 12th Int Conf Artif Intell Statist"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.107"},{"key":"ref13","first-page":"238","article-title":"Hierarchical affinity propagation","author":"givoni","year":"2011","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2310215"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.11.019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.08.086"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2930056"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2018.00063"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/0137040"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-018-9642-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-015-0040-1"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2853710"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1126\/science.1242072"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553511"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1126\/science.1136800"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.144"},{"journal-title":"Finding Groups in Data An Introduction to Cluster Analysis","year":"2009","author":"kaufman","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-017-0676-x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-017-1507-0"},{"journal-title":"Data Mining Concepts and Techniques","year":"2011","author":"han","key":"ref1"},{"key":"ref20","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","author":"macqueen","year":"1967","journal-title":"Proc 5th Berkeley Symp Math Statist Probab"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1459359.1459448"},{"key":"ref21","first-page":"2238","article-title":"Fast algorithm for affinity propagation","author":"fujiwara","year":"2011","journal-title":"Proc 22nd Int Conf Artif Intell"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0996-y"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408928"},{"key":"ref26","first-page":"1125","article-title":"Gravity theory-based affinity propagation clustering algorithm and its applications","volume":"25","author":"wang","year":"2018","journal-title":"Technical Gazette"},{"key":"ref25","first-page":"1787","article-title":"Semi-supervised affinity propagation based on density peaks","volume":"23","author":"wang","year":"2016","journal-title":"Teh Vjesn"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09151946.pdf?arnumber=9151946","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:57:42Z","timestamp":1642003062000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9151946\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3012740","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}