{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T05:23:18Z","timestamp":1770355398985,"version":"3.49.0"},"reference-count":42,"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:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"Education Committee Foundation of Chongqing","award":["KJ1601210"],"award-info":[{"award-number":["KJ1601210"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61601060"],"award-info":[{"award-number":["61601060"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61803047"],"award-info":[{"award-number":["61803047"]}],"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":[[2019]]},"DOI":"10.1109\/access.2019.2904995","type":"journal-article","created":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T18:44:38Z","timestamp":1552589078000},"page":"43707-43720","source":"Crossref","is-referenced-by-count":11,"title":["A Novel Hybrid Clustering Algorithm Based on Minimum Spanning Tree of Natural Core Points"],"prefix":"10.1109","volume":"7","author":[{"given":"Jinlong","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ru","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongdong","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1092-375X","authenticated-orcid":false,"given":"Sulan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keke","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.10.014"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-016-5608-2"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.107"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223083"},{"key":"ref31","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":"ref30","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","article-title":"Clustering by passing messages between data points","volume":"315","author":"frey","year":"2007","journal-title":"Science"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.02.027"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.05.007"},{"key":"ref35","first-page":"1","article-title":"Mathematics, measurement, and psychophysics","author":"stevens","year":"1951","journal-title":"Handbook of Experimental Psychology"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-014-1628-7"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276312"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.12.040"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1999.754967"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.1998.10485534"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"ref14","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"ester","year":"1996","journal-title":"Proc Int Conf Knowl Discovery Data Mining"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.en.18.010173.001303"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2307\/2282912"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065192"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/2.781637"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1117\/1.601810"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200103)37:2<74::AID-NET2>3.0.CO;2-E"},{"key":"ref4","first-page":"1","article-title":"Data mining: Concepts and techniques","volume":"5","author":"jiawei","year":"2006","journal-title":"Data Mining Concepts Models Methods and Algorithm"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335388"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/34.908968"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033770"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2004.09.039"},{"key":"ref5","first-page":"277","article-title":"Finding groups in data: An introduction to cluster analysis","volume":"8","author":"kaufman","year":"1990","journal-title":"J Amer Stat Assoc"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304187"},{"key":"ref7","first-page":"58","article-title":"An efficient approach to clustering in large multimedia databases with noise","author":"hinneburg","year":"1998","journal-title":"Proc 4th Int Conf Knowledge Discovery and Data Mining"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3437-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233324"},{"key":"ref1","first-page":"543","article-title":"Very fast EM-based mixture model clustering using multiresolution KD-trees","volume":"11","author":"moore","year":"1998","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.10.028"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.09.015"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.21"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2012.09.001"},{"key":"ref24","first-page":"227","article-title":"Algorithms for clustering data","volume":"32","author":"jain","year":"1988","journal-title":"Technometrics"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.03.001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.04.013"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2013.03.009"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.4.536"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08667299.pdf?arnumber=8667299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T09:57:01Z","timestamp":1643277421000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8667299\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2904995","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}