{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T05:53:28Z","timestamp":1768715608836,"version":"3.49.0"},"reference-count":63,"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":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772176"],"award-info":[{"award-number":["61772176"]}],"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":["61402153"],"award-info":[{"award-number":["61402153"]}],"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":["61370169"],"award-info":[{"award-number":["61370169"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2016M602247"],"award-info":[{"award-number":["2016M602247"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Plan for Scientific Innovation Talent of Henan Province","award":["184100510003"],"award-info":[{"award-number":["184100510003"]}]},{"name":"Key Scientific and Technological Project of Henan Province","award":["182102210362"],"award-info":[{"award-number":["182102210362"]}]},{"name":"Young Scholar Program of Henan Province","award":["2017GGJS041"],"award-info":[{"award-number":["2017GGJS041"]}]},{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan Province","doi-asserted-by":"publisher","award":["182300410130"],"award-info":[{"award-number":["182300410130"]}],"id":[{"id":"10.13039\/501100006407","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.2918952","type":"journal-article","created":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T19:58:51Z","timestamp":1558727931000},"page":"72936-72955","source":"Crossref","is-referenced-by-count":36,"title":["An Adaptive Density Peaks Clustering Method With Fisher Linear Discriminant"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4917-7651","authenticated-orcid":false,"given":"Lin","family":"Sun","sequence":"first","affiliation":[]},{"given":"Ruonan","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1518-3623","authenticated-orcid":false,"given":"Jiucheng","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Shiguang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.03.031"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2880271"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-1809.1936.tb02137.x"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1320-1"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.07.036"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS799"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.57"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1983.10478008"},{"key":"ref35","first-page":"2837","article-title":"Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance","volume":"11","author":"vinh","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-018-27364-7"},{"key":"ref60","first-page":"1615","article-title":"Latent Low-Rank Representation for subspace segmentation and feature extraction","author":"liu","year":"2012","journal-title":"Proc IEEE Int Conf Comput Vis"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.277"},{"key":"ref63","first-page":"59","article-title":"Hierarchical clustering","volume":"43","author":"nielsen","year":"1999","journal-title":"Revista Mexicana de Astronom&#x00ED a y Astrof&#x00ED sica"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.05.034"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.02.001"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.09.002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2877666"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2881230"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-016-0954-4"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.06.023"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304187"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.01.009"},{"key":"ref23","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 KDD"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.07.027"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2017.07.001"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.04.012"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.11.026"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33786-4_26"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"ref57","first-page":"663","article-title":"Robust subspace segmentation by low-rank representation","author":"liu","year":"2010","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref56","first-page":"106","article-title":"Low rank projection least square regression subspace segmentation for gene expression data","volume":"30","author":"chen","year":"2017","journal-title":"Pattern Recognit Artif Intell"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"ref54","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1109\/34.709601","article-title":"The random subspace method for constructing decision forests","volume":"20","author":"ho","year":"1998","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2009.08.010"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2016.02.010"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.07.010"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.07.075"},{"key":"ref40","first-page":"1027","article-title":"K-means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc 18th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2900260"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.11.017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.03.030"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.01.017"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.09.038"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2016.01.008"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2017.04.005"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.04.019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2884956"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.03.011"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2869923"},{"key":"ref5","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":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.01.085"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-017-0636-1"},{"key":"ref49","first-page":"55","article-title":"Controlling the sensitivity of support vector machines","author":"veropoulos","year":"1999","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2889312"},{"key":"ref46","first-page":"1023","article-title":"Hybrid SVM algorithm oriented to classifying imbalanced datasets","volume":"35","author":"liu","year":"2018","journal-title":"J Chin Appl Res Comput"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2017.01.014"},{"key":"ref48","first-page":"1322","article-title":"ADASYN: Adaptive synthetic sampling approach for imbalanced learning","author":"he","year":"2008","journal-title":"Proc IEEE Int Joint Conf Neural Netw"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2907070"},{"key":"ref42","first-page":"425","article-title":"Adaptive semi-supervised affinity propagation clustering algorithm based on structural similarity","volume":"23","author":"wang","year":"2016","journal-title":"Tehnicki Vjesnik-Technical Gazette"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1002\/widm.53"},{"key":"ref44","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":"ref43","first-page":"273","article-title":"Semi-supervised affinity propagation clustering algorithm based on fireworks explosion optimization","author":"limin","year":"2015","journal-title":"Proc IEEE Int Conf Manage e-Commerce e-Government"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08721690.pdf?arnumber=8721690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T09:19:24Z","timestamp":1643275164000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8721690\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":63,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2918952","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}