Matrix approach to rough sets through vector matroids over a field
Rough sets were proposed to deal with the vagueness and incompleteness of knowledge in information systems. There are may optimization issues in this field such as attribute reduction. Matroids generalized from matrices are widely used in optimization. Therefore, it is necessary to connect matroids with rough sets. In this paper, we take field into consideration and introduce matrix to study rough sets through vector matroids. First, a matrix representation of an equivalence relation is proposed, and then a matroidal structure of rough sets over a field is presented by the matrix. Second, the properties of the matroidal structure including circuits, bases and so on are studied through two special matrix solution spaces, especially null space. Third, over a binary field, we construct an equivalence relation from matrix null space, and establish an algebra isomorphism from the collection of equivalence relations to the collection of sets, which any member is a family of the minimal non-empty sets that are supports of members of null space of a binary dependence matrix. In a word, matrix provides a new viewpoint to study rough sets.
Code (0)
등록된 구현이 없습니다.
Tasks
AttributeRelationSimilar Papers 제목 키워드 기반
Rough matroids based on coverings
The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the al…
Combinatorial OptimizationDependence space of matroids and its application to attribute reduction
Attribute reduction is a basic issue in knowledge representation and data mining. Rough sets provide a theoretical foundation for the issue. Matroids generalized from matrices have been widely used in many fields, partic…
AttributeClosed-set lattice of regular sets based on a serial and transitive relation through matroids
Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related …
AllRelationConnectivity for matroids based on rough sets
In mathematics and computer science, connectivity is one of the basic concepts of matroid theory: it asks for the minimum number of elements which need to be removed to disconnect the remaining nodes from each other. It …
RelationConnectedness of graphs and its application to connected matroids through covering-based rough sets
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in…