{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T03:26:31Z","timestamp":1775445991638,"version":"3.50.1"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","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\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61433008"],"award-info":[{"award-number":["61433008"]}],"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":["U143520006"],"award-info":[{"award-number":["U143520006"]}],"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":["61472071"],"award-info":[{"award-number":["61472071"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["N171605001"],"award-info":[{"award-number":["N171605001"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019,1,1]]},"DOI":"10.1109\/tkde.2018.2822662","type":"journal-article","created":{"date-parts":[[2018,4,3]],"date-time":"2018-04-03T19:02:55Z","timestamp":1522782175000},"page":"166-180","source":"Crossref","is-referenced-by-count":17,"title":["Order-Sensitive Imputation for Clustered Missing Values"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6473-9523","authenticated-orcid":false,"given":"Qian","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7422-6254","authenticated-orcid":false,"given":"Yu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang-Chien","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.66"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.019"},{"key":"ref30","first-page":"733","article-title":"Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained\n scheduling","author":"ambuhl","year":"2011","journal-title":"Proc 48th Annu IEEE Symp Found Comput Sci"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2008.08.006"},{"key":"ref11","first-page":"3221","article-title":"Accelerating t-sne\n using tree-based algorithms","volume":"15","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.2307\/2282639"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0253-7"},{"key":"ref14","first-page":"75","article-title":"ERACER:\n A database approach for statistical inference and data cleaning","author":"mayfield","year":"2010","journal-title":"Proc ACM SIGMOD Int Conf Manage Data"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809989"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1198\/tech.2003.s167"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.6.520"},{"key":"ref18","first-page":"32","article-title":"Parimputation: From imputation and null-imputation to partially\n imputation","volume":"9","author":"zhang","year":"2008","journal-title":"TCII"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.059"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","article-title":"Sequencing jobs to minimize total weighted completion time subject\n to precedence constraints","volume":"2","author":"lawler","year":"1978","journal-title":"Ann Discr Math"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31537-4_6"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.03.016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.99"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.22"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbp059"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.03.108"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2014.6865697"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623623"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71701-0_122"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20841-6_11"},{"key":"ref20","first-page":"4705","article-title":"A novel hybrid approach to estimating missing values in databases using k-nearest neighbors and\n neural networks","volume":"7","author":"aydilek","year":"2012","journal-title":"Int J Innovative Comput Inf Control"},{"key":"ref22","first-page":"441","article-title":"CKNNI: An improved KNN-based missing value handling technique","author":"jiang","year":"2015","journal-title":"Proc Int Conf Intell Comput"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INDIN.2006.275767"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiolchem.2007.07.001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FSKD.2009.407"},{"key":"ref26","first-page":"2332","article-title":"Order-sensitive missing value imputation technology for\n multi-source sensory data","volume":"27","author":"ma","year":"2016","journal-title":"J Softw"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-5-160"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8566021\/08330055.pdf?arnumber=8330055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:11Z","timestamp":1657746851000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8330055\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":33,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2822662","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,1]]}}}