A distance based incremental filter-wrapper algorithm for finding reduct in incomplete decision tables

Nguyen Ba Quang, Nguyen Long Giang, Dang Thi Oanh
Author affiliations

Authors

  • Nguyen Ba Quang Hanoi Architectural University, Km 10 Nguyen Trai, Thanh Xuan, Ha Noi, Viet Nam
  • Nguyen Long Giang Institute of Information Technology, Vietnam Academy of Science and Technology, 18 Hoang Quoc Viet, Cau Giay, Ha Noi, Viet Nam
  • Dang Thi Oanh University of Information and Communication Technology, Thai Nguyen University, Z115 Quyet Thang, Thai Nguyen, Viet Nam

DOI:

https://doi.org/10.15625/2525-2518/57/4/13773

Keywords:

Tolerance rough set, distance, incremental algorithm, incomplete decision table, attribute reduction, reduct,

Abstract

Tolerance rough set model is an effective tool for attribute reduction in incomplete decision tables. In recent years, some incremental algorithms have been proposed to find reduct of dynamic incomplete decision tables in order to reduce computation time. However, they are classical filter algorithms, in which the classification accuracy of decision tables is computed after obtaining reduct. Therefore, the obtained reducts of these algorithms are not optimal on cardinality of reduct and classification accuracy. In this paper, we propose the incremental filter-wrapper algorithm IDS_IFW_AO to find one reduct of an incomplete desision table in case of adding multiple objects. The experimental results on some sample datasets show that the proposed filter-wrapper algorithm IDS_IFW_AO is more effective than the filter algorithm IARM-I [17] on classification accuracy and cardinality of reduct

Downloads

Download data is not yet available.

Downloads

Published

01-07-2019

How to Cite

[1]
N. B. Quang, N. L. Giang, and D. T. Oanh, “A distance based incremental filter-wrapper algorithm for finding reduct in incomplete decision tables”, Vietnam J. Sci. Technol., vol. 57, no. 4, pp. 499–512, Jul. 2019.

Issue

Section

Electronics - Telecommunication