DADionne M. Aleman

Dionne M. Aleman

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Dionne M. Aleman has a total of 92 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Explainable one-class feature extraction by adaptive resonance for anomaly detection in quality assurance

    by Hootan Kamran, Dionne Aleman, Chris McIntosh, Tom Purdie

    In this study, we address the inherent challenges in radiotherapy (RT) plan quality assessment (QA). RT, a prevalent cancer treatment, utilizes high-energy beams to target tumors while sparing adjacent healthy tissues. Typically, an RT plan is refined through several QA cycles by experts to ensure it meets clinical and operational objectives before being considered safe for patient treatment. This iterative process tends to eliminate unacceptable plans, creating a significant class imbalance problem for machine learning efforts aimed at automating the classification of RT plans as either acceptable or not. The complexity of RT treatment plans, coupled with the aforementioned class imbalance issue, introduces a generalization problem that significantly hinders the efficacy of traditional binary classification approaches. We introduce a novel one-class classification framework, using an adaptive neural network architecture, that outperforms both traditional binary and standard one-class classification methods in this imbalanced and complex context, despite the inherent disadvantage of not learning from unacceptable plans. Unlike its predecessors, our method enhances anomaly detection for RT plan QA without compromising on interpretability—a critical feature in healthcare applications, where understanding and trust in automated decisions are paramount. By offering clear insights into decision-making processes, our method allows healthcare professionals to quickly identify and address specific deficiencies in RT plans deemed unacceptable, thereby streamlining the QA process and enhancing patient care efficiency and safety.


  • Differential impact of CD34+ cell dose for different age groups in allogeneic hematopoietic cell transplantation for acute leukemia: a machine learning–based discovery

    by Yiyang Qu, Hamed Shourabizadeh, Aravind Subramanian, Dionne M. Aleman, Louis-Martin Rousseau, Arjun D. Law, Auro Viswabandya, Fotios V. Michelis


  • A Branch-and-Price Algorithm Enhanced by Decision Diagrams for the Kidney Exchange Problem

    by Lizeth C. Riascos-Álvarez, Merve Bodur, Dionne M. Aleman

    Problem definition: Kidney paired donation programs allow patients registered with an incompatible donor to receive a suitable kidney from another donor, as long as the latter’s co-registered patient, if any, also receives a kidney from a different donor. The kidney exchange problem (KEP) aims to find an optimal collection of kidney exchanges taking the form of cycles and chains. Methodology/results: We develop the first decomposition method that is able to consider long cycles and long chains for projected large realistic instances. Particularly, we propose a branch-and-price framework in which the pricing problems are solved (for the first time in packing problems in a digraph) through multivalued decision diagrams. We present a new upper bound on the optimal value of the KEP, obtained via our master problem. Computational experiments show superior performance of our method over the state of the art by optimally solving almost all instances in the PrefLib library for multiple cycle and chain lengths. Managerial implications: Our algorithm also allows the prioritization of the solution composition, for example, chains over cycles or vice versa, and we conclude, similar to previous findings, that chains benefit the overall matching efficiency and highly sensitized patients. Funding: This work was supported by NSERC Discovery Grant (RGPIN-2021-02609). Supplemental Material: The e-companion is available at https://doi.org/10.1287/msom.2022.0192 .


  • Open Access

    The Complexity of Transferring Remote Monitoring and Virtual Care Technology Between Countries: Lessons From an International Workshop

    by Quynh Pham, David Wong, Kaylen J Pfisterer, Dionne Aleman, Nick Bansback, Joseph A Cafazzo, Alexander J Casson, Brian Chan, William Dixon, Gerasimos Kakaroumpas, et al.

    International deployment of remote monitoring and virtual care (RMVC) technologies would efficiently harness their positive impact on outcomes. Since Canada and the United Kingdom have similar populations, health care systems, and digital health landscapes, transferring digital health innovations between them should be relatively straightforward. Yet examples of successful attempts are scarce. In a workshop, we identified 6 differences that may complicate RMVC transfer between Canada and the United Kingdom and provided recommendations for addressing them. These key differences include (1) minority groups, (2) physical geography, (3) clinical pathways, (4) value propositions, (5) governmental priorities and support for digital innovation, and (6) regulatory pathways. We detail 4 broad recommendations to plan for sustainability, including the need to formally consider how highlighted country-specific recommendations may impact RMVC and contingency planning to overcome challenges; the need to map which pathways are available as an innovator to support cross-country transfer; the need to report on and apply learnings from regulatory barriers and facilitators so that everyone may benefit; and the need to explore existing guidance to successfully transfer digital health solutions while developing further guidance (eg, extending the nonadoption, abandonment, scale-up, spread, sustainability framework for cross-country transfer). Finally, we present an ecosystem readiness checklist. Considering these recommendations will contribute to successful international deployment and an increased positive impact of RMVC technologies. Future directions should consider characterizing additional complexities associated with global transfer.


  • Open Access

    A Branch-and-Price Algorithm Enhanced by Decision Diagrams for the Kidney Exchange Problem

    by Lizeth Carolina Riascos-Álvarez, Merve Bodur, Dionne M. Aleman

    Kidney paired donation programs allow patients registered with an incompatible donor to receive a suitable kidney from another donor, as long as the latter's co-registered patient, if any, also receives a kidney from a different donor. The kidney exchange problem (KEP) aims to find an optimal collection of kidney exchanges taking the form of cycles and chains. Existing exact solution methods for KEP either are designed for the case where only cyclic exchanges are considered, or can handle long chains but are scalable as long as cycles are short. We develop the first decomposition method that is able to deal with long cycles and long chains for large realistic instances. More specifically, we propose a branch-and-price framework, in which the pricing problems are solved (for the first time in packing problems in a digraph) through multi-valued decision diagrams. Also, we present a new upper bound on the optimal value of KEP, stronger than the one proposed in the literature, which is obtained via our master problem. Computational experiments show superior performance of our method over the state of the art by optimally solving almost all instances in the PrefLib library for multiple cycle and chain lengths.

  • Open Access

    The Complexity of Transferring Remote Monitoring and Virtual Care Technology Between Countries: Lessons From an International Workshop (Preprint)

    by Quynh Pham, David Wong, Kaylen J Pfisterer, Dionne Aleman, Nick Bansback, Joseph A Cafazzo, Alexander J Casson, Brian Chan, William Dixon, Gerasimos Kakaroumpas, et al.

    UNSTRUCTURED International deployment of remote monitoring and virtual care (RMVC) technologies would efficiently harness their positive impact on outcomes. Since Canada and the United Kingdom have similar populations, health care systems, and digital health landscapes, transferring digital health innovations between them should be relatively straightforward. Yet examples of successful attempts are scarce. In a workshop, we identified 6 differences that may complicate RMVC transfer between Canada and the United Kingdom and provided recommendations for addressing them. These key differences include (1) minority groups, (2) physical geography, (3) clinical pathways, (4) value propositions, (5) governmental priorities and support for digital innovation, and (6) regulatory pathways. We detail 4 broad recommendations to plan for sustainability, including the need to formally consider how highlighted country-specific recommendations may impact RMVC and contingency planning to overcome challenges; the need to map which pathways are available as an innovator to support cross-country transfer; the need to report on and apply learnings from regulatory barriers and facilitators so that everyone may benefit; and the need to explore existing guidance to successfully transfer digital health solutions while developing further guidance (eg, extending the nonadoption, abandonment, scale-up, spread, sustainability framework for cross-country transfer). Finally, we present an ecosystem readiness checklist. Considering these recommendations will contribute to successful international deployment and an increased positive impact of RMVC technologies. Future directions should consider characterizing additional complexities associated with global transfer.

  • Open Access

    A Feasibility-Seeking Approach to Two-stage Robust Optimization in Kidney Exchange

    by Lizeth Carolina Riascos-Alvarez, Merve Bodur, Dionne M. Aleman

    Kidney paired donation programs (KPDPs) match patients with willing but incompatible donors to compatible donors with an assurance that when they donate, their intended recipient receives a kidney in return from a different donor. A patient and donor join a KPDP as a pair, represented as a vertex in a compatibility graph, where arcs represent compatible kidneys flowing from a donor in one pair to a patient in another. A challenge faced in real-world KPDPs is the possibility of a planned match being cancelled, e.g., due to late detection of organ incompatibility or patient-donor dropout. We therefore develop a two-stage robust optimization approach to the kidney exchange problem wherein (1) the first stage determines a kidney matching solution according to the original compatibility graph, and then (2) the second stage repairs the solution after observing transplant cancellations. In addition to considering homogeneous failure, we present the first approach that considers non-homogeneous failure between vertices and arcs. To this end, we develop solution algorithms with a feasibility-seeking master problem and evaluate two types of recourse policies. Our framework outperforms the state-of-the-art kidney exchange algorithm under homogeneous failure on publicly available instances. Moreover, we provide insights on the scalability of our solution algorithms under non-homogeneous failure for two recourse policies and analyze their impact on highly-sensitized patients, patients for whom few kidney donors are available and whose associated exchanges tend to fail at a higher rate than non-sensitized patients.

  • Spatio-Temporal Clustering of Multi-Location Time Series to Model Seasonal Influenza Spread

    by Hootan Kamran, Dionne M. Aleman, Michael W. Carter, Kieran M. Moore

    Although seasonal influenza disease spread is a spatio-temporal phenomenon, public surveillance systems aggregate data only spatially, and are rarely predictive. We develop a hierarchical clustering-based machine learning tool to anticipate flu spread patterns based on historical spatio-temporal flu activity, where we use historical influenza-related emergency department records as a proxy for flu prevalence. This analysis replaces conventional geographical hospital clustering with clusters based on both spatial and temporal distance between hospital flu peaks to generate a network illustrating whether flu spreads between pairs of clusters (direction) and how long that spread takes (magnitude). To overcome data sparsity, we take a model-free approach, treating hospital clusters as a fully-connected network, where arcs indicate flu transmission. We perform predictive analysis on the clusters' time series of flu ED visits to determine direction and magnitude of flu travel. Detection of recurrent spatio-temporal patterns may help policymakers and hospitals better prepare for outbreaks. We apply this tool to Ontario, Canada using a five-year historical dataset of daily flu-related ED visits, and find that in addition to expected flu spread between major cities/airport regions, we were able to illuminate previously unsuspected patterns of flu spread between non-major cities, providing new insights for public health officials. We showed that while a spatial clustering outperforms a temporal clustering in terms of the direction of the spread (81% spatial v. 71% temporal), the opposite is true in terms of the magnitude of the time lag (20% spatial v. 70% temporal).


  • SuPART: supervised projective adapted resonance theory for automatic quality assurance approval of radiotherapy treatment plans

    by Hootan Kamran, Dionne M Aleman, Chris McIntosh, Thomas G Purdie

    Radiotherapy is a common treatment modality for the treatment of cancer, where treatments must be carefully designed to deliver appropriate dose to targets while avoiding healthy organs. The comprehensive multi-disciplinary quality assurance (QA) process in radiotherapy is designed to ensure safe and effective treatment plans are delivered to patients. However, the plan QA process is expensive, often time-intensive, and requires review of large quantities of complex data, potentially leading to human error in QA assessment. We therefore develop an automated machine learning algorithm to identify ‘acceptable’ plans (plans that are similar to historically approved plans) and ‘unacceptable’ plans (plans that are dissimilar to historically approved plans). This algorithm is a supervised extension of projective adaptive resonance theory, called SuPART, that learns a set of distinctive features, and considers deviations from them indications of unacceptable plans. We test SuPART on breast and prostate radiotherapy datasets from our institution, and find that SuPART outperforms common classification algorithms in several measures of accuracy. When no falsely approved plans are allowed, SuPART can correctly auto-approve 34% of the acceptable breast and 32% of the acceptable prostate plans, and can also correctly reject 53% of the unacceptable breast and 56% of the unacceptable prostate plans. Thus, usage of SuPART to aid in QA could potentially yield significant time savings.