Bach Hoai Nguyen

Bach Hoai Nguyen

Auto-generated profile, based on publicly available information

Bach Hoai Nguyen

Centre of Data Science and Artificial Intelligence and School of Engineering and Computer Science, Victoria University of Wellington, Wellington, New Zealand

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
5 July 2023 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
RJRuwang Jiao
Ruwang Jiao
BNBach Hoai Nguyen
Bach Hoai Nguyen
Bing XueBing Xue
Bing Xue
MZMengjie Zhang
Mengjie Zhang
Maximizing the classification accuracy and minimizing the number of selected features are two primary objectives in feature selection, which is inherently a multiobjective task. Multiobjective feature selection enables us to gain various insights from complex data in addition to dimensionality reduction and improved accuracy, which has attracted increasing attention from researchers and practitioners. Over the past two decades, significant advancements in multiobjective feature selection in classification have been achieved in both the methodologies and applications, but have not been well summarized and discussed. To fill this gap, this paper presents a broad survey on existing research on multiobjective feature selection in classification, focusing on up-to-date approaches, applications, current challenges, and future directions. To be specific, we categorize multiobjective feature selection in classification on the basis of different criteria, and provide detailed descriptions of representative methods in each category. Additionally, we summarize a list of successful real-world applications of multiobjective feature selection from different domains, to exemplify their significant practical value and demonstrate their abilities in providing a set of trade-off feature subsets to meet different requirements of decision makers. We also discuss key challenges and shed lights on emerging directions for future developments of multiobjective feature selection.

30 April 2019 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
BNBach Hoai Nguyen
Bach Hoai Nguyen
Bing XueBing Xue
Bing Xue
PAPeter Andreae
Peter Andreae
HIHisao Ishibuchi
Hisao Ishibuchi
MZMengjie Zhang
Mengjie Zhang
Feature selection is an important task in machine learning that has two main objectives: reducing dimensionality and improving learning performance. Feature selection can be considered a multi-objective problem. However, it has its problematic characteristics, such as a highly discontinuous Pareto front, imbalance preferences and partially conflicting objectives. These characteristics are not easy for existing evolutionary multi-objective optimization algorithms. We propose a new decomposition approach with two mechanisms (static and dynamic) based on multiple reference points under the MOEA/D (Multi-objective Evolutionary Algorithm based on Decomposition) framework to address the above-mentioned difficulties of feature selection. The static mechanism alleviates the dependence of the decomposition on the Pareto front shape and the effect of the discontinuity. The dynamic one is able to detect regions in which the objectives are mostly conflicting, and allocates more computational resources to the detected regions. In comparison with other evolutionary multi-objective optimization algorithms on 12 different classification datasets, the proposed decomposition approach finds more diverse feature subsets with better performance in terms of hypervolume and inverted generational distance. The dynamic mechanism successfully identifies conflicting regions and further improves the approximation quality for the Pareto fronts.

11 October 2019 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
BNBach Hoai Nguyen
Bach Hoai Nguyen
Bing XueBing Xue
Bing Xue
PAPeter Andreae
Peter Andreae
MZMengjie Zhang
Mengjie Zhang
Particle swarm optimization (PSO) is a heuristic optimization algorithm generally applied to continuous domains. Binary PSO is a form of PSO applied to binary domains but uses the concepts of velocity and momentum from continuous PSO, which leads to its limited performance. In our previous work, we reformulated momentum as a stickiness property and velocity as a flipping probability to develop sticky binary PSO. The initial design provides a good base, but many key factors need to be investigated. In this article, we propose a new algorithm called dynamic sticky binary PSO by developing a dynamic parameter control strategy based on an investigation of exploration and exploitation in the binary search spaces. The proposed algorithm is compared with four state-of-the-art dynamic binary algorithms on two types of binary problems: 1) knapsack and 2) feature selection. The experimental results on the knapsack datasets show that the new velocity and momentum assist sticky binary PSO in evolving better solutions than the benchmark algorithms. On feature selection, the dynamic strategy takes the advantages of these two newly defined movement concepts to help the proposed algorithm to produce smaller feature subsets with higher classification performance. This is the first time in the binary PSO, the four important concepts, that is, velocity, momentum, exploration, and exploitation, are investigated systematically to capture the properties of the binary search spaces to evolve better solutions for binary problems.

9 August 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
BNBach Hoai Nguyen
Bach Hoai Nguyen
Bing XueBing Xue
Bing Xue
MZMengjie Zhang
Mengjie Zhang
Feature selection (FS) is an important data preprocessing technique that selects a small subset of relevant features to improve learning performance. However, it is also challenging due to its large search space. Recently, competitive swarm optimiser (CSO) has shown promising results in FS because of its potential global search ability. The main idea of CSO is to select two solutions randomly and then let the loser (worse fitness) learn from the winner (better fitness). Although such a search mechanism provides a high population diversity, it is at risk of generating unqualified solutions since the winner’s quality is not guaranteed. In this work, we propose a constrained evolutionary mechanism for CSO, which verifies the quality of all the particles and lets the infeasible (unqualified) solutions learn from the feasible (qualified) ones. We also propose a novel local search and a size-change operator that guide the population to search for smaller feature subsets with similar or better classification performance. A surrogate model, based on support vector machines, is proposed to assist both local search and the size-change operator to explore a massive number of potential feature subsets without requiring excessive computational resource. Results on 24 real-world datasets show that the proposed algorithm can select smaller feature subsets with higher classification performance than state-of-the-art evolutionary computation (EC) and non-EC benchmark algorithms.

28 March 2016 in Soft Computing
Verified
Journal Article
Closed access
PDF file
HNHoai Bach Nguyen
Hoai Bach Nguyen
Bing XueBing Xue
Bing Xue
ILIvy Liu
Ivy Liu
PAPeter Andreae
Peter Andreae
MZMengjie Zhang
Mengjie Zhang

7 March 2018 in Memetic Computing
Verified
Journal Article
Closed access
PDF file
HNHoai Bach Nguyen
Hoai Bach Nguyen
BXBing Xue
Bing Xue
PAPeter Andreae
Peter Andreae