CSDL Bài trích Báo - Tạp chí

Trở về

An effective algorithm for computing reducts in decision tables

Tác giả: Do Si Truong, Lam Thanh Hien, Nguyen Thanh Tung
Số trang: P. 277-292
Tên tạp chí: Tin học & Điều khiển học
Số phát hành: Vol 38(3)
Kiểu tài liệu: Tạp chí trong nước
Nơi lưu trữ: 03 Quang Trung
Mã phân loại: 005
Ngôn ngữ: Tiếng Anh
Từ khóa: Feature selection, attribute reduction, attribute clustering, partitioning around medoids clustering, normalized variation of information, rough set
Tó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.

Tạp chí liên quan