Qi Chen

Qi Chen

Auto-generated profile, based on publicly available information

Qi Chen

Victoria University of Wellington

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 May 2019 in Journal of the Royal Society of New Zealand
Verified
Journal Article
Closed access
HAHarith Al-Sahaf
Harith Al-Sahaf
YBYing Bi
Ying Bi
QCQi Chen
Qi Chen
ALAndrew Lensen
Andrew Lensen
YMYi Mei
Yi Mei
MZMengjie Zhang
Mengjie Zhang
Artificial intelligence (AI) emphasises the creation of intelligent machines/systems that function like humans. AI has been applied to many real‐world applications. Machine learning is a branch of AI based on the idea that systems can learn from data, identify hidden patterns, and make decisions with little/minimal human intervention. Evolutionary computation is an umbrella of population‐based intelligent/learning algorithms inspired by nature, where New Zealand has a good international reputation. This paper provides a review on evolutionary machine learning, i.e. evolutionary computation techniques for major machine learning tasks such as classification, regression and clustering, and emerging topics including combinatorial optimisation, computer vision, deep learning, transfer learning, and ensemble learning. The paper also provides a brief review of evolutionary learning applications, such as supply chain and manufacturing for milk/dairy, wine and seafood industries, which are important to New Zealand. Finally, the paper presents current issues with future perspectives in evolutionary machine learning.

28 November 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
YMYi Mei
Yi Mei
QCQi Chen
Qi Chen
ALAndrew Lensen
Andrew Lensen
Bing XueBing Xue
Bing Xue
MZMengjie Zhang
Mengjie Zhang
Explainable artificial intelligence has received great interest in the recent decade, due to its importance in critical application domains such as self-driving cars, law and healthcare. Genetic programming is a powerful evolutionary algorithm for machine learning. Compared with other standard machine learning models such as neural networks, the models evolved by GP tend to be more interpretable due to their model structure with symbolic components. However, interpretability has not been explicitly considered in genetic programming until recently, following the surge in popularity of explainable artificial intelligence. This paper provides a comprehensive review of the studies on genetic programming that can potentially improve the model interpretability, both explicitly and implicitly, as a byproduct. We group the existing studies related to explainable artificial intelligence by genetic programming into two categories. The first category considers the intrinsic interpretability, aiming to directly evolve more interpretable (and effective) models by genetic programming. The second category focuses on post-hoc interpretability, which uses genetic programming to explain other black-box machine learning models, or explain the models evolved by genetic programming by simpler models such as linear models. This comprehensive survey demonstrates the strong potential of genetic programming for improving the interpretability of machine learning models and balancing the complex trade-off between model accuracy and interpretability.

16 March 2017 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
QCQi Chen
Qi Chen
MZMengjie Zhang
Mengjie Zhang
Bing XueBing Xue
Bing Xue
When learning from high-dimensional data for symbolic regression (SR), genetic programming (GP) typically could not generalize well. Feature selection, as a data preprocessing method, can potentially contribute not only to improving the efficiency of learning algorithms but also to enhancing the generalization ability. However, in GP for high-dimensional SR, feature selection before learning is seldom considered. In this paper, we propose a new feature selection method based on permutation to select features for high-dimensional SR using GP. A set of experiments has been conducted to investigate the performance of the proposed method on the generalization of GP for high-dimensional SR. The regression results confirm the superior performance of the proposed method over the other examined feature selection methods. Further analysis indicates that the models evolved by the proposed method are more likely to contain only the truly relevant features and have better interpretability.


24 September 2018 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
QCQi Chen
Qi Chen
Bing XueBing Xue
Bing Xue
MZMengjie Zhang
Mengjie Zhang
Geometric semantic genetic programming has recently attracted much attention. The key innovations are inducing a unimodal fitness landscape in the semantic space and providing a theoretical framework for designing geometric semantic operators. The geometric semantic operators aim to manipulate the semantics of programs by making a bounded semantic impact and generating child programs with similar or better behaviour than their parents. These properties are shown to be highly related to a notable generalisation improvement in genetic programming. However, the potential ineffectiveness and difficulties in bounding the variations in these geometric operators still limits their positive effect on generalisation. This work attempts to further explore the geometry and search space of geometric operators to gain a greater generalisation improvement in genetic programming for symbolic regression. To this end, a new angle-driven selection operator and two new angle-driven geometric search operators are proposed. The angle-awareness brings new geometric properties to these geometric operators, which are expected to provide a greater leverage for approximating the target semantics in each operation, and more importantly, be resistant to overfitting. The experiments show that compared with two state-of-the-art geometric semantic operators, our angle-driven geometric operators not only drive the evolutionary process to fit the target semantics more efficiently but also improve the generalisation performance. A further comparison between the evolved models shows that the new method generally produces simpler models with a much smaller size and is more likely to evolve towards the correct structure of the target models.

15 November 2018 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
QCQi Chen
Qi Chen
MZMengjie Zhang
Mengjie Zhang
Bing XueBing Xue
Bing Xue
Generalisation ability, which reflects the prediction ability of a learnt model, is an important property in genetic programming for symbolic regression. Structural risk minimisation is a framework providing a reliable estimation of the generalisation performance of prediction models. Introducing the framework into genetic programming has the potential to drive the evolutionary process towards models with good generalisation performance. However, this is tough due to the difficulty in obtaining the Vapnik-Chervonenkis dimension of nonlinear models. To address this difficulty, this paper proposes a structural risk minimisation-driven genetic programming approach, which uses an experimental method (instead of theoretical estimation) to measure the Vapnik-Chervonenkis dimension of a mixture of linear and nonlinear regression models for the first time. The experimental method has been conducted using uniform and non-uniform settings. The results show that our method has impressive generalisation gains over standard genetic programming and genetic programming with the 0.632 bootstrap, and that the proposed method using the non-uniform setting has further improvement than its counterpart using the uniform setting. Further analyses reveal that the proposed method can evolve more compact models, and that the behavioural difference between these compact models and the target models is much smaller than their counterparts evolved by the other genetic programming methods.