Lam Thu Bui
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Lam Thu Bui has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Ananthram Swami
DEVCOM Army Research Lab, Adelphi, MD, USA
1 shared publication Anh Viet Phan
Japan Advanced Institute of Information Technology Nomi 923-1211 Japan
1 shared publication- Chi Trung Ha
Le Quy Don Technical University
1 shared publication - Duc-Dung Nguyen
Vietnam Academy of Science and Technology
1 shared publication - Huynh Thi Thanh Binh
Hanoi University of Science and Technology, Hanoi, Vietnam
1 shared publication Le Cong Thanh
1 shared publication
Latest Publications
- Open Access
A Multifactorial Optimization Paradigm for Linkage Tree Genetic Algorithm
Linkage Tree Genetic Algorithm (LTGA) is an effective Evolutionary Algorithm (EA) to solve complex problems using the linkage information between problem variables. LTGA performs well in various kinds of single-task optimization and yields promising results in comparison with the canonical genetic algorithm. However, LTGA is an unsuitable method for dealing with multi-task optimization problems. On the other hand, Multifactorial Optimization (MFO) can simultaneously solve independent optimization problems, which are encoded in a unified representation to take advantage of the process of knowledge transfer. In this paper, we introduce Multifactorial Linkage Tree Genetic Algorithm (MF-LTGA) by combining the main features of both LTGA and MFO. MF-LTGA is able to tackle multiple optimization tasks at the same time, each task learns the dependency between problem variables from the shared representation. This knowledge serves to determine the high-quality partial solutions for supporting other tasks in exploring the search space. Moreover, MF-LTGA speeds up convergence because of knowledge transfer of relevant problems. We demonstrate the effectiveness of the proposed algorithm on two benchmark problems: Clustered Shortest-Path Tree Problem and Deceptive Trap Function. In comparison to LTGA and existing methods, MF-LTGA outperforms in quality of the solution or in computation time.
Open AccessA Multifactorial Optimization Paradigm for Linkage Tree Genetic Algorithm
Linkage Tree Genetic Algorithm (LTGA) is an effective Evolutionary Algorithm (EA) to solve complex problems using the linkage information between problem variables. LTGA performs well in various kinds of single-task optimization and yields promising results in comparison with the canonical genetic algorithm. However, LTGA is an unsuitable method for dealing with multi-task optimization problems. On the other hand, Multifactorial Optimization (MFO) can simultaneously solve independent optimization problems, which are encoded in a unified representation to take advantage of the process of knowledge transfer. In this paper, we introduce Multifactorial Linkage Tree Genetic Algorithm (MF-LTGA) by combining the main features of both LTGA and MFO. MF-LTGA is able to tackle multiple optimization tasks at the same time, each task learns the dependency between problem variables from the shared representation. This knowledge serves to determine the high-quality partial solutions for supporting other tasks in exploring the search space. Moreover, MF-LTGA speeds up convergence because of knowledge transfer of relevant problems. We demonstrate the effectiveness of the proposed algorithm on two benchmark problems: Clustered Shortest-Path Tree Problem and Deceptive Trap Function. In comparison to LTGA and existing methods, MF-LTGA outperforms in quality of the solution or in computation time.
- Open Access
Convolutional Neural Networks over Control Flow Graphs for Software Defect Prediction
Existing defects in software components is unavoidable and leads to not only a waste of time and money but also many serious consequences. To build predictive models, previous studies focus on manually extracting features or using tree representations of programs, and exploiting different machine learning algorithms. However, the performance of the models is not high since the existing features and tree structures often fail to capture the semantics of programs. To explore deeply programs' semantics, this paper proposes to leverage precise graphs representing program execution flows, and deep neural networks for automatically learning defect features. Firstly, control flow graphs are constructed from the assembly instructions obtained by compiling source code; we thereafter apply multi-view multi-layer directed graph-based convolutional neural networks (DGCNNs) to learn semantic features. The experiments on four real-world datasets show that our method significantly outperforms the baselines including several other deep learning approaches.
Open AccessConvolutional Neural Networks over Control Flow Graphs for Software Defect Prediction
Existing defects in software components is unavoidable and leads to not only a waste of time and money but also many serious consequences. To build predictive models, previous studies focus on manually extracting features or using tree representations of programs, and exploiting different machine learning algorithms. However, the performance of the models is not high since the existing features and tree structures often fail to capture the semantics of programs. To explore deeply programs' semantics, this paper proposes to leverage precise graphs representing program execution flows, and deep neural networks for automatically learning defect features. Firstly, control flow graphs are constructed from the assembly instructions obtained by compiling source code; we thereafter apply multi-view multi-layer directed graph-based convolutional neural networks (DGCNNs) to learn semantic features. The experiments on four real-world datasets show that our method significantly outperforms the baselines including several other deep learning approaches.
- Open Access
- 17 August 2017
- Published by Publishing House for Science and Technology, Vietnam Academy of Science and Technology (Publications)
MỘT PHƯƠNG PHÁP PHÂN ĐOẠN KÝ TỰ CHO BÀI TOÁN NHẬN DẠNG CHỮ VIẾT TAY ONLINE
MỘT PHƯƠNG PHÁP PHÂN ĐOẠN KÝ TỰ CHO BÀI TOÁN NHẬN DẠNG CHỮ VIẾT TAY ONLINE
- 17 August 2017
- Published by Publishing House for Science and Technology, Vietnam Academy of Science and Technology (Publications)
Open AccessMỘT PHƯƠNG PHÁP PHÂN ĐOẠN KÝ TỰ CHO BÀI TOÁN NHẬN DẠNG CHỮ VIẾT TAY ONLINE
MỘT PHƯƠNG PHÁP PHÂN ĐOẠN KÝ TỰ CHO BÀI TOÁN NHẬN DẠNG CHỮ VIẾT TAY ONLINE
- 25 March 2017
- Published by Springer Nature
- p. 140-155
An Online Packing Heuristic for the Three-Dimensional Container Loading Problem in Dynamic Environments and the Physical Internet
- 25 March 2017
- Published by Springer Nature
- p. 140-155
An Online Packing Heuristic for the Three-Dimensional Container Loading Problem in Dynamic Environments and the Physical Internet