Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel J. Lizotte

dblp:l/DanielJLizotte · DBLP profile ↗
← Back
21ranked-venue papers
7as first author
3since 2021 · last 2026
0000-0002-9258-8619ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 17 · 6 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
8 papers
Reinforcement learning · 85% Probabilistic and Bayesian machine learning · 5% Motion planning and robot control · 3%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Medical and health informatics · 100%

Topics — the 19 heaviest of 20, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
multi-objective reinforcement learning
0.532016
Multi-Objective Markov Decision Processes for Data-Driven Decision Support · J. Mach. Learn. Res. 2016
Linear fitted-Q iteration with multiple reward functions · J. Mach. Learn. Res. 2012
Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled Trial Analysis · ICML 2010
Machine learning › Reinforcement learning › dynamic programming › value iteration
fitted q-iteration
0.422016
Multi-Objective Markov Decision Processes for Data-Driven Decision Support · J. Mach. Learn. Res. 2016
Linear fitted-Q iteration with multiple reward functions · J. Mach. Learn. Res. 2012
Machine learning › Reinforcement learning
value-based reinforcement learning
0.422016
Multi-Objective Markov Decision Processes for Data-Driven Decision Support · J. Mach. Learn. Res. 2016
Linear fitted-Q iteration with multiple reward functions · J. Mach. Learn. Res. 2012
Machine learning › Reinforcement learning › dynamic programming › value iteration
fitted value iteration
0.112011
Convergent Fitted Value Iteration with Linear Function Approximation · NIPS 2011
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
least squares regression
0.112011
Convergent Fitted Value Iteration with Linear Function Approximation · NIPS 2011
Machine learning › Reinforcement learning › function approximation
linear function approximation
0.112011
Convergent Fitted Value Iteration with Linear Function Approximation · NIPS 2011
Machine learning › Reinforcement learning › dynamic programming
value iteration
0.112011
Convergent Fitted Value Iteration with Linear Function Approximation · NIPS 2011
Medical and health informatics
clinical decision support
0.112016
Multi-Objective Markov Decision Processes for Data-Driven Decision Support · J. Mach. Learn. Res. 2016
Machine learning › Reinforcement learning
dynamic programming
0.112007
Stable Dual Dynamic Programming · NIPS 2007
Robotics › Motion planning and robot control › robot control › gait control
gait optimization
0.112007
Automatic Gait Optimization with Gaussian Process Regression · IJCAI 2007
Robotics › Legged, aerial and field robots › legged robots
legged robot locomotion
0.112007
Automatic Gait Optimization with Gaussian Process Regression · IJCAI 2007
Machine learning › Reinforcement learning
value function approximation
0.112007
Stable Dual Dynamic Programming · NIPS 2007
Machine learning › Reinforcement learning
bayesian reinforcement learning
0.112005
Bayesian sparse sampling for on-line reward optimization · ICML 2005
Machine learning › Reinforcement learning › exploration
exploration-exploitation tradeoff
0.112005
Bayesian sparse sampling for on-line reward optimization · ICML 2005
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
sparse sampling
0.112005
Bayesian sparse sampling for on-line reward optimization · ICML 2005
Machine learning › Reinforcement learning › multi-armed bandit
budgeted bandits
0.012004
The Budgeted Multi-armed Bandit Problem · COLT 2004
Machine learning › Reinforcement learning
multi-armed bandit
0.012004
The Budgeted Multi-armed Bandit Problem · COLT 2004
Medical and health informatics › drug development › clinical trial › clinical trial informatics
clinical trial analysis
0.012010
Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled Trial Analysis · ICML 2010
Machine learning › Optimization for machine learning › model-based optimization
bayesian optimization
0.012007
Automatic Gait Optimization with Gaussian Process Regression · IJCAI 2007

Methods — techniques the papers use, named apart from their topics

