Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction (Q2333783): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129217497, #quickstatements; #temporary_batch_1726345393210
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Xiao Hong Zhang / rank
Normal rank
 
Property / author
 
Property / author: Xiao Hong Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3390/sym10090418 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2890908789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rough sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning fuzzy rules from fuzzy samples based on rough set technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relationship between attribute reducts in rough sets and minimal vertex covers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4709286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revealed indifference and models of choice behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiorders and a Theory of Utility Discrimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized rough sets based on relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction and axiomization of covering generalized rough sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationship among basic concepts in covering-based rough sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some types of fuzzy covering-based rough sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some types of covering rough sets from topological points of view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatic approaches to rough approximation operators via ideal on a complete completely distributive lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rough Set Theory and Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-way decisions with intuitionistic fuzzy decision-theoretic rough sets based on point operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the union and intersection operations of rough sets based on various approximation spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive approximation: an accelerator for attribute reduction in rough set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroidal structure of skew polynomial rings with application to network coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks, Matroids, and Non-Shannon Information Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Matroid of Rough Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroidal approaches to rough sets via closure operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rough sets and matroids from a lattice-theoretic viewpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of matrices to a matroidal structure of rough sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive and algebraic methods of the theory of rough sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3501135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4892379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic structures of generalized rough set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy anti-grouped filters and fuzzy normal filters in pseudo-BCI algebras / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129217497 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:34, 14 September 2024

scientific article
Language Label Description Also known as
English
Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction
scientific article

    Statements

    Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction (English)
    0 references
    0 references
    0 references
    0 references
    13 November 2019
    0 references
    Summary: Rough sets provide a useful tool for data preprocessing during data mining. However, many algorithms related to some problems in rough sets, such as attribute reduction, are greedy ones. Matroids propose a good platform for greedy algorithms. Therefore, it is important to study the combination between rough sets and matroids. In this paper, we investigate rough sets and matroids through their operators, and provide a matroidal method for attribute reduction in information systems. Firstly, we generalize four operators of rough sets to four operators of matroids through the interior, closure, exterior and boundary axioms, respectively. Thus, there are four matroids induced by these four operators of rough sets. Then, we find that these four matroids are the same one, which implies the relationship about operators between rough sets and matroids. Secondly, a relationship about operations between matroids and rough sets is presented according to the induced matroid. Finally, the girth function of matroids is used to compute attribute reduction in information systems.
    0 references
    rough set
    0 references
    matroid
    0 references
    operator
    0 references
    attribute reduction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers