SCSiang Yew Chong

Siang Yew Chong

*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


Siang Yew Chong has a total of 35 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Estimation of Hitting Time by Hitting Probability for Elitist Evolutionary Algorithms

    by Jun He, Siang Yew Chong, Xin Yao

    Drift analysis is one of the main tools for analyzing the time complexity of evolutionary algorithms. However, it requires manual construction of drift functions to bound hitting time for each specific algorithm and problem. To address this limitation, linear drift functions were introduced for elitist evolutionary algorithms. But calculating good linear bound coefficients remains a problem. This paper proposes a new method called drift analysis of hitting probability to compute these coefficients. Each coefficient is interpreted as a bound on the hitting probability of a fitness level, transforming the task of estimating hitting time into estimating hitting probability. A new drift analysis method is then developed to estimate hitting probability, where paths are introduced to handle multimodal fitness landscapes. Explicit expressions are constructed to compute hitting probability, significantly simplifying the estimation process. An advantage of the proposed method is its ability to estimate both the lower and upper bounds of hitting time and to compare the performance of two algorithms in terms of hitting time. To demonstrate this application, two algorithms for the knapsack problem, each incorporating feasibility rules and greedy repair respectively, are compared. The analysis indicates that neither constraint handling technique consistently outperforms the other.


  • Open Access

    Portfolio Optimization with Translation of Representation for Transport Problems

    by Malgorzata Zajecka, Mateusz Mastalerczyk, Siang Yew Chong, Xin Yao, Joanna Kwiecien, Wojciech Chmiel, Jacek Dajda, Marek Kisiel-Dorohinicki, Aleksander Byrski

    The paper presents a hybridization of two ideas closely related to metaheuristic computing, namely Portfolio Optimization (researched by Xin Yao et al.) and Translation of Representation for different metaheuristics (researched by Byrski et al.). Thus, difficult problems (discrete optimization) are approached by a sequential run through a number of steps of different metaheuristics, providing the translation of representation (since the algorithms are completely different). Therefore, close cooperation of e.g. ACO, PSO, and GA is possible. The results refer to unaltered algorithms and show the superiority of the constructed hybrid.


  • Open Access

    Compound W-Net with Fully Accumulative Residual Connections for Liver Segmentation Using CT Images

    by Mahmoud Abdelazim Khattab, Iman Yi Liao, Ean Hin Ooi, Siang Yew Chong

    Computed tomography (CT) is a common modality for liver diagnosis, treatment, and follow-up process. Providing accurate liver segmentation using CT images is a crucial step towards those tasks. In this paper, we propose a stacked 2-U-Nets model with three different types of skip connections. The proposed connections work to recover the loss of high-level features on the convolutional path of the first U-Net due to the pooling and the loss of low-level features during the upsampling path of the first U-Net. The skip connections concatenate all the features that are generated at the same level from the previous paths to the inputs of the convolutional layers in both paths of the second U-Net in a densely connected manner. We implement two versions of the model with different number of filters at each level of each U-Net by maximising the Dice similarity between the predicted liver region and that of the ground truth. The proposed models were trained with 3Dircadb public dataset that were released for Sliver and 3D liver and tumour segmentation challenges during MICCAI 2007-2008 challenge. The experimental results show that the proposed model outperformed the original U-Net and 2-U-Nets variants, and is comparable to the state-of-the-art mU-Net, DC U-Net, and Cascaded UNET.


  • Open Access

    An Empirical Study of Several Information Theoretic Based Feature Extraction Methods for Classifying High Dimensional Low Sample Size Data

    by Sheena Leeza Verghese, Iman Yi Liao, Tomas H. Maul, Siang Yew Chong

    A high dimensional low sample size (HDLSS) dataset typically contains many features but a limited number of samples. It is commonly found in domains such as microarray data and medical imaging. When sample size is small, the population probability density function (PDF) of a HDLSS dataset may not be well represented, causing difficulties of applying feature selection or feature extraction methods for HDLSS data classification. In this paper, we explore the possibility of designing feature selection and feature extraction methods for HDLSS data classification by making loose assumption on the underlying PDF of a HDLSS dataset. Specifically, we propose to leverage on Correlation Explanation (CorEx), a recent unsupervised probabilistic graphical model that assumes (hierarchical) hidden structure for generating subsets of features that are conditionally independent. We benchmark the proposed method against frequently cited Information Theory based feature extraction and feature selection methods, including Conditional Infomax Feature Extraction (CIFE), Maximum Relevance Minimum Redundancy (MRMR), Maximization of Mutual Information (MMI), Infomax Independent Component Analysis (Infomax ICA),and Kernel Entropy Component Analysis (KECA). The HDLSS datasets used in this study are Breast Cancer Dataset by Gravier et. al and West et. al, Colon Cancer dataset by Alon et. al., Leukemia Dataset by Golub et.al and the Gisette Dataset used by Guyon et. al. Experimental results demonstrate that the proposed method shows some improvement in classification performance over MMI, and Infomax ICA and is competitive with MRMR and CIFE.


  • A New Framework for Analysis of Coevolutionary Systems—Directed Graph Representation and Random Walks

    by Siang Yew Chong, Peter Tiňo, Jun He, Xin Yao

    Studying coevolutionary systems in the context of simplified models (i.e., games with pairwise interactions between coevolving solutions modeled as self plays) remains an open challenge since the rich underlying structures associated with pairwise-comparison-based fitness measures are often not taken fully into account. Although cyclic dynamics have been demonstrated in several contexts (such as intransitivity in coevolutionary problems), there is no complete characterization of cycle structures and their effects on coevolutionary search. We develop a new framework to address this issue. At the core of our approach is the directed graph (digraph) representation of coevolutionary problems that fully captures structures in the relations between candidate solutions. Coevolutionary processes are modeled as a specific type of Markov chains—random walks on digraphs. Using this framework, we show that coevolutionary problems admit a qualitative characterization: a coevolutionary problem is either solvable (there is a subset of solutions that dominates the remaining candidate solutions) or not. This has an implication on coevolutionary search. We further develop our framework that provides the means to construct quantitative tools for analysis of coevolutionary processes and demonstrate their applications through case studies. We show that coevolution of solvable problems corresponds to an absorbing Markov chain for which we can compute the expected hitting time of the absorbing class. Otherwise, coevolution will cycle indefinitely and the quantity of interest will be the limiting invariant distribution of the Markov chain. We also provide an index for characterizing complexity in coevolutionary problems and show how they can be generated in a controlled manner.


  • Open Access

    The effect of speed limit credibility on drivers' speed choice

    by Yee Mun Lee, Siang Yew Chong, Karen Goonting, Elizabeth Sheppard


  • Open Access

    Curvature Flight Path for Particle Swarm Optimisation

    by Cheng Wai Kheng, Day Chyi Ku, Hui Fuang Ng, Mahmoud Khattab, Siang Yew Chong

    An optimisation is a process of finding maxima or minima of the objective function. Particle Swarm Optimisation (PSO) is a nature-inspired, meta-heuristic, black box optimisation algorithm used to search for global minimum or maximum in the solution space. The sampling strategy in this algorithm mimics the flying pattern of a swarm, where each sample is generated randomly according to uniform distribution among three different locations, which marks the current particle location, the individual best found location, and the best found location for the entire swam over all generation. The PSO has known disadvantage of premature convergence in problems with high correlated design variables (high epistatis). However, there is limited research conducted in finding the main reason why the algorithm fails to locate better solutions in these problems. In this paper, we propose to change the traditional triangular flight trajectory of PSO to an elliptical flight path. The new flying method is tested and compared with the traditional triangular flight trajectory of PSO on five high epistatis benchmark problems. Our results show that the samples generated from the elliptical flight path are generally better than the traditional triangular flight trajectory of PSO in term of average fitness and the fitness of best found solution.

  • Guest Editorial: Special Issue on Understanding Complex Evolutionary Systems

    by Daniel Ashlock, Graham Kendall, Siang Yew Chong

    Evolutionary computation research frequently relies on the analysis of the time, and know solutions or measures of the quality of solutions found as metrics for comparing different selection schemes, representations, and operators. While these are important tools, more nuanced tools are helpful even when trying to understand relatively simple evolutionary optimizers, and can be critical when coevolution or multicriteria optimization is being performed. The range of useful tools is broad, including theorems, visualizations, new metrics, and novel analysis techniques. This Special Issue presents six papers that include all of these. The purpose of this Special Issue is to expand our tool set for understanding the behavior of complex evolutionary systems. In the judgement of this writer, it is a good beginning, giving many examples, surveying known techniques, presenting new techniques, and giving many possible next steps. A brief summary of each article is provided.

  • Complex Coevolutionary Dynamics—Structural Stability and Finite Population Effects

    by Peter Tino, Siang Yew Chong, Xin Yao

    Unlike evolutionary dynamics, coevolutionary dynamics can exhibit a wide variety of complex regimes. This has been confirmed by numerical studies, e.g., in the context of evolutionary game theory (EGT) and population dynamics of simple two-strategy games with various types of replication and selection mechanisms. Using the framework of shadowing lemma, we study to what degree can such infinite population dynamics: 1) be reliably simulated on finite precision computers; and 2) be trusted to represent coevolutionary dynamics of possibly very large, but finite, populations. In a simple EGT setting of two-player symmetric games with two pure strategies and a polymorphic equilibrium, we prove that for (μ,λ), truncation, sequential tournament, best-of-group tournament, and linear ranking selections, the coevolutionary dynamics do not possess the shadowing property. In other words, infinite population simulations cannot be guaranteed to represent real trajectories or to be representative of coevolutionary dynamics of potentially very large, but finite, populations.