A new type of judgement theorems for attribute characters in information system

TL;DR

This paper introduces a novel set of judgment theorems for attribute characters in information systems, based solely on attribute relationships, and proposes an algorithm for attribute reduct construction.

Contribution

It presents a new approach to judging attribute characters using relationships among attributes, independent of object-attribute relationships, and offers a reduct algorithm based on this theory.

Findings

Theorems determine attribute types via relationships between $E(a)$ and $N(a)$.

Clearer criteria for attribute character judgment through topology analysis.

An extended reduct algorithm based on attribute relationship analysis.

Abstract

The research of attribute characters in information system which contains core, necessary, unnecessary is a basic and important issue in attribute reduct. Many methods for the judgement of attribute characters are based on the relationship between the objects and attributes. In this paper, a new type of judgement theorems which are absolutely based on the relationship among attributes is proposed for the judgement of attribute characters. The method is through comparing the two new attribute sets $E(a)$ and $N(a)$ with respect to the designated attribute $a$ which is proposed in this paper. We conclude that which type of the attribute $a$ belongs to is determined by the relationship between $E(a)$ and $N(a)$ in essence. Secondly, more concise and clear results are given about the judgment of the attribute characters through analyzing the properties of refinement and precise-refinement between $E(a)$ and $N(a)$ in topology. In addition, the relationship among attributes are discussed which is useful for constructing a reduct in the last section of this paper. In the last, we propose a reduct algorithm based on $E(a)$, and this algorithm is an extended application of the analysis of attribute characters above.