A dynamic attribute reduction algorithm based on relative neighborhood discernibility degree

Abstract

Abstract This paper addresses the current existence of attribute reduction algorithms for incomplete hybrid decision-making systems, including low attribute reduction efficiency, low classification accuracy and lack of consideration of unlabeled data types. To address these issues, this paper first redefines the weakly labeled relative neighborhood discernibility degree and develops a non-dynamic attribute reduction algorithm. In addition, this paper proposes an incremental update mechanism for weakly tagged relative neighborhood discernibility degree and introduces a new dynamic attribute reduction algorithm for increasing the set of objects based on it. Meanwhile, this paper also compares and analyses the improved algorithm proposed in this study with two existing attribute reduction algorithms using 8 data sets in the UCI database. The results show that the dynamic attribute reduction algorithm proposed in this paper achieves higher attribute reduction efficiency and classification accuracy, which further validates the effectiveness of the algorithm proposed in this paper.

Keywords

• Attribute reduction
• Incremental update mechanism
• Relative neighborhood discernibility degree
• Weakly labeled data