Alert button
Picture for Nayyar Zaidi

Nayyar Zaidi

Alert button

Adaptive Population-based Simulated Annealing for Uncertain Resource Constrained Job Scheduling

Oct 31, 2022
Dhananjay Thiruvady, Su Nguyen, Yuan Sun, Fatemeh Shiri, Nayyar Zaidi, Xiaodong Li

Figure 1 for Adaptive Population-based Simulated Annealing for Uncertain Resource Constrained Job Scheduling
Figure 2 for Adaptive Population-based Simulated Annealing for Uncertain Resource Constrained Job Scheduling
Figure 3 for Adaptive Population-based Simulated Annealing for Uncertain Resource Constrained Job Scheduling
Figure 4 for Adaptive Population-based Simulated Annealing for Uncertain Resource Constrained Job Scheduling

Transporting ore from mines to ports is of significant interest in mining supply chains. These operations are commonly associated with growing costs and a lack of resources. Large mining companies are interested in optimally allocating their resources to reduce operational costs. This problem has been previously investigated in the literature as resource constrained job scheduling (RCJS). While a number of optimisation methods have been proposed to tackle the deterministic problem, the uncertainty associated with resource availability, an inevitable challenge in mining operations, has received less attention. RCJS with uncertainty is a hard combinatorial optimisation problem that cannot be solved efficiently with existing optimisation methods. This study proposes an adaptive population-based simulated annealing algorithm that can overcome the limitations of existing methods for RCJS with uncertainty including the premature convergence, the excessive number of hyper-parameters, and the inefficiency in coping with different uncertainty levels. This new algorithm is designed to effectively balance exploration and exploitation, by using a population, modifying the cooling schedule in the Metropolis-Hastings algorithm, and using an adaptive mechanism to select perturbation operators. The results show that the proposed algorithm outperforms existing methods across a wide range of benchmark RCJS instances and uncertainty levels. Moreover, new best known solutions are discovered for all but one problem instance across all uncertainty levels.

Viaarxiv icon

Proximity Forest: An effective and scalable distance-based classifier for time series

Aug 31, 2018
Benjamin Lucas, Ahmed Shifaz, Charlotte Pelletier, Lachlan O'Neill, Nayyar Zaidi, Bart Goethals, Francois Petitjean, Geoffrey I. Webb

Figure 1 for Proximity Forest: An effective and scalable distance-based classifier for time series
Figure 2 for Proximity Forest: An effective and scalable distance-based classifier for time series
Figure 3 for Proximity Forest: An effective and scalable distance-based classifier for time series
Figure 4 for Proximity Forest: An effective and scalable distance-based classifier for time series

Research into the classification of time series has made enormous progress in the last decade. The UCR time series archive has played a significant role in challenging and guiding the development of new learners for time series classification. The largest dataset in the UCR archive holds 10 thousand time series only; which may explain why the primary research focus has been in creating algorithms that have high accuracy on relatively small datasets. This paper introduces Proximity Forest, an algorithm that learns accurate models from datasets with millions of time series, and classifies a time series in milliseconds. The models are ensembles of highly randomized Proximity Trees. Whereas conventional decision trees branch on attribute values (and usually perform poorly on time series), Proximity Trees branch on the proximity of time series to one exemplar time series or another; allowing us to leverage the decades of work into developing relevant measures for time series. Proximity Forest gains both efficiency and accuracy by stochastic selection of both exemplars and similarity measures. Our work is motivated by recent time series applications that provide orders of magnitude more time series than the UCR benchmarks. Our experiments demonstrate that Proximity Forest is highly competitive on the UCR archive: it ranks among the most accurate classifiers while being significantly faster. We demonstrate on a 1M time series Earth observation dataset that Proximity Forest retains this accuracy on datasets that are many orders of magnitude greater than those in the UCR repository, while learning its models at least 100,000 times faster than current state of the art models Elastic Ensemble and COTE.

* 30 pages, 12 figures 
Viaarxiv icon

Accurate parameter estimation for Bayesian Network Classifiers using Hierarchical Dirichlet Processes

May 08, 2018
Francois Petitjean, Wray Buntine, Geoffrey I. Webb, Nayyar Zaidi

Figure 1 for Accurate parameter estimation for Bayesian Network Classifiers using Hierarchical Dirichlet Processes
Figure 2 for Accurate parameter estimation for Bayesian Network Classifiers using Hierarchical Dirichlet Processes
Figure 3 for Accurate parameter estimation for Bayesian Network Classifiers using Hierarchical Dirichlet Processes
Figure 4 for Accurate parameter estimation for Bayesian Network Classifiers using Hierarchical Dirichlet Processes

This paper introduces a novel parameter estimation method for the probability tables of Bayesian network classifiers (BNCs), using hierarchical Dirichlet processes (HDPs). The main result of this paper is to show that improved parameter estimation allows BNCs to outperform leading learning methods such as Random Forest for both 0-1 loss and RMSE, albeit just on categorical datasets. As data assets become larger, entering the hyped world of "big", efficient accurate classification requires three main elements: (1) classifiers with low-bias that can capture the fine-detail of large datasets (2) out-of-core learners that can learn from data without having to hold it all in main memory and (3) models that can classify new data very efficiently. The latest Bayesian network classifiers (BNCs) satisfy these requirements. Their bias can be controlled easily by increasing the number of parents of the nodes in the graph. Their structure can be learned out of core with a limited number of passes over the data. However, as the bias is made lower to accurately model classification tasks, so is the accuracy of their parameters' estimates, as each parameter is estimated from ever decreasing quantities of data. In this paper, we introduce the use of Hierarchical Dirichlet Processes for accurate BNC parameter estimation. We conduct an extensive set of experiments on 68 standard datasets and demonstrate that our resulting classifiers perform very competitively with Random Forest in terms of prediction, while keeping the out-of-core capability and superior classification time.

Viaarxiv icon