ORCID Profile
0000-0002-6694-9572
Current Organisation
University of Queensland
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Artificial Intelligence and Image Processing | Neural Networks, Genetic Alogrithms And Fuzzy Logic | Health Information Systems (incl. Surveillance) | Pattern Recognition and Data Mining | Manufacturing Engineering | Health Information Systems (Incl. Surveillance) | Robotics And Mechatronics | Aerospace Structures | Flexible Manufacturing Systems | Astronomy And Astrophysics |
Expanding Knowledge in the Information and Computing Sciences | Health and Support Services not elsewhere classified | Information processing services | Health and support services not elsewhere classified | Higher education | Industrial machinery and equipment | Physical sciences | Machined products | Aerospace equipment
Publisher: Oxford University Press (OUP)
Date: 06-2005
Publisher: IEEE
Date: 08-2013
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: ACM
Date: 08-07-2009
Publisher: University of Queensland Library
Date: 2000
DOI: 10.14264/157842
Publisher: Elsevier BV
Date: 2017
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: IEEE
Date: 2002
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2003
Publisher: Oxford University Press (OUP)
Date: 08-05-2006
Publisher: IEEE
Date: 12-2010
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: ACM
Date: 13-07-2019
Publisher: IEEE
Date: 06-2012
Publisher: Springer Science and Business Media LLC
Date: 2002
Publisher: Springer Science and Business Media LLC
Date: 03-2013
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2020
Publisher: Elsevier BV
Date: 04-2019
DOI: 10.1016/J.JSAT.2019.01.020
Abstract: Clinical staff providing addiction treatment predict patient outcome poorly. Prognoses based on linear statistics are rarely replicated. Addiction is a complex non-linear behavior. Incorporating non-linear models, Machine Learning (ML) has successfully predicted treatment outcome when applied in other areas of medicine. Using identical assessment data across the two groups, this study compares the accuracy of ML models versus clinical staff to predict alcohol dependence treatment outcome in behavior therapy using patient data only. Machine learning models (n = 28) were constructed ('trained') using demographic and psychometric assessment data from 780 previously treated patients who had undertaken a 12 week, abstinence-based Cognitive Behavioral Therapy program for alcohol dependence. Independent predictions applying assessment data for an additional 50 consecutive patients were obtained from 10 experienced addiction therapists and the 28 trained ML models. The predictive accuracy of the ML models and the addiction therapists was then compared with further investigation of the 10 best models selected by cross-validated accuracy on the training-set. Variables selected as important for prediction by staff and the most accurate ML model were examined. The most accurate ML model (Fuzzy Unordered Rule Induction Algorithm, 74%) was significantly more accurate than the four least accurate clinical staff (51%-40%). However, the robustness of this finding may be limited by the moderate area under the receiver operator curve (AUC = 0.49). There was no significant difference in mean aggregate predictive accuracy between 10 clinical staff (56.1%) and the 28 best models (58.57%). Addiction therapists favoured demographic and consumption variables compared with the ML model using more questionnaire subscales. The majority of staff and ML models were not more accurate than suggested by chance. However, the best performing prediction models may provide useful adjunctive information to standard clinically available prognostic data to more effectively target treatment approaches in clinical settings.
Publisher: Springer Science and Business Media LLC
Date: 12-06-2014
Publisher: Springer International Publishing
Date: 27-12-2016
Publisher: IEEE
Date: 2003
Publisher: ACM
Date: 25-11-2021
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer International Publishing
Date: 2018
Publisher: MIT Press
Date: 03-2018
DOI: 10.1162/EVCO_A_00247
Abstract: Exploratory Landscape Analysis provides s le-based methods to calculate features of black-box optimization problems in a quantitative and measurable way. Many problem features have been proposed in the literature in an attempt to provide insights into the structure of problem landscapes and to use in selecting an effective algorithm for a given optimization problem. While there has been some success, evaluating the utility of problem features in practice presents some significant challenges. Machine learning models have been employed as part of the evaluation process, but they may require additional information about the problems as well as having their own hyper-parameters, biases and experimental variability. As a result, extra layers of uncertainty and complexity are added into the experimental evaluation process, making it difficult to clearly assess the effect of the problem features. In this article, we propose a novel method for the evaluation of problem features which can be applied directly to in idual or groups of features and does not require additional machine learning techniques or confounding experimental factors. The method is based on the feature's ability to detect a prior ranking of similarity in a set of problems. Analysis of Variance (ANOVA) significance tests are used to determine if the feature has successfully distinguished the successive problems in the set. Based on ANOVA test results, a percentage score is assigned to each feature for different landscape characteristics. Experimental results for twelve different features on four problem transformations demonstrate the method and provide quantitative evidence about the ability of different problem features to detect specific properties of problem landscapes.
Publisher: IEEE
Date: 2007
Publisher: IEEE
Date: 06-2008
Publisher: Elsevier BV
Date: 03-2013
Publisher: Elsevier BV
Date: 09-2006
Publisher: American Geophysical Union (AGU)
Date: 05-2007
DOI: 10.1029/2006WR005347
Publisher: Springer Berlin Heidelberg
Date: 2007
Publisher: Elsevier BV
Date: 02-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2014
Publisher: IEEE
Date: 09-2007
Publisher: ACM
Date: 08-07-2009
Publisher: Springer Science and Business Media LLC
Date: 10-03-2016
Publisher: IEEE
Date: 2003
Publisher: ACM
Date: 25-06-2005
Publisher: MIT Press - Journals
Date: 06-2012
DOI: 10.1162/EVCO_A_00070
Abstract: In this paper we extend a previously proposed randomized landscape generator in combination with a comparative experimental methodology to study the behavior of continuous metaheuristic optimization algorithms. In particular, we generate two-dimensional landscapes with parameterized, linear ridge structure, and perform pairwise comparisons of algorithms to gain insight into what kind of problems are easy and difficult for one algorithm instance relative to another. We apply this methodology to investigate the specific issue of explicit dependency modeling in simple continuous estimation of distribution algorithms. Experimental results reveal specific ex les of landscapes (with certain identifiable features) where dependency modeling is useful, harmful, or has little impact on mean algorithm performance. Heat maps are used to compare algorithm performance over a large number of landscape instances and algorithm trials. Finally, we perform a meta-search in the landscape parameter space to find landscapes which maximize the performance between algorithms. The results are related to some previous intuition about the behavior of these algorithms, but at the same time lead to new insights into the relationship between dependency modeling in EDAs and the structure of the problem landscape. The landscape generator and overall methodology are quite general and extendable and can be used to examine specific features of other algorithms.
Publisher: Elsevier BV
Date: 12-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2011
Publisher: Wiley
Date: 26-03-2020
DOI: 10.1111/ADD.15038
Publisher: AIP
Date: 2012
DOI: 10.1063/1.4759615
Publisher: Wiley
Date: 21-11-2012
DOI: 10.1002/SIM.5684
Abstract: Emergency department access block is an urgent problem faced by many public hospitals today. When access block occurs, patients in need of acute care cannot access inpatient wards within an optimal time frame. A widely held belief is that access block is the end product of a long causal chain, which involves poor discharge planning, insufficient bed capacity, and inadequate admission intensity to the wards. This paper studies the last link of the causal chain-the effect of admission intensity on access block, using data from a metropolitan hospital in Australia. We applied several modern statistical methods to analyze the data. First, we modeled the admission events as a nonhomogeneous Poisson process and estimated time-varying admission intensity with penalized regression splines. Next, we established a functional linear model to investigate the effect of the time-varying admission intensity on emergency department access block. Finally, we used functional principal component analysis to explore the variation in the daily time-varying admission intensities. The analyses suggest that improving admission practice during off-peak hours may have most impact on reducing the number of ED access blocks.
Publisher: IEEE
Date: 12-2008
Publisher: Springer Science and Business Media LLC
Date: 25-09-2017
Publisher: Elsevier BV
Date: 03-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2006
Publisher: IEEE
Date: 2007
Publisher: ACM
Date: 15-07-2023
Publisher: IEEE
Date: 09-2012
Publisher: Elsevier BV
Date: 07-2007
Publisher: MIT Press - Journals
Date: 03-2005
Abstract: Evolutionary algorithms perform optimization using a population of s le solution points. An interesting development has been to view population-based optimization as the process of evolving an explicit, probabilistic model of the search space. This paper investigates a formal basis for continuous, population-based optimization in terms of a stochastic gradient descent on the Kullback-Leibler ergence between the model probability density and the objective function, represented as an unknown density of assumed form. This leads to an update rule that is related and compared with previous theoretical work, a continuous version of the population-based incremental learning algorithm, and the generalized mean shift clustering framework. Experimental results are presented that demonstrate the dynamics of the new algorithm on a set of simple test problems.
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: IEEE
Date: 10-2010
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2010
Publisher: Springer International Publishing
Date: 2018
Publisher: IEEE
Date: 06-2019
Publisher: IEEE
Date: 12-2008
Publisher: Springer Science and Business Media LLC
Date: 15-10-2018
Publisher: Elsevier BV
Date: 02-2019
Publisher: Springer Science and Business Media LLC
Date: 25-10-2006
Publisher: IEEE
Date: 2003
Start Date: 06-2008
End Date: 12-2012
Amount: $126,728.00
Funder: Australian Research Council
View Funded ActivityStart Date: 12-2016
End Date: 06-2020
Amount: $191,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 09-2005
End Date: 09-2006
Amount: $69,438.00
Funder: Australian Research Council
View Funded ActivityStart Date: 03-2013
End Date: 12-2016
Amount: $150,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2005
End Date: 06-2008
Amount: $74,944.00
Funder: Australian Research Council
View Funded Activity