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.
- Ảnh hưởng của bức xạ gamma đến tính chất quang của chấm lượng tử CdSe
- Ảnh hưởng của độ dày lớp điện môi lên trạng thái ngưng tụ exciton trong cấu trúc graphene hai lớp
- Đánh giá tình hình nhiễm vi khuẩn Escherichia Coli, Salmonellas spp. trên thịt lợn tại một số chợ trọng điểm trên địa bàn thành phố Quy Nhơn, tỉnh Bình Định
- Efficient, column-chromatography-free synthesis of Dipterocarpol succinate oxime ester salts
- Protective effects of methanolic extract of Bauhinia vahlii L. in sepsis rats induced by cecal ligation and puncture





