{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T08:09:54Z","timestamp":1775722194322,"version":"3.50.1"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Science Foundation","award":["CNS 1439011"],"award-info":[{"award-number":["CNS 1439011"]}]},{"name":"National Science Foundation","award":["ECCS 1731672"],"award-info":[{"award-number":["ECCS 1731672"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,8,1]]},"DOI":"10.1109\/tkde.2018.2792021","type":"journal-article","created":{"date-parts":[[2018,1,11]],"date-time":"2018-01-11T20:06:46Z","timestamp":1515701206000},"page":"1575-1587","source":"Crossref","is-referenced-by-count":25,"title":["SDE: A Novel Clustering Framework Based on Sparsity-Density Entropy"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1960-0367","authenticated-orcid":false,"given":"Sheng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5148-1399","authenticated-orcid":false,"given":"Jun","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5247-9370","authenticated-orcid":false,"given":"Haibo","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.156"},{"key":"ref38","article-title":"Feature selection via eigenvector centrality","author":"roffo","year":"2016","journal-title":"New Frontiers in Mining Complex Patterns in Conjunction with Ecml\/pkdd"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SIU.2015.7129814"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/695720"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.181"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2011.83"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.215"},{"key":"ref36","first-page":"266","article-title":"Generalized fisher score for\n feature selection","author":"gu","year":"2011","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500098"},{"key":"ref34","first-page":"959","article-title":"Sparsity score: A new\n filter feature selection method based on graph","author":"liu","year":"2012","journal-title":"Proc Int Conf Pattern Recognit"},{"key":"ref28","first-page":"689","article-title":"An improved DENCLUE algorithm for data\n clustering","author":"idrissi","year":"2015","journal-title":"Proc IEEE Int Conf Inform Commun Technol Accessibility Icta"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304187"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1823854.1823897"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","article-title":"Data\n clustering: A review","volume":"31","author":"jain","year":"2015","journal-title":"ACM Comput Surv"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.80"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.02.039"},{"key":"ref21","first-page":"849","article-title":"On spectral\n clustering: Analysis and an algorithm","author":"ng","year":"2001","journal-title":"Proc Conf Neural Inf Process Syst Natural Synth"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICSSSM.2007.4280175"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.5120\/12132-8235"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1998.655795"},{"key":"ref25","first-page":"1","article-title":"A density based algorithm for discovering\n density varied clusters in large spatial databases","volume":"3","author":"jalal","year":"2010","journal-title":"Int J Comput Appl"},{"key":"ref50","first-page":"33","article-title":"Solving the problem of\n the k parameter in the KNN classifier using an ensemble learning approach","volume":"12","author":"hassanat","year":"2014","journal-title":"Comput Sci"},{"key":"ref51","article-title":"On enhancing the performance of nearest neighbour classifiers using hassanat distance metric","volume":"9","author":"alkasassbeh","year":"2015","journal-title":"Canadian Journal of Pure and Applied Sciences"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020555"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2005\/09\/P09008"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-011-9250-x"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1016\/j.jpdc.2011.03.007","article-title":"Parallel WaveCluster: A linear scaling parallel clustering algorithm implementation with\n application to very large datasets","volume":"71","author":"yildirim","year":"2011","journal-title":"J Parallel Distrib Comput"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2493537"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2373355"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.259"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2009.2012919"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2654445"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2535367"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2749574"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.118"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/72.846731"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2009.11.007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.039"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(00)00022-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.262"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/2.781637"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(01)00008-4"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.239"},{"key":"ref9","article-title":"A survey of grid based clustering algorithms","volume":"2","author":"ilango","year":"2010","journal-title":"Int J Eng Sci Technol"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2015.2437512"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.06.019"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1048"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2545657"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273641"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.65"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.198"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2441716"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/69\/8405649\/8254398-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8405649\/08254398.pdf?arnumber=8254398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:49:03Z","timestamp":1649443743000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8254398\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,1]]},"references-count":53,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2792021","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2018,8,1]]}}}