{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T09:38:50Z","timestamp":1775036330162,"version":"3.50.1"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:00:00Z","timestamp":1760400000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:00:00Z","timestamp":1760400000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,14]]},"DOI":"10.1109\/cw68232.2025.00048","type":"proceedings-article","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:50:39Z","timestamp":1774986639000},"page":"293-295","source":"Crossref","is-referenced-by-count":0,"title":["One-vs-Rest Decision Trees: Enhancing Cluster Interpretability Through Focused Explanations and Visualization*"],"prefix":"10.1109","author":[{"given":"Yankong","family":"Zhang","sequence":"first","affiliation":[{"name":"Hefei University of technology,Hefei,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuetong","family":"Luo","sequence":"additional","affiliation":[{"name":"Hefei University of technology,Hefei,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoping","family":"Liu","sequence":"additional","affiliation":[{"name":"Hefei University of technology,Hefei,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-023-02958-z"},{"key":"ref2","volume-title":"Cluster Explanation via Polyhedral Descriptions","author":"Lawless","year":"2022"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.9790\/3021-0204719725"},{"key":"ref4","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume-title":"Proc. KDD","author":"Ester","year":"1996"},{"key":"ref5","article-title":"Top-down induction of clustering trees","volume":"cs\/0011032","author":"Blockeel","year":"2000","journal-title":"arXiv preprint"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-020-05896-2"},{"key":"ref7","first-page":"7055","article-title":"Explainable k-means and k-medians clustering","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Moshkovitz","year":"2020"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/vast.2011.6102453"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2020.2995100"}],"event":{"name":"2025 International Conference on Cyberworlds (CW\uff09","location":"Jinzhong, China","start":{"date-parts":[[2025,10,14]]},"end":{"date-parts":[[2025,10,16]]}},"container-title":["2025 International Conference on Cyberworlds (CW\uff09"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11455361\/11455414\/11455443.pdf?arnumber=11455443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T06:57:07Z","timestamp":1775026627000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11455443\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,14]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/cw68232.2025.00048","relation":{},"subject":[],"published":{"date-parts":[[2025,10,14]]}}}