An effective algorithm for computing reducts in decision tables
Tác giả: Do Si Truong, Lam Thanh Hien, Nguyen Thanh TungTóm tắt:
In this paper, we propose a reduct computing algorithm using attribute clustering. The proposed algorithm works in three main stages. In the first stage, irrelevant attributes are eliminated. In the second stage relevant attributes are divided into appropriately selected number of clusters by Partitioning Around Medoids (PAM) clustering method integrated with a special metric in attribute space which is the normalized variation of information. In the third stage, the representative attribute from each cluster is selected that is the most class-related. The selected attributes form the approximate reduct. The proposed algorithm is implemented and experimented. The experimental results show that the proposed algorithm is capable of computing approximate reduct with small size and high classification accuracy, when the number of clusters used to group the attributes is appropriately selected.
- Solving constrained optimization tasks in civil engineering using ε- Differential Evolution developed with Visual C#. NET = Giải các bài toán tối ưu hóa có ràng buộc trong ngành xây dựng sử dụng thuật toán ε - tiến hóa vi phân được phát triển với ngôn ngữ
- p-adaptive meshing for triangular nodal finite elements meshes
- h-adaptive refinement strategies for triangular finite element meshes





