{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T14:00:02Z","timestamp":1762351202744,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61272194"],"award-info":[{"award-number":["61272194"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/access.2017.2688477","type":"journal-article","created":{"date-parts":[[2017,4,5]],"date-time":"2017-04-05T14:44:55Z","timestamp":1491403495000},"page":"4991-5000","source":"Crossref","is-referenced-by-count":37,"title":["An Effective Algorithm Based on Density Clustering Framework"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7187-8871","authenticated-orcid":false,"given":"Jianyun","family":"Lu","sequence":"first","affiliation":[]},{"given":"Qingsheng","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1983.10478008"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2025923"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACV.1994.341300"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2307\/2284239"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.08.086"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_43"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.07.007"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2006.83"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/2.781637"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.01.034"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(94)00125-6"},{"key":"ref17","first-page":"993","article-title":"Latent Dirichlet allocation","volume":"3","author":"blei","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"39","author":"dempster","year":"1977","journal-title":"J R Statist Soc B (Methodological)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.21"},{"year":"2013","author":"lichman","key":"ref28"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Clustering by fast search and find of density peaks","volume":"344","author":"rodriguez","year":"2014","journal-title":"Science"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-8-3"},{"key":"ref3","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","author":"ester","year":"1996","journal-title":"Proc KDD"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.11.010"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312186"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.845141"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2003.809902"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.01.015"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1974.10480191"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335388"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.10.050"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/11731139_68"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335415"},{"key":"ref23","first-page":"105","article-title":"A new shared nearest neighbor clustering algorithm and its applications","author":"ert\u00f6z","year":"2002","journal-title":"Proc Workshop Clustering High Dimensional Data Appl 2nd SIAM Int Conf Data Mining"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1033218"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223083"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7859429\/07892858.pdf?arnumber=7892858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:30:18Z","timestamp":1641987018000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7892858\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/access.2017.2688477","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2017]]}}}