Matroidal structure of rough sets based on serial and transitive relations (Q1952848): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/jam/LiuZ12, #quickstatements; #temporary_batch_1731547958265
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3039349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Granular computing applied to ontologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach to attribute reduction in rough set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations and uncertainty measures in incomplete information systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rough set approach to incomplete information systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized rough sets based on reflexive and transitive relations / 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: Relational interpretations of neighborhood operators and rough set approximation operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions and intensions in the rough set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological approaches to covering rough sets / 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: Matroidal structure of rough sets from the viewpoint of graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative analysis for covering-based rough sets through the upper approximation number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Theory for Combinatorial Geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract functional dependency structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized rough sets based on relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relationship between modified sets, topological spaces and rough sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological properties of generalized approximation spaces / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jam/LiuZ12 / rank
 
Normal rank

Latest revision as of 02:52, 14 November 2024

scientific article
Language Label Description Also known as
English
Matroidal structure of rough sets based on serial and transitive relations
scientific article

    Statements

    Matroidal structure of rough sets based on serial and transitive relations (English)
    0 references
    0 references
    0 references
    3 June 2013
    0 references
    Summary: The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery, and data mining. The theory of matroids is a generalization of linear independence in vector spaces. It has been used in combinatorial optimization and algorithm design. In order to take advantages of both rough sets and matroids, in this paper we propose a matroidal structure of rough sets based on a serial and transitive relation on a universe. We define the family of all minimal neighborhoods of a relation on a universe and prove it satisfies the circuit axioms of matroids when the relation is serial and transitive. In order to further study this matroidal structure, we investigate the inverse of this construction: inducing a relation by a matroid. The relationships between the upper approximation operators of rough sets based on relations and the closure operators of matroids in the above two constructions are studied. Moreover, we investigate the connections between the above two constructions.
    0 references
    connectedness in a matroid
    0 references
    rough sets
    0 references
    matroidal structure
    0 references
    upper approximation operators of rough sets
    0 references
    closure operators of matroids
    0 references

    Identifiers