{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T23:28:32Z","timestamp":1768692512148,"version":"3.49.0"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Natural Science Foundation of Guangxi","award":["2020GXNSFAA297173"],"award-info":[{"award-number":["2020GXNSFAA297173"]}]},{"name":"Natural Science Foundation of Guangxi","award":["2020GXNSFDA238017"],"award-info":[{"award-number":["2020GXNSFDA238017"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72361003"],"award-info":[{"award-number":["72361003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Sailing Program","award":["21YF1430300"],"award-info":[{"award-number":["21YF1430300"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Ind. Electron."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1109\/tie.2023.3331095","type":"journal-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T19:34:15Z","timestamp":1700595255000},"page":"11441-11452","source":"Crossref","is-referenced-by-count":9,"title":["An Efficient Mixed-Integer Programming Model for Nonintrusive Load Monitoring With Distributionally Robust Feature Extraction"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3277-5401","authenticated-orcid":false,"given":"Wei","family":"Li","sequence":"first","affiliation":[{"name":"School of Electrical Engineering, Guangxi University, Nanning, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5076-0813","authenticated-orcid":false,"given":"Xianyi","family":"He","sequence":"additional","affiliation":[{"name":"School of Computer, Electronic and Information, Guangxi University, Nanning, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9854-3529","authenticated-orcid":false,"given":"Linfeng","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and the Guangxi Key Laboratory of Multimedia Communication and Network Technology, Guangxi University, Nanning, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2676-9171","authenticated-orcid":false,"given":"Hui","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Guangxi University, Nanning, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2018.2815949"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2022.3189598"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/5.192069"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.enbuild.2022.111951"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2626389"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2017.08.203"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/EI247390.2019.9062124"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3400934.3400953"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.scs.2021.103202"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.enbuild.2021.111523"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2021.116616"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11873"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2020.2974347"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2021.3086226"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2021.3082622"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SICE.2008.4655131"},{"key":"ref17","first-page":"1","article-title":"Load disaggregation with metaheuristic optimization","author":"Egarter","year":"2015","journal-title":"Energieinformatik"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2015.2476777"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2016.2603479"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2018.2843292"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2925323"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2022.3152147"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2022.120295"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/IIAI-AAI.2019.00117"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2013.2289700"},{"key":"ref26","volume-title":"Integer Programming","author":"Wosely","year":"1998"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2019.0944"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2020.116081"},{"issue":"2","key":"ref29","first-page":"331","article-title":"Minimum updown polytopes of the unit commitment problem with start-up costs","volume":"119","author":"Rajan","year":"2010","journal-title":"IBM Corporation"},{"issue":"12","key":"ref30","first-page":"115","article-title":"Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations","volume":"171","author":"Esfahani","year":"2017","journal-title":"Math. Program."},{"issue":"1","key":"ref31","first-page":"517","article-title":"A robust learning approach for regression models based on distributionally robust optimization","volume":"19","author":"Chen","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"ref32","first-page":"1027","article-title":"K-means: The advantages of careful seeding","volume-title":"Proc. 18th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Arthur"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1038\/sdata.2016.37"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1038\/sdata.2016.122"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s12053-014-9306-2"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177013630"}],"container-title":["IEEE Transactions on Industrial Electronics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/41\/10547605\/10324503.pdf?arnumber=10324503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T04:52:40Z","timestamp":1717649560000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10324503\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":36,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tie.2023.3331095","relation":{},"ISSN":["0278-0046","1557-9948"],"issn-type":[{"value":"0278-0046","type":"print"},{"value":"1557-9948","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9]]}}}