Man Leung Wong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Man Leung Wong has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Kwong-Sak Leung
Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China
6 shared publications - Geng Cui
Department of Marketing and International Business, Lingnan University, Tuen Mun, Hong Kong
4 shared publications - Pak-Kan Wong
The Chinese University of Hong Kong
2 shared publications - Zusheng Tan
School of Data Science, Lingnan University, Hong Kong, China
2 shared publications Eric W.K. See-To
1 shared publication- Eric Wing Kuen See-To
Department of Computing and Decision Sciences, Lingnan University, Hong Kong
1 shared publication
Latest Publications
- 15 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 8 (1) , 377-388
A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems
Surrogate-assisted evolutionary algorithms for expensive optimization problems have gained considerable attention in recent years. In many real-world optimization problems, we may face expensive optimization problems with multiple optimal solutions. Locating multiple optima for such expensive problems is qualitatively challenging. This study proposes a surrogate-assisted differential evolution based on region decomposition to seek multiple optima for expensive multimodal optimization problems. In this study, we have designed three major components: 1) the adaptive region decomposition, 2) the multilayer perceptron-based global surrogate, and 3) the self-adaptive gradient descent-based local search. First, the improved adaptive region decomposition detects promising subregions at the beginning phase, and continuously discards inferior subregions successively. Second, the multilayer perceptron-based surrogate and self-adaptive gradient-based mutation work in a collaborative manner on distinct sub-populations to seek multiple optimal solutions. Overall, an attempt has been made to solve expensive multimodal optimization problems. Systematic experiments on 20 test functions show the encouraging and promising performance of our proposed approach.
- 15 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computational Intelligence
- Vol. 8 (1) , 377-388
A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems
Surrogate-assisted evolutionary algorithms for expensive optimization problems have gained considerable attention in recent years. In many real-world optimization problems, we may face expensive optimization problems with multiple optimal solutions. Locating multiple optima for such expensive problems is qualitatively challenging. This study proposes a surrogate-assisted differential evolution based on region decomposition to seek multiple optima for expensive multimodal optimization problems. In this study, we have designed three major components: 1) the adaptive region decomposition, 2) the multilayer perceptron-based global surrogate, and 3) the self-adaptive gradient descent-based local search. First, the improved adaptive region decomposition detects promising subregions at the beginning phase, and continuously discards inferior subregions successively. Second, the multilayer perceptron-based surrogate and self-adaptive gradient-based mutation work in a collaborative manner on distinct sub-populations to seek multiple optimal solutions. Overall, an attempt has been made to solve expensive multimodal optimization problems. Systematic experiments on 20 test functions show the encouraging and promising performance of our proposed approach.
- 23 October 2021
- Published by Springer Nature
- p. 259-285
Grammar-Based Multi-objective Genetic Programming with Token Competition and Its Applications in Financial Fraud Detection
- 23 October 2021
- Published by Springer Nature
- p. 259-285
Grammar-Based Multi-objective Genetic Programming with Token Competition and Its Applications in Financial Fraud Detection
- 1 June 2021
- Published by MIT Press in Evolutionary Computation
- Vol. 29 (2) , 239-268
Probabilistic Contextual and Structural Dependencies Learning in Grammar-Based Genetic Programming
Genetic Programming is a method to automatically create computer programs based on the principles of evolution. The problem of deceptiveness caused by complex dependencies among components of programs is challenging. It is important because it can misguide Genetic Programming to create suboptimal programs. Besides, a minor modification in the programs may lead to a notable change in the program behaviours and affect the final outputs. This article presents Grammar-Based Genetic Programming with Bayesian Classifiers (GBGPBC) in which the probabilistic dependencies among components of programs are captured using a set of Bayesian network classifiers. Our system was evaluated using a set of benchmark problems (the deceptive maximum problems, the royal tree problems, and the bipolar asymmetric royal tree problems). It was shown to be often more robust and more efficient in searching the best programs than other related Genetic Programming approaches in terms of the total number of fitness evaluation. We studied what factors affect the performance of GBGPBC and discovered that robust variants of GBGPBC were consistently weakly correlated with some complexity measures. Furthermore, our approach has been applied to learn a ranking program on a set of customers in direct marketing. Our suggested solutions help companies to earn significantly more when compared with other solutions produced by several well-known machine learning algorithms, such as neural networks, logistic regression, and Bayesian networks.
- 1 June 2021
- Published by MIT Press in Evolutionary Computation
- Vol. 29 (2) , 239-268
Probabilistic Contextual and Structural Dependencies Learning in Grammar-Based Genetic Programming
Genetic Programming is a method to automatically create computer programs based on the principles of evolution. The problem of deceptiveness caused by complex dependencies among components of programs is challenging. It is important because it can misguide Genetic Programming to create suboptimal programs. Besides, a minor modification in the programs may lead to a notable change in the program behaviours and affect the final outputs. This article presents Grammar-Based Genetic Programming with Bayesian Classifiers (GBGPBC) in which the probabilistic dependencies among components of programs are captured using a set of Bayesian network classifiers. Our system was evaluated using a set of benchmark problems (the deceptive maximum problems, the royal tree problems, and the bipolar asymmetric royal tree problems). It was shown to be often more robust and more efficient in searching the best programs than other related Genetic Programming approaches in terms of the total number of fitness evaluation. We studied what factors affect the performance of GBGPBC and discovered that robust variants of GBGPBC were consistently weakly correlated with some complexity measures. Furthermore, our approach has been applied to learn a ranking program on a set of customers in direct marketing. Our suggested solutions help companies to earn significantly more when compared with other solutions produced by several well-known machine learning algorithms, such as neural networks, logistic regression, and Bayesian networks.
- 1 November 2019
- Published by Elsevier in Expert Systems with Applications
- Vol. 135, 237-248
Probabilistic grammar-based neuroevolution for physiological signal classification of ventricular tachycardia
- 1 November 2019
- Published by Elsevier in Expert Systems with Applications
- Vol. 135, 237-248
Probabilistic grammar-based neuroevolution for physiological signal classification of ventricular tachycardia
- 19 November 2017
- Published by Springer Nature
- p. 255-266
Long-Short Term Memory Network for RNA Structure Profiling Super-Resolution
- 19 November 2017
- Published by Springer Nature
- p. 255-266
Long-Short Term Memory Network for RNA Structure Profiling Super-Resolution
- Open Access
- 28 December 2015
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 17 (1) , 77-79
Stephen H. Muggleton and Hiroaki Watanabe (Eds.): Latest advances in inductive logic programming
- 28 December 2015
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 17 (1) , 77-79
Open AccessStephen H. Muggleton and Hiroaki Watanabe (Eds.): Latest advances in inductive logic programming
- Open Access
- 25 November 2015
- Published by Springer Nature in BMC Bioinformatics
- Vol. 16 (1) , 1-28
High-order dynamic Bayesian Network learning with hidden common causes for causal gene regulatory network
Inferring gene regulatory network (GRN) has been an important topic in Bioinformatics. Many computational methods infer the GRN from high-throughput expression data. Due to the presence of time delays in the regulatory relationships, High-Order Dynamic Bayesian Network (HO-DBN) is a good model of GRN. However, previous GRN inference methods assume causal sufficiency, i.e. no unobserved common cause. This assumption is convenient but unrealistic, because it is possible that relevant factors have not even been conceived of and therefore un-measured. Therefore an inference method that also handles hidden common cause(s) is highly desirable. Also, previous methods for discovering hidden common causes either do not handle multi-step time delays or restrict that the parents of hidden common causes are not observed genes. We have developed a discrete HO-DBN learning algorithm that can infer also hidden common cause(s) from discrete time series expression data, with some assumptions on the conditional distribution, but is less restrictive than previous methods. We assume that each hidden variable has only observed variables as children and parents, with at least two children and possibly no parents. We also make the simplifying assumption that children of hidden variable(s) are not linked to each other. Moreover, our proposed algorithm can also utilize multiple short time series (not necessarily of the same length), as long time series are difficult to obtain. We have performed extensive experiments using synthetic data on GRNs of size up to 100, with up to 10 hidden nodes. Experiment results show that our proposed algorithm can recover the causal GRNs adequately given the incomplete data. Using the limited real expression data and small subnetworks of the YEASTRACT network, we have also demonstrated the potential of our algorithm on real data, though more time series expression data is needed.
- 25 November 2015
- Published by Springer Nature in BMC Bioinformatics
- Vol. 16 (1) , 1-28
Open AccessHigh-order dynamic Bayesian Network learning with hidden common causes for causal gene regulatory network
Inferring gene regulatory network (GRN) has been an important topic in Bioinformatics. Many computational methods infer the GRN from high-throughput expression data. Due to the presence of time delays in the regulatory relationships, High-Order Dynamic Bayesian Network (HO-DBN) is a good model of GRN. However, previous GRN inference methods assume causal sufficiency, i.e. no unobserved common cause. This assumption is convenient but unrealistic, because it is possible that relevant factors have not even been conceived of and therefore un-measured. Therefore an inference method that also handles hidden common cause(s) is highly desirable. Also, previous methods for discovering hidden common causes either do not handle multi-step time delays or restrict that the parents of hidden common causes are not observed genes. We have developed a discrete HO-DBN learning algorithm that can infer also hidden common cause(s) from discrete time series expression data, with some assumptions on the conditional distribution, but is less restrictive than previous methods. We assume that each hidden variable has only observed variables as children and parents, with at least two children and possibly no parents. We also make the simplifying assumption that children of hidden variable(s) are not linked to each other. Moreover, our proposed algorithm can also utilize multiple short time series (not necessarily of the same length), as long time series are difficult to obtain. We have performed extensive experiments using synthetic data on GRNs of size up to 100, with up to 10 hidden nodes. Experiment results show that our proposed algorithm can recover the causal GRNs adequately given the incomplete data. Using the limited real expression data and small subnetworks of the YEASTRACT network, we have also demonstrated the potential of our algorithm on real data, though more time series expression data is needed.
- 6 July 2013
- Published by Springer Nature
- p. 287-307
Data Mining Using Parallel Multi-objective Evolutionary Algorithms on Graphics Processing Units
- 6 July 2013
- Published by Springer Nature
- p. 287-307
Data Mining Using Parallel Multi-objective Evolutionary Algorithms on Graphics Processing Units
- 14 January 2012
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 13 (1) , 69-70
Evolutionary algorithms for data mining
- 14 January 2012
- Published by Springer Nature in Genetic Programming and Evolvable Machines
- Vol. 13 (1) , 69-70
Evolutionary algorithms for data mining