scalarization · 0.5sequential decision-making · 0.2sequential decision making · 0.2reinforcement learning · 0.2linear function approximation · 0.1minimax · 0.1constraint generation · 0.1gaussian process regression · 0.1function approximation · 0.1convergence analysis · 0.1bayesian posterior sampling · 0.1
YearPublicationVenuePosition
2026 Stacked one-vs-one (SOvO): A new approach for multi-class classification for sEMG recognition
abstract
Significant advancements have been made in applying machine learning techniques to the classification of surface electromyography (sEMG) signals. Despite these improvements, there remains considerable room for enhancing these methods to achieve even greater accuracy. This is particularly evident in complex sEMG classification problems, where the patterns across different classes can be very similar. This similarity often leads to reduced accuracy in both validation and test sets, highlighting the need for more refined approaches. This study aims to improve sEMG-based hand gesture recognition by introducing a novel Stacked One-vs-One (SOvO) classification approach. Traditional One-vs-One (OvO) strategies decompose multi-class problems into binary classifications but often suffer from cumulative errors of weak classifiers. The proposed SOvO method enhances classification by stacking the probability outputs from pairwise binary classifiers in the OvO approach on the training data as additional features for the final classification. Depending on whether the final classifier is a deep learning or conventional model, different feature integration strategies were explored. A comparative analysis was conducted on the Ninapro DB4, DB5, and DB6 datasets across two window sizes. Results show that SOvO consistently outperforms OvO in accuracy by 3% to 10%. This improvement is statistically significant, as confirmed by a repeated measures ANOVA ( p < 0.001). These findings demonstrate that SOvO provides a more robust and accurate framework for sEMG-based gesture recognition, addressing limitations of conventional OvO methods.
Maedeh Mohammadiazni, Daniel J. Lizotte, Ana Luisa Trejos
Pattern Recognit.2
2022 Smart Technology in the Home for People Living in the Community with Mental Illness and Physical Comorbidities
abstract
Abstract This study evaluated a smart technology intervention in the home as a support for individuals with severe mental illness. This study recruited 13 participants in a variety of community-based homes. Participants were offered a smartphone, a touchscreen monitor and health devices such as smartwatches, weigh-scales, and automated medication dispensers. Data was exported to the Lawson Integrated DataBase for care providers to monitor/track. Interviews with participants and focus groups with participants and care providers were conducted at baseline, 6-months and 12-months, and survey instruments were used to collect quantitative data about different dimensions of health and social determinants. Descriptive statistics from these outcome measures are presented as the sample size was too small for meaningful statistical inference. Qualitative analyses revealed a high degree of acceptability of the devices and motivation for healthy living, communication and mental health. Health Care Providers also noted improvements to client health. This study proves the feasibility of deploying smart technologies to support individuals with severe mental illness. Future scale-up would further our understanding of their impacts.
Cheryl Forchuk, Abraham Rudnick, Deborah Corring, Daniel J. Lizotte, Jeffrey S. Hoch, Richard Booth 0005, Barbara Frampton, Rupinder Mann, Jonathan Serrato
ICOST4
2021 Ecological Momentary Assessment extensions 3 (EMAX3) Proposal: An app for EMA-type research
abstract
Smartphones present unique data collection opportunities for research. Ecological momentary assessment (EMA) studies have been conducted using smartphones in many areas, as participant responses can be collected at the same time as device sensor data. We wanted to study undergraduate mental health using smartphones while investigating data from as many smartphone sensors as possible. The app used for this had to be accessible from the standard app stores to use existing participant phones. The software also had to have an easy setup process at the server-side due to limited resources. As a result, we developed the Ecological Momentary Assessment eXtensions platform. We describe the platform, two studies that used Version 2 of it, and summarize data collection results. We then outline a pathway to a unified EMAX3 app. To the best of our knowledge, EMAX is the only platform developed and used for sensor-based EMA research at a Canadian university.
Chris Brogly, Daniel J. Lizotte, Michael A. Bauer 0001
ISCC2
2020 Improving Access and Mental Health for Youth Through Virtual Models of Care
abstract
The overall objective of this research is to evaluate the use of a mobile health smartphone application (app) to improve the mental health of youth between the ages of 14–25 years, with symptoms of anxiety/depression. This project includes 115 youth who are accessing outpatient mental health services at one of three hospitals and two community agencies. The youth and care providers are using eHealth technology to enhance care. The technology uses mobile questionnaires to help promote self-assessment and track changes to support the plan of care. The technology also allows secure virtual treatment visits that youth can participate in through mobile devices. This longitudinal study uses participatory action research with mixed methods. The majority of participants identified themselves as Caucasian (66.9%). Expectedly, the demographics revealed that Anxiety Disorders and Mood Disorders were highly prevalent within the sample (71.9% and 67.5% respectively). Findings from the qualitative summary established that both staff and youth found the software and platform beneficial.
Cheryl Forchuk, Sandra Fisman, Jeffrey P. Reiss, Kerry Collins, Julie Eichstedt, Abraham Rudnick, Wanrudee Isaranuwatchai, Jeffrey S. Hoch, Xianbin Wang 0001, Daniel J. Lizotte, Shona Macpherson, Richard Booth 0005
ICOST10
2016 Multi-Objective Markov Decision Processes for Data-Driven Decision Support
abstract
We present new methodology based on Multi-Objective Markov Decision Processes for developing sequential decision support systems from data. Our approach uses sequential decision-making data to provide support that is useful to many different decision-makers, each with different, potentially time-varying preference. To accomplish this, we develop an extension of fitted-$Q$ iteration for multiple objectives that computes policies for all scalarization functions, i.e. preference functions, simultaneously from continuous-state, finite-horizon data. We identify and address several conceptual and computational challenges along the way, and we introduce a new solution concept that is appropriate when different actions have similar expected outcomes. Finally, we demonstrate an application of our method using data from the Clinical Antipsychotic Trials of Intervention Effectiveness and show that our approach offers decision-makers increased choice by a larger class of optimal policies.
Daniel J. Lizotte, Eric B. Laber
J. Mach. Learn. Res.1
2014 Scalable approximate policies for Markov decision process models of hospital elective admissions
George Zhu, Daniel J. Lizotte, Jesse Hoey
Artif. Intell. Medicine2
2014 Tracking people over time in 19th century Canada for longitudinal analysis
Maria-Luiza Antonie, Kris Inwood, Daniel J. Lizotte, J. Andrew Ross
Mach. Learn.3
2013 Generative Multiple-Instance Learning Models For Quantitative Electromyography
Tameem Adel, Benn Smith, Ruth Urner, Daniel W. Stashuk, Daniel J. Lizotte
UAI5
2012 Integrating Machine Learning Into a Medical Decision Support System to Address the Problem of Missing Patient Data
abstract
In this paper, we present a framework which enables medical decision making in the presence of partial information. At its core is ontology-based automated reasoning, machine learning techniques are integrated to enhance existing patient datasets in order to address the issue of missing data. Our approach supports interoperability between different health information systems. This is clarified in a sample implementation that combines three separate datasets (patient data, drug-drug interactions and drug prescription rules) to demonstrate the effectiveness of our algorithms in producing effective medical decisions. In short, we demonstrate the potential for machine learning to support a task where there is a critical need from medical professionals by coping with missing or noisy patient data and enabling the use of multiple medical datasets.
Atif Khan 0001, John A. Doucette, Robin Cohen, Daniel J. Lizotte
ICMLA (1)4
2012 An experimental methodology for response surface optimization methods
Daniel J. Lizotte, Russell Greiner, Dale Schuurmans
J. Glob. Optim.1
2012 Linear fitted-Q iteration with multiple reward functions
Daniel J. Lizotte, Michael H. Bowling, Susan A. Murphy
J. Mach. Learn. Res.1
2011 Convergent Fitted Value Iteration with Linear Function Approximation
abstract
Fitted value iteration (FVI) with ordinary least squares regression is known to diverge. We present a new method, "Expansion-Constrained Ordinary Least Squares" (ECOLS), that produces a linear approximation but also guarantees convergence when used with FVI. To ensure convergence, we constrain the least squares regression operator to be a non-expansion in the infinity-norm. We show that the space of function approximators that satisfy this constraint is more rich than the space of "averagers," we prove a minimax property of the ECOLS residual error, and we give an efficient algorithm for computing the coefficients of ECOLS based on constraint generation. We illustrate the algorithmic convergence of FVI with ECOLS in a suite of experiments, and discuss its properties.
Daniel J. Lizotte
NIPS1
2011 Informing sequential clinical decision-making through reinforcement learning: an empirical study
Susan M. Shortreed, Eric B. Laber, Daniel J. Lizotte, T. Scott Stroup, Joelle Pineau, Susan A. Murphy
Mach. Learn.3
2010 Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled Trial Analysis
Daniel J. Lizotte, Michael H. Bowling, Susan A. Murphy
ICML1
2007 Automatic Gait Optimization with Gaussian Process Regression
Daniel J. Lizotte, Michael H. Bowling, Dale Schuurmans
IJCAI1
2007 Stable Dual Dynamic Programming
abstract
Recently, we have introduced a novel approach to dynamic programming and re- inforcement learning that is based on maintaining explicit representations of sta- tionary distributions instead of value functions. In this paper, we investigate the convergence properties of these dual algorithms both theoretically and empirically, and show how they can be scaled up by incorporating function approximation.
Daniel J. Lizotte, Michael H. Bowling, Dale Schuurmans
NIPS2
2006 Improved Large Margin Dependency Parsing via Local Constraints and Laplacian Regularization
Qin Iris Wang, Colin Cherry, Daniel J. Lizotte, Dale Schuurmans
CoNLL3
2005 Bayesian sparse sampling for on-line reward optimization
abstract
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration versus exploitation tradeoff. Our approach combines sparse sampling with Bayesian exploration to achieve improved decision making while controlling computational cost. The idea is to grow a sparse lookahead tree, intelligently, by exploiting information in a Bayesian posterior---rather than enumerate action branches (standard sparse sampling) or compensate myopically (value of perfect information). The outcome is a flexible, practical technique for improving action selection in simple reinforcement learning scenarios.
Daniel J. Lizotte, Michael H. Bowling, Dale Schuurmans
ICML2
2004 The Budgeted Multi-armed Bandit Problem
Omid Madani, Daniel J. Lizotte, Russell Greiner
COLT2
2004 Active Model Selection
Omid Madani, Daniel J. Lizotte, Russell Greiner
UAI2
2003 Budgeted Learning of Naive-Bayes Classifiers
Daniel J. Lizotte, Omid Madani, Russell Greiner
UAI1