{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T05:50:38Z","timestamp":1740981038911,"version":"3.38.0"},"reference-count":31,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T00:00:00Z","timestamp":1719187200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Information Visualization"],"published-print":{"date-parts":[[2024,10]]},"abstract":" Decision Trees (DTs) stand out as a prevalent choice among supervised Machine Learning algorithms. These algorithms form binary structures, effectively dividing data into smaller segments based on distinct rules. Consequently, DTs serve as a learning mechanism to identify optimal rules for the separation and classification of all elements within a dataset. Due to their resemblance to rule-based decisions, DTs are easy to interpret. Additionally, their minimal need for data pre-processing and versatility in handling various data types make DTs highly practical and user-friendly across diverse domains. Nevertheless, when confronted with extensive datasets or ensembles involving multiple trees, such as Random Forests, its analysis can become challenging. To facilitate the examination and validation of these models, we have developed a visual tool that incorporates a range of visualisations providing both an overview and detailed insights into a set of DTs. Our tool is designed to offer diverse perspectives on the same data, enabling a deeper understanding of the decision-making process. This article outlines our design approach, introduces various visualisation models, and details the iterative validation process. We validate our methodology through a telecommunications use case, specifically employing the visual tool to decipher how a DT-based model determines the optimal communication channel (i.e. phone call, email, SMS) for a telecommunication operator to use when contacting a client. <\/jats:p>","DOI":"10.1177\/14738716241260745","type":"journal-article","created":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T06:25:21Z","timestamp":1719296721000},"page":"312-327","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["Visualisation of Random Forest classification"],"prefix":"10.1177","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4511-5763","authenticated-orcid":false,"given":"Catarina","family":"Ma\u00e7\u00e3s","sequence":"first","affiliation":[{"name":"University of Coimbra Centre for Informatics and Systems, Coimbra, Portugal"}]},{"given":"Jo\u00e3o R","family":"Campos","sequence":"additional","affiliation":[{"name":"University of Coimbra Centre for Informatics and Systems, Coimbra, Portugal"}]},{"given":"Nuno","family":"Louren\u00e7o","sequence":"additional","affiliation":[{"name":"University of Coimbra Centre for Informatics and Systems, Coimbra, Portugal"}]},{"given":"Penousal","family":"Machado","sequence":"additional","affiliation":[{"name":"University of Coimbra Centre for Informatics and Systems, Coimbra, Portugal"}]}],"member":"179","published-online":{"date-parts":[[2024,6,24]]},"reference":[{"key":"bibr1-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijhcs.2006.07.005"},{"volume-title":"Arti\ufb01cial intelligence: a modern approach","year":"2021","author":"Russell S","key":"bibr2-14738716241260745"},{"key":"bibr3-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"bibr4-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2018.2864475"},{"key":"bibr5-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45357-1_61"},{"key":"bibr6-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1006\/ijhc.2001.0499"},{"key":"bibr7-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1016\/j.cageo.2009.02.006"},{"key":"bibr8-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1109\/VAST.2011.6102453"},{"key":"bibr9-14738716241260745","doi-asserted-by":"publisher","DOI":"10.5937\/jaes17-21960"},{"key":"bibr10-14738716241260745","first-page":"152","volume-title":"Applied stochastic model and data analysis international conference","author":"Pham N","year":"2007"},{"key":"bibr11-14738716241260745","first-page":"23","volume-title":"ACM SIGKDD workshop on visual data mining proceedings","author":"Ankerst M","year":"2001"},{"key":"bibr12-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1109\/CIC.2008.4749124"},{"key":"bibr13-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1184032"},{"key":"bibr14-14738716241260745","first-page":"149","author":"Barlow S","year":"2001","journal-title":"Infovis"},{"key":"bibr15-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1007\/BF01898350"},{"volume-title":"Proceedings of the twenty-fifth annual SAS users group international conference","year":"2000","author":"Friendly M","key":"bibr16-14738716241260745"},{"key":"bibr17-14738716241260745","volume-title":"CEUR workshop proceedings","volume":"2327","author":"Di Castro F","year":"2019"},{"issue":"1","key":"bibr18-14738716241260745","first-page":"342352","volume":"25","author":"Ming Y","year":"2018","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"bibr19-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1007\/s12650-021-00782-y"},{"key":"bibr20-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12935"},{"key":"bibr21-14738716241260745","unstructured":"Welling S, Refsgaard H, Brockhoff P, et al. Forest \ufb02oor visualizations of random forests. arXiv preprint:1605.09196, 2016."},{"key":"bibr22-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2020.3030354"},{"journal-title":"Random forest visualization","year":"2014","author":"Kuznetsova N","key":"bibr23-14738716241260745"},{"key":"bibr24-14738716241260745","first-page":"639","author":"Yang M","year":"2012","journal-title":"Internet of things"},{"key":"bibr25-14738716241260745","unstructured":"Parr T, Grover P. How to visualize decision tree, https:\/\/explained.ai\/decision-tree-viz\/ (2020, accessed 3 February 2023)."},{"key":"bibr26-14738716241260745","unstructured":"Bostock M. D3.js -data-driven documents, https:\/\/d3js.org\/what-is-d3 (2012, accessed 03 February 2023)."},{"key":"bibr27-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1145\/3236386.3241340"},{"key":"bibr28-14738716241260745","first-page":"1461","author":"Biran O","year":"2017","journal-title":"IJCAI"},{"key":"bibr29-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2018.2865940"},{"volume-title":"Information visualization: perception for design","year":"2019","author":"Ware C","key":"bibr30-14738716241260745"},{"key":"bibr31-14738716241260745","doi-asserted-by":"publisher","DOI":"10.1145\/1518701.1518897"}],"container-title":["Information Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14738716241260745","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/14738716241260745","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/14738716241260745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T19:49:11Z","timestamp":1740944951000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/14738716241260745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,24]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["10.1177\/14738716241260745"],"URL":"https:\/\/doi.org\/10.1177\/14738716241260745","relation":{},"ISSN":["1473-8716","1473-8724"],"issn-type":[{"type":"print","value":"1473-8716"},{"type":"electronic","value":"1473-8724"}],"subject":[],"published":{"date-parts":[[2024,6,24]]}}}