ORCID Profile
0000-0001-5290-8051
Current Organisations
Amsterdam UMC
,
Deakin University
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.
Research Topics
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.
Top 4 Research Topics
ANZSRC Field of Research (FoR)
Optimisation | Numerical and Computational Mathematics | Approximation Theory and Asymptotic Methods
ANZSRC Socio-Economic Objective (SEO)
Related Links
Publications
Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
Publisher: Informa UK Limited
Date: 14-09-2017
Characterization Theorem for Best Polynomial Spline Approximation with Free Knots, Variable Degree and Fixed Tails
Publisher: Springer Science and Business Media LLC
Date: 05-01-2017
Optimality conditions and optimization methods for quartic polynomial optimization
Publisher: Elsevier BV
Date: 04-2014
Detection of outlier behaviour amongst health/medical providers servicing TAC clients
Publisher: Springer Singapore
Date: 2018
An algorithm for minimizing clustering functions
Publisher: Informa UK Limited
Date: 08-2005
Balancing and reconciling large multi-regional input–output databases using parallel optimisation and high-performance computing
Publisher: Springer Science and Business Media LLC
Date: 19-01-2019
An agile group aware process beyond CRISP-DM: A hospital data mining case study
Publisher: ACM
Date: 19-05-2017
Compiling and using input-output frameworks through collaborative virtual laboratories
Publisher: Elsevier BV
Date: 07-2014
DOI: 10.1016/J.SCITOTENV.2014.03.062
Abstract: Compiling, deploying and utilising large-scale databases that integrate environmental and economic data have traditionally been labour- and cost-intensive processes, hindered by the large amount of disparate and misaligned data that must be collected and harmonised. The Australian Industrial Ecology Virtual Laboratory (IELab) is a novel, collaborative approach to compiling large-scale environmentally extended multi-region input-output (MRIO) models. The utility of the IELab product is greatly enhanced by avoiding the need to lock in an MRIO structure at the time the MRIO system is developed. The IELab advances the idea of the "mother-daughter" construction principle, whereby a regionally and sectorally very detailed "mother" table is set up, from which "daughter" tables are derived to suit specific research questions. By introducing a third tier - the "root classification" - IELab users are able to define their own mother-MRIO configuration, at no additional cost in terms of data handling. Customised mother-MRIOs can then be built, which maximise disaggregation in aspects that are useful to a family of research questions. The second innovation in the IELab system is to provide a highly automated collaborative research platform in a cloud-computing environment, greatly expediting workflows and making these computational benefits accessible to all users. Combining these two aspects realises many benefits. The collaborative nature of the IELab development project allows significant savings in resources. Timely deployment is possible by coupling automation procedures with the comprehensive input from multiple teams. User-defined MRIO tables, coupled with high performance computing, mean that MRIO analysis will be useful and accessible for a great many more research applications than would otherwise be possible. By ensuring that a common set of analytical tools such as for hybrid life-cycle assessment is adopted, the IELab will facilitate the harmonisation of fragmented, dispersed and misaligned raw data for the benefit of all interested parties.
Almost simplicial polytopes: the lower and upper bound theorems
Publisher: Centre pour la Communication Scientifique Directe (CCSD)
Date: 22-04-2020
DOI: 10.46298/DMTCS.6369
Abstract: this is an extended abstract of the full version. We study n-vertex d-dimensional polytopes with at most one nonsimplex facet with, say, d + s vertices, called almost simplicial polytopes. We provide tight lower and upper bounds for the face numbers of these polytopes as functions of d, n and s, thus generalizing the classical Lower Bound Theorem by Barnette and Upper Bound Theorem by McMullen, which treat the case s = 0. We characterize the minimizers and provide ex les of maximizers, for any d.
Interventional radiology in obstetric patients: A population‐based record linkage study of use and outcomes
Publisher: Wiley
Date: 26-01-2023
DOI: 10.1111/AOGS.14508
Abstract: Interventional radiology (IR) is a technique for controlling hemorrhage and preserving fertility for women with serious obstetric conditions such as placenta accreta spectrum (PAS) or postpartum hemorrhage. This study examined maternal, pregnancy and hospital characteristics and outcomes for women receiving IR in pregnancy and postpartum. A population‐based record linkage study was conducted, including all women who gave birth in hospital in New South Wales or the major tertiary hospital in the neighboring Australian Capital Territory, Australia, between 2003 and 2019. Data were obtained from birth and hospital records. Characteristics and outcomes of women who underwent IR in pregnancy or postpartum are described. Outcomes following IR were compared in a high‐risk cohort of women: those with PAS who had a planned cesarean with hysterectomy. Women were grouped by those who did and those who did did not have IR and were matched using propensity score and other factors. We identified IR in 236 pregnancies of 1 584 708 (15.0 per 100 000), including 208 in the delivery and 26 in a postpartum admission. Two‐thirds of women receiving IR in the birth admission received a transfusion of red cells or blood products, 28% underwent hysterectomy and 12.5% were readmitted within 6 weeks. Other complications included: severe maternal morbidity (29.8%), genitourinary tract trauma/repair (17.3%) and deep vein thrombosis ulmonary embolism (4.3%). Outcomes for women with PAS who underwent planned cesarean with hysterectomy were similar for those who did and did not receive IR, with a small reduction in transfusion requirement for those who received IR. Interventional radiology is infrequently used in pregnant women. In our study it was performed at a limited number of hospitals, largely tertiary centers, with the level of adverse outcomes reflecting use in a high‐risk population. For women with PAS undergoing planned cesarean with hysterectomy, most outcomes were similar for those receiving IR and those not receiving IR, but IR may reduce bleeding.
Patient admission prediction using a pruned fuzzy min–max neural network with rule extraction
Publisher: Springer Science and Business Media LLC
Date: 05-06-2015
Fast modified global k-means algorithm for incremental cluster construction
Publisher: Elsevier BV
Date: 04-2011
An Algorithm for Best Generalised Rational Approximation of Continuous Functions
Publisher: Springer Science and Business Media LLC
Date: 28-02-2022
Nonsmooth nonconvex optimization approach to clusterwise linear regression problems
Publisher: Elsevier BV
Date: 08-2013
Chebyshev Approximation by Linear Combinations of Fixed Knot Polynomial Splines with Weighting Functions
Publisher: Springer Science and Business Media LLC
Date: 05-02-2016
Linkedness of Cartesian products of complete graphs
Publisher: University of Primorska Press
Date: 27-05-2022
Generalised rational approximation and its application to improve deep learning classifiers
Publisher: Elsevier BV
Date: 2021
An efficient algorithm for the incremental construction of a piecewise linear classifier
Publisher: Elsevier BV
Date: 06-2011
The linkedness of cubical polytopes: The cube
Publisher: The Electronic Journal of Combinatorics
Date: 27-08-2021
DOI: 10.37236/9848
Abstract: The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is $k$-linked if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the vertices in the pairs. We say that a polytope is $k$-linked if its graph is $k$-linked. We establish that the $d$-dimensional cube is $\\lfloor (d+1)/2 \\rfloor$-linked, for every $d\\ne 3$ this is the maximum possible linkedness of a $d$-polytope. This result implies that, for every $d\\geqslant 1$, a cubical $d$-polytope is $\\lfloor d/2\\rfloor$-linked, which answers a question of Wotzlaw (Incidence graphs and unneighborly polytopes, Ph.D. thesis, 2009). Finally, we introduce the notion of strong linkedness, which is slightly stronger than that of linkedness. A graph $G$ is strongly $k$-linked if it has at least $2k+1$ vertices and, for every vertex $v$ of $G$, the subgraph $G-v$ is $k$-linked. We show that cubical 4-polytopes are strongly $2$-linked and that, for each $d\\geqslant 1$, $d$-dimensional cubes are strongly $\\lfloor d/2\\rfloor$-linked.
Characterisation theorem for best polynomial spline approximation with free knots
Publisher: American Mathematical Society (AMS)
Date: 17-03-2017
DOI: 10.1090/TRAN/6863
Abstract: In this paper, we derive a necessary condition for a best approximation by piecewise polynomial functions. We apply nonsmooth nonconvex analysis to obtain this result, which is also a necessary and sufficient condition for inf-stationarity in the sense of Demyanov-Rubinov. We start from identifying a special property of the knots. Then, using this property, we construct a characterisation theorem for best free-knots polynomial spline approximation, which is stronger than the existing characterisation results, at least in the case when only continuity is required.
Optimal Placement of Access Point in WLAN Based on a New Algorithm
Publisher: IEEE
Date: 2005
DOI: 10.1109/ICMB.2005.75
A novel piecewise linear classifier based on polyhedral conic and max–min separabilities
Publisher: Springer Science and Business Media LLC
Date: 19-11-2011
A generalisation of de la Vallée-Poussin procedure to multivariate approximations
Publisher: Springer Science and Business Media LLC
Date: 07-01-2022
Piecewise Linear Classifiers Based on Nonsmooth Optimization Approaches
Publisher: Springer New York
Date: 2014
Finite Alternation Theorems and a Constructive Approach to Piecewise Polynomial Approximation in Chebyshev Norm
Publisher: Springer Science and Business Media LLC
Date: 07-02-2020
Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
Publisher: Elsevier BV
Date: 05-2016
Nonsmooth Optimization Algorithm for Solving Clusterwise Linear Regression Problems
Publisher: Springer Science and Business Media LLC
Date: 15-04-2014
Texture image classification using pixel N-grams
Publisher: IEEE
Date: 08-2017
Piecewise Partially Separable Functions and a Derivative-free Algorithm for Large Scale Nonsmooth Optimization
Publisher: Springer Science and Business Media LLC
Date: 06-2006
Lower bound theorems for general polytopes
Publisher: Elsevier BV
Date: 06-2019
Chebyshev Multivariate Polynomial Approximation and Point Reduction Procedure
Publisher: Springer Science and Business Media LLC
Date: 22-11-2019
Multivariate approximation by polynomial and generalized rational functions
Publisher: Informa UK Limited
Date: 03-03-2022
Detecting K-complexes for sleep stage identification using nonsmooth optimization
Publisher: Cambridge University Press (CUP)
Date: 04-2012
DOI: 10.1017/S1446181112000016
Abstract: The process of sleep stage identification is a labour-intensive task that involves the specialized interpretation of the polysomnographic signals captured from a patient’s overnight sleep session. Automating this task has proven to be challenging for data mining algorithms because of noise, complexity and the extreme size of data. In this paper we apply nonsmooth optimization to extract key features that lead to better accuracy. We develop a specific procedure for identifying K -complexes, a special type of brain wave crucial for distinguishing sleep stages. The procedure contains two steps. We first extract “easily classified” K -complexes, and then apply nonsmooth optimization methods to extract features from the remaining data and refine the results from the first step. Numerical experiments show that this procedure is efficient for detecting K -complexes. It is also found that most classification methods perform significantly better on the extracted features.
Global optimality conditions and optimization methods for polynomial programming problems
Publisher: Springer Science and Business Media LLC
Date: 27-03-2015
Workload coverage through nonsmooth optimization
Publisher: Informa UK Limited
Date: 04-2009
A modified parallel optimization system for updating large-size time-evolving flow matrix
Publisher: Elsevier BV
Date: 07-2012
Classification through incremental max–min separability
Publisher: Springer Science and Business Media LLC
Date: 03-12-2010
On the Reconstruction of Polytopes
Publisher: Springer Science and Business Media LLC
Date: 19-04-2019
Bivariate rational approximations of the general temperature integral
Publisher: Springer Science and Business Media LLC
Date: 07-08-2021
Connectivity of cubical polytopes
Publisher: Elsevier BV
Date: 2020
The excess degree of a polytope
Publisher: Society for Industrial & Applied Mathematics (SIAM)
Date: 2018
DOI: 10.1137/17M1131994
Pixel N-grams for mammographic lesion classification
Publisher: IEEE
Date: 04-2017
Polytopes Close to Being Simple
Publisher: Springer Science and Business Media LLC
Date: 19-12-2020
An algorithm for clusterwise linear regression based on smoothing techniques
Publisher: Springer Science and Business Media LLC
Date: 14-05-2014
Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
Publisher: Canadian Mathematical Society
Date: 21-05-2018
DOI: 10.4153/S0008414X18000123
Abstract: We study $n$ -vertex $d$ -dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called almost simplicial polytopes . We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$ , and $s$ , thus generalizing the classical Lower Bound Theorem by Barnette and the Upper Bound Theorem by McMullen, which treat the case where $s=0$ . We characterize the minimizers and provide ex les of maximizers for any $d$ . Our construction of maximizers is a generalization of cyclic polytopes, based on a suitable variation of the moment curve, and is of independent interest.
Global optimality conditions and optimization methods for constrained polynomial programming problems
Publisher: Elsevier BV
Date: 07-2015
Codifferential method for minimizing nonsmooth DC functions
Publisher: Springer Science and Business Media LLC
Date: 07-2010
Implementation of novel methods of global and nonsmooth optimization: GANSO programming library
Publisher: Informa UK Limited
Date: 10-2007
Classes and clusters in data analysis
Publisher: Elsevier BV
Date: 09-2006
Related Organisations
Related Funding Activities
Discovery Projects - Grant ID: DP180100602
Start Date: 08-2018
End Date: 12-2023
Amount: $362,045.00
Funder: Australian Research Council
View Funded Activity