Reduction about approximation spaces of covering generalized rough sets

DOI10.1016/j.ijar.2009.11.001zbMath1205.68433OpenAlexW2033857698MaRDI QIDQ985142

Publication date: 20 July 2010

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2009.11.001

zbMATH Keywords

covering data mining granular computing rough set approximation space reduct

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (74)

The rough membership function based on C 10 ¯ and its applications ⋮ \(L\)-fuzzy upper approximation operators associated with \(L\)-generalized fuzzy remote neighborhood systems of \(L\)-fuzzy points ⋮ Uncertainty Measurement for Covering Rough Sets ⋮ Equivalent characterizations of some graph problems by covering-based rough sets ⋮ A rough set model based on fuzzifying neighborhood systems ⋮ Generalized rough sets based on neighborhood systems and topological spaces ⋮ Approximation Operators in Covering Based Rough Sets from Submodular Functions ⋮ Neighborhood operators for covering-based rough sets ⋮ Rough sets and matroids from a lattice-theoretic viewpoint ⋮ Notes on covering-based rough sets from topological point of view: relationships with general framework of dual approximation operators ⋮ Attribute reduction using functional dependency relations in rough set theory ⋮ Reductions of a covering approximation space from algebraic points of view ⋮ A novel notion in rough set theory: invariant subspace ⋮ On some types of covering rough sets from topological points of view ⋮ Matrix approach for fuzzy description reduction and group decision-making with fuzzy \(\beta\)-covering ⋮ An efficient feature selection algorithm based on the description vector and hypergraph ⋮ A comparison study of similarity measures for covering-based neighborhood classifiers ⋮ On generalizing covering approximation space ⋮ Neighbor selection for user-based collaborative filtering using covering-based rough sets ⋮ Grained matrix and complementary matrix: novel methods for computing information descriptions in covering approximation spaces ⋮ Nearness approximation space based on axiomatic fuzzy sets ⋮ The reduction and fusion of fuzzy covering systems based on the evidence theory ⋮ Dominance-based fuzzy rough set analysis of uncertain and possibilistic data tables ⋮ Categorical properties of \(M\)-indiscernibility spaces ⋮ Reduction of neighborhood-based generalized rough sets ⋮ Matroidal approaches to rough sets via closure operators ⋮ Entropy and co-entropy of a covering approximation space ⋮ Rough sets based matrix approaches with dynamic attribute variation in set-valued information systems ⋮ On some types of neighborhood-related covering rough sets ⋮ The lattice and matroid representations of definable sets in generalized rough sets based on relations ⋮ Comparative studies of covering rough set models ⋮ Covering-based fuzzy rough sets ⋮ Roughness in m-semilattices1 ⋮ Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets ⋮ Connections between covering-based rough sets and concept lattices ⋮ Attribute Reduction of Incomplete Information Systems: An Intuitionistic Fuzzy Rough Set Approach ⋮ A generalized modal logic in causal structures ⋮ Algebraic Methods for Granular Rough Sets ⋮ Topological Properties for Approximation Operators in Covering Based Rough Sets ⋮ A Further Investigation to Relative Reducts of Decision Information Systems ⋮ Knowledge Spaces and Reduction of Covering Approximation Spaces ⋮ New Neighborhood Based Rough Sets ⋮ Test cost sensitive multigranulation rough set: model and minimal cost selection ⋮ Partial order relation for approximation operators in covering based rough sets ⋮ Some minimal axiom sets of rough sets ⋮ Characterizations of coverings for upper approximation operators being closure operators ⋮ On measurements of covering rough sets based on granules and evidence theory ⋮ Knowledge reduction of dynamic covering decision information systems when varying covering cardinalities ⋮ Tri-partition neighborhood covering reduction for robust classification ⋮ The characterizations of upper approximation operators based on special coverings ⋮ Fuzzy neighborhood covering for three-way classification ⋮ Relations of reduction between covering generalized rough sets and concept lattices ⋮ Marcus-Wyse topological rough sets and their applications ⋮ A granular reduction algorithm based on covering rough sets ⋮ Covering rough sets based on neighborhoods: an approach without using neighborhoods ⋮ Data compression with homomorphism in covering information systems ⋮ Covering based rough set approximations ⋮ Topological characterizations of covering for special covering-based upper approximation operators ⋮ Relationships among generalized rough sets in six coverings and pure reflexive neighborhood system ⋮ The rough membership functions on four types of covering-based rough sets and their applications ⋮ Homomorphisms-based attribute reduction of dynamic fuzzy covering information systems ⋮ A new approach to rough set based on remote neighborhood systems ⋮ Maps between covering approximation spaces and the product space of two covering approximation spaces ⋮ Attributes reduction algorithms for \(m\)-polar fuzzy relation decision systems ⋮ The characterizations of upper approximation operators based on coverings ⋮ The structures and the connections on four types of covering rough sets ⋮ Fixed points of covering upper and lower approximation operators ⋮ A fuzzy similarity-based rough set approach for attribute selection in set-valued information systems ⋮ Approximation operator based on neighborhood systems ⋮ Different kinds of generalized rough sets based on neighborhoods with a medical application ⋮ Matrix-based set approximations and reductions in covering decision information systems ⋮ Duality, conjugacy and adjointness of approximation operators in covering-based rough sets ⋮ Updating attribute reduction in incomplete decision systems with the variation of attribute set ⋮ Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets

Cites Work

This page was built for publication: Reduction about approximation spaces of covering generalized rough sets