Characteristic matrix of covering and its application to Boolean matrix decomposition
From MaRDI portal
Publication:903648
DOI10.1016/J.INS.2013.10.018zbMath1328.68232OpenAlexW2044758434MaRDI QIDQ903648
William Zhu, Fan Min, Qingxin Zhu, Shiping Wang
Publication date: 14 January 2016
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.10.018
Reasoning under uncertainty in the context of artificial intelligence (68T37) Boolean and Hadamard matrices (15B34)
Related Items (17)
Connectedness of graphs and its application to connected matroids through covering-based rough sets ⋮ Novel matrix-based approaches to computing minimal and maximal descriptions in covering-based rough sets ⋮ Two fuzzy covering rough set models and their generalizations over fuzzy lattices ⋮ Characterizing Hierarchies on Covering-Based Multigranulation Spaces ⋮ A novel notion in rough set theory: invariant subspace ⋮ Matrix approach for fuzzy description reduction and group decision-making with fuzzy \(\beta\)-covering ⋮ A comparison study of similarity measures for covering-based neighborhood classifiers ⋮ Grained matrix and complementary matrix: novel methods for computing information descriptions in covering approximation spaces ⋮ Couple fuzzy covering rough set models and their generalizations to CCD lattices ⋮ Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets ⋮ Connectedness of Graph and Matroid by Covering-Based Rough Sets ⋮ The Connectivity of the Covering Approximation Space ⋮ Matrix approach to spanning matroids of rough sets and its application to attribute reduction ⋮ Knowledge reduction of dynamic covering decision information systems when varying covering cardinalities ⋮ The investigation of covering rough sets by Boolean matrices ⋮ A fuzzy covering-based rough set model and its generalization over fuzzy lattice ⋮ Basic co-occurrence latent semantic vector space model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- The reduction and fusion of fuzzy covering systems based on the evidence theory
- Attribute reduction of data with error ranges and test costs
- A fast output-sensitive algorithm for Boolean matrix multiplication
- Covering based rough set approximations
- Approximations and uncertainty measures in incomplete information systems
- Generalized intuitionistic fuzzy rough sets based on intuitionistic fuzzy coverings
- The fourth type of covering-based rough sets
- Topological characterizations of covering for special covering-based upper approximation operators
- A bound on the scrambling index of a primitive matrix using Boolean rank
- On axiomatic characterizations of three pairs of covering based approximation operators
- A novel approach to fuzzy rough sets based on a fuzzy covering
- The algebraic structures of generalized rough set theory
- Applications of interval valued \(t\)-norms (\(t\)-conorms) to fuzzy \(n\)-ary sub-hypergroups.
- A comparison of two types of rough sets induced by coverings
- Generalized lower and upper approximations in a ring.
- Invertible approximation operators of generalized rough sets and fuzzy rough sets
- Relationship between generalized rough sets based on binary relation and covering
- On lower separation axioms
- Reduction and axiomization of covering generalized rough sets.
- Principal component analysis.
- Quantitative analysis for covering-based rough sets through the upper approximation number
- Generalized fuzzy rough approximation operators based on fuzzy coverings
- Axiomatic systems for rough sets and fuzzy rough sets
- Generalized rough sets over fuzzy lattices
- Numerical Attribute Reduction Based on Neighborhood Granulation and Rough Approximation
- Learning the parts of objects by non-negative matrix factorization
This page was built for publication: Characteristic matrix of covering and its application to Boolean matrix decomposition